Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
TCP Performance in Wireless Multi-hop Networks
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Challenges of intervehicle ad hoc networks
IEEE Transactions on Intelligent Transportation Systems
A probabilistic protocol for multihop routing in VANETs
Journal of Electrical and Computer Engineering
VANET in eyes of hierarchical topology
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
Cognitive Agent Based Critical Information Gathering and Dissemination in Vehicular Ad hoc Networks
Wireless Personal Communications: An International Journal
A Cluster-Based Beaconing Approach in VANETs: Near Optimal Topology Via Proximity Information
Mobile Networks and Applications
Review: Information management in vehicular ad hoc networks: A review
Journal of Network and Computer Applications
| Hi-index | 0.00 |
We consider the problem of optimal next-hop selection in a route between two vehicles, for a simple scenario of Vehicular ad hoc networks (VANETs) on a highway. For a given approximation of the optimal number of hops, we seek the optimal choice of next-hop based on its speed and inter-node distances, so as to maximize the expected route lifetime. Under a Markovian assumption on the process of speed of nodes, we show that the optimal choice of speeds attempts to equalize the lifetimes of adjacent links. A monotone variation property of the speed of relay nodes under the optimal policy is proved. These properties have been confirmed with simulations. The optimal policies and their structures can assist in enhancing the performance of existing VANET routing protocols.