dc.description.abstract | The emerging adoption of wireless communications on surface transportation systems has generated extensive interest among researchers over the last several years. Using advanced WLAN technologies, vehicular ad-hoc networks have become viable and valuable for their wide variety of novel applications such as road-safety, multimedia content sharing, online gaming, internet on vehicles, and commerce on wheels. Multi-hop information dissemination in vehicular ad hoc networks is constrained by high mobility of vehicles and frequent disconnections. We propose a destination discovery oriented routing (DDOR) scheme for Highway/Freeway VANETs. DDOR consists of a unicast destination discovery process, a robust forward node selection mechanism and a positional hello mechanism. In this work, no dedicated path is framed in order to prevent frequent path maintenance. In addition, the elimination of flooding and location services substantially reduces the control overhead. Positional hello scheme ensures connectivity and diminishes control overhead concurrently. Simulation results signify the benefits of the proposed routing strategy which has higher packet delivery ratio, reduced routing overhead and shorter delay compared with existing routing protocols. Currently, the geographic routing protocols are widely adopted for city scenarios as they do not require route construction and route maintenance phases. Again, with connectivity awareness they perform well in terms of reliable delivery. To obtain destination position, such protocols employ location service or flooding. Flooding can be detrimental in city environments as probe packets are not safeguarded by RTS-CTS. Further, in case of sparse and void regions, frequent use of recovery strategy in such protocols elevates hop-count. Some of the geographic routing protocols adopt minimum weighted algorithm based on distance or connectivity to select the intermediate intersections. However, the shortest path or the path with higher connectivity may include numerous intermediate intersections. As a result, these protocols yield routing paths with higher hop-count. We propose a back-bone assisted hop-greedy (BAHG) routing scheme to address these problems by selecting a routing path with minimum number of intermediate intersection nodes while taking connectivity into considerations. Besides, we introduce back bone nodes which play a key role in providing connectivity status around an intersection. Apart from this, by tracking the movement of source as well as destination, the back bone nodes enable a packet to be forwarded in the changed direction. Simulation results demonstrate that the proposed routing strategy outperforms state-of-art geographic routing protocols in terms of packet delivery ratio and end-to-end delay.
| en_US |