An efficient distributed mutual exclusion algorithm for intersection traffic control
- Authors
- Lim, JongBeom; Jeong, Young Sik; Park, Doo-Soon; Lee, HwaMin
- Issue Date
- Mar-2018
- Publisher
- Kluwer Academic Publishers
- Keywords
- Mutual exclusion; Intersection traffic control; Intelligent transportation system; Vehicular cloud computing
- Citation
- Journal of Supercomputing, v.74, no.3, pp 1090 - 1107
- Pages
- 18
- Journal Title
- Journal of Supercomputing
- Volume
- 74
- Number
- 3
- Start Page
- 1090
- End Page
- 1107
- URI
- https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/6185
- DOI
- 10.1007/s11227-016-1799-3
- ISSN
- 0920-8542
1573-0484
- Abstract
- As vehicular networking has recently been developed and commercialized, vehicular cloud computing has received much attention in various research areas, such as intelligent transportation systems and vehicular ad hoc networks. An efficient intersection traffic control using vehicular cloud computing is one of the key research topics in intelligent transportation systems. To efficiently deal with intersection traffic control via vehicle-to-vehicle communications, we design a distributed mutual exclusion algorithm that does not rely on broadcast, which introduces communication overheads; instead, our algorithm use point-to-point messages sent between the vehicles to keep network traffic load lower. In our algorithmic design, to pass an intersection, the lead vehicle on a lane must get permissions from a subset of other vehicles and its following vehicles on the same lane can follow the lead vehicle without permissions unlike the previous research. To evaluate the performance of our distributed mutual exclusion algorithm, we conduct extensive experiments. The results show that our algorithmic design is both effective and efficient.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Department of Computer Software Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.