GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
CarNet: a scalable ad hoc wireless network system
EW 9 Proceedings of the 9th workshop on ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Geographic routing in city scenarios
ACM SIGMOBILE Mobile Computing and Communications Review
Latent Handover: A flow-oriented progressive handover mechanism
Computer Communications
Routing Protocols for Vehicular Ad Hoc Networks That Ensure Quality of Service
ICWMC '08 Proceedings of the 2008 The Fourth International Conference on Wireless and Mobile Communications
Hi-index | 0.00 |
In sparse Vehicular Ad Hoc Networks (VANET), node forwards packet using the idea of "carry and forward" in order to improve the delivery rate. This paper analyzed the delay performance in sparse VANET, where a formula for packet delivery end-to-end delay was given. An algorithm named DEA(Delay Evaluation Algorithm) was proposed as a benchmark to evaluate the end to end delay. Using the neighbor relationship of nodes as input, DEA outputs the minimal end-to-end delay as well as the routing path with the minimal delay. DEA can also be used as routing algorithm in a network where node moves regularly. The simulation results show that DEA can get the minimal end-to-end delay and evaluate other protocol.