Geocast enhancements of AODV for vehicular networks
ACM SIGMOBILE Mobile Computing and Communications Review
Location-based localized alternate, disjoint and multi-path routing algorithms for wireless networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
A scalable quorum-based location service in ad hoc and sensor networks
International Journal of Communication Networks and Distributed Systems
Octopus: a fault-tolerant and efficient ad-hoc routing protocol
Wireless Networks
A delaunay triangulation architecture supporting churn and user mobility in MMVEs
Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
Reliability and fault tolerance of coverage models for sensor networks
International Journal of Sensor Networks
Reliable ring based multicast routing scheme in MANET: an agent based approach
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
Privacy-preserving data-oblivious geometric algorithms for geographic data
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
E-DIR: a directional routing protocol for VANETs in a city traffic environment
International Journal of Information and Communication Technology
Performance Analysis of P-GEDIR Protocol for Vehicular Ad Hoc Network in Urban Traffic Environments
Wireless Personal Communications: An International Journal
Effect of Mobility Models on the Performance of LAR Protocol for Vehicular Ad Hoc Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
In this paper, we propose a general algorithm (based on an unified framework for both routing and geocasting problems), in which message is forwarded to exactly those neighbors which may be best choices for a possible position of destination (using the appropriate criterion). We then propose and discuss new VD-GREEDY and CH-MFR methods and define R-DIR, modified version of existing directional methods. In VD-GREEDY method, these neighbors are determined by intersecting the Voronoi diagram of neighbors with the circle (or rectangle) of possible positions of destination, while the portion of the convex hull of neighboring nodes is analogously used in the CH-MFR method. Routing and geocasting algorithms differ only inside the circle/rectangle. The proposed methods may be also used for the destination search phase allowing the application of different routing schemes after the exact position of destination is discovered. VD-GREEDY and CH-MFR algorithms are loop free, and have smaller flooding rate (with similar success rate) compared to directional method. We proposed to use dominating set concept to reduce flooding ratio significantly, with a marginal impact on success rate and hop count. Simulations, involving the proposed and some known algorithms, are performed for two basic scenarios, one for geocasting and reactive routing, and the other for proactive routing, and both showed that our methods have higher success rate and lower flooding rate compared to existing methods. Copyright © 2006 John Wiley & Sons, Ltd.