Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Stable Node-Disjoint Multipath Routing with Low Overhead in Mobile Ad Hoc Networks
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Adaptive backup routing for ad-hoc networks
Computer Communications
Evaluating the limitations of and alternatives in beaconing
Ad Hoc Networks
Reducing Congestion Effects in Wireless Networks by Multipath Routing
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Node-Disjoint Multipath Routing with Zoning Method in MANETs
HPCC '08 Proceedings of the 2008 10th IEEE International Conference on High Performance Computing and Communications
Review: Survey of multipath routing protocols for mobile ad hoc networks
Journal of Network and Computer Applications
Beacon-less geographic routing made practical: challenges, design guidelines, and protocols
IEEE Communications Magazine
Phero-trail: a bio-inspired location service for mobile underwater sensor networks
IEEE Journal on Selected Areas in Communications
HLLS: A History information based Light Location Service for MANETs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stateless Multicast Protocol for Ad Hoc Networks
IEEE Transactions on Mobile Computing
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
Hi-index | 0.00 |
Multipath routing has been considered as one of the most efficient and reliable routing solutions for ad hoc networks. Compared with the link-disjoint paths, the node-disjoint paths are less likely to fail and provide better performance for load balancing. In this paper, a novel multipath routing protocol called BGM (Beacon-less Geographic Multipath routing protocol) is proposed to construct maximally node-disjoint multiple paths. Unlike most existing multipath routing protocols based on AODV or DSR, the proposed geographic routing algorithm utilizes location information to discover multiple paths. Therefore it avoids lots of control messages caused by route discovery and maintenance in the topology-based protocols. In the proposed scheme, each node discovers multiple paths and forwards data packets within a disjoint sub-zone divided by a division algorithm. Moreover, in order to reduce the control overhead, a distributed forwarding strategy is presented by applying the beacon-less mechanism. The beacon-less mechanism does not require nodes to periodically broadcast the Hello messages. Instead, the neighbors of a forwarding node contend to deliver data packets. Simulation results show that BGM not only improves the efficiency of the path discovery, but also reduces the control overhead. Also, BGM provides relatively short end-to-end delay while keeping the packet delivery ratio above 95 %.