BLR: beacon-less routing algorithm for mobile ad hoc networks

Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well with these scenarios. The beacon-less routing algorithm (BLR) presented in this paper is a routing protocol that makes use of location information to reduce routing overhead. However, unlike other position-based routing protocols, BLR does not require nodes to periodically broadcast Hello-messages (called beaconing), and thus avoids drawbacks such as extensive use of scarce battery-power, interferences with regular data transmission, and performance degradation. BLR selects a forwarding node in a distributed manner among all its neighboring nodes with having information neither about their positions nor even about their existence. Data packets are broadcasted and the protocol takes care that just one of the receiving nodes forwards the packet. Optimized forwarding is achieved by applying a concept of dynamic for...

• Type: Journal
• Year: 2004
• Where: COMCOM
• Authors: Marc Heissenbüttel, Torsten Braun, Thomas Bernoulli, Markus Wälchli
• Keywords: COMCOM 2004, Mobile Ad Hoc Networks, Routing, Routing Protocols