Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
TOSSIM: accurate and scalable simulation of entire TinyOS applications
Proceedings of the 1st international conference on Embedded networked sensor systems
Position-based multicast routing for mobile Ad-hoc networks
ACM SIGMOBILE Mobile Computing and Communications Review
Exploring Mesh and Tree-Based Multicast Routing Protocols for MANETs
IEEE Transactions on Mobile Computing
Evaluating the limitations of and alternatives in beaconing
Ad Hoc Networks
Area-based beaconless reliable broadcasting in sensor networks
International Journal of Sensor Networks
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance
IEEE Transactions on Mobile Computing
Stateless Multicast Protocol for Ad Hoc Networks
IEEE Transactions on Mobile Computing
Position-based routing in ad hoc networks
IEEE Communications Magazine
Multicast over wireless mobile ad hoc networks: present and future directions
IEEE Network: The Magazine of Global Internetworking
GEographic multicast (GEM) for dense wireless networks: protocol design and performance analysis
IEEE/ACM Transactions on Networking (TON)
IPv6 Multicast Forwarding in RPL-Based Wireless Sensor Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
We study the problem of geographic multicast routing (GMR) in a wireless sensor network. In particular, we are interested in geographic routing solutions with a very limited control overhead and overall bandwidth consumption. Existing GMR protocols require nodes to periodically exchange beacon messages to gather information about the position of their neighbors. These beacons represent a waste of resources, specially in areas of the network with no active communications. Beacons also induce significant problems in real deployments such as interferences and collisions that cause inconsistencies in neighboring tables. In this paper we propose a new beacon-less geographic multicast routing protocol called BRUMA. Unlike previous solutions, BRUMA uses the propagation of data packets to opportunistically select next hops among those that are reachable from the sending node. In addition, we contribute a novel next hop selection function by which candidate next hops schedule their responses based on their progress along each of the branches of the multicast tree. This allows the protocol to overcome most of the issues of beacon-based solutions in real deployments such as collisions, low-quality links, etc. The results of our empirical tests in a real testbed as well as in simulations show that BRUMA achieves a higher packet delivery ratio and a lower overall bandwidth consumption than GMR, which is the protocol performing best among existing geographic multicast solutions.