Traffic management at road intersections is a complex requirement that has been an important topic of research and\ndiscussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs\nare high mobility, restriction of road setup, frequent topology variations, failed network links, and timely\ncommunication of data, which make the routing of packets to a particular destination problematic. To address these\nissues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between\nvehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand\nrouting algorithm (MDORA). It aims to find an optimal route on a hop-by-hop basis based on the maximum distance\ntoward the destination from the sender and sufficient communication lifetime, which guarantee the completion of the\ndata transmission process. Moreover, communication overhead is minimized by finding the next hop and forwarding\nthe packet directly to it without the need to discover the whole route first. A comparison is performed between\nMDORA and ad hoc on-demand distance vector (AODV) protocol in terms of throughput, packet delivery ratio, delay,\nand communication overhead. The outcome of the proposed algorithm is better than that of AODV.
Loading....