Please note PRISM will be upgraded March 27-28 to make the submission process better for you! No new content can be added during this time. We apologize for the inconvenience.

Show simple item record

dc.contributor.authorAbedi, Alieng
dc.contributor.authorGhaderi, Majideng
dc.contributor.authorWilliamson, Careyeng
dc.description.abstractIn this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points, we utilize vehicle-to-vehicle communication to propagate data in the network. Vehicular networks are highly dynamic, and hence routing algorithms that require global network state information or centralized coordination are not suitable for such networks. Instead, we develop a novel distributed routing algorithm that requires minimal coordination among vehicles, while achieving a highly efficient throughput-delay tradeoff. Specifically, we show that the proposed algorithm achieves a throughput that is within a factor of 1=e of the throughput of an algorithm that centrally coordinates vehicle transmissions in a highly dense network, and yet its end-to-end delay is approximately half of that of a widely studied ALOHA-based randomized routing algorithm. We evaluate our algorithm analytically and through simulations and compare its throughput-delay performance against the ALOHA-based randomized routing.eng
dc.subjectdistributed routingeng
dc.subject.otherVehicular ad hoc networks, Distributed routing, Throughput, Delayeng
dc.titleDistributed Routing for Vehicular Ad Hoc Networks: Throughput-Delay Tradeoffeng
dc.typetechnical reporteng
dc.publisher.corporateUniversity of Calgaryeng
dc.identifier.doi Scienceeng

Files in this item


This item appears in the following Collection(s)

Show simple item record