GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
The Impact of Location Errors on Geographic Routing in Sensor Networks
ICCGI '06 Proceedings of the International Multi-Conference on Computing in the Global Information Technology
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance
IEEE Transactions on Mobile Computing
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
A Beacon-Less Geographic Multipath Routing Protocol for Ad Hoc Networks
Mobile Networks and Applications
GEographic multicast (GEM) for dense wireless networks: protocol design and performance analysis
IEEE/ACM Transactions on Networking (TON)
Mobile Networks and Applications
| Hi-index | 0.25 |
Geographic routing has emerged as one of the most efficient and scalable routing solutions for wireless sensor networks. In traditional geographic routing protocols, each node exchanges periodic one-hop beacons to determine the position of its neighbors. Recent studies proved that these beacons can create severe problems in real deployments due to the highly dynamic and error-prone nature of wireless links. To avoid these problems, new variants of geographic routing protocols that do not require beacons are being proposed. In this article we review some of the latest proposals in the field of beaconless geographic routing and introduce the main design challenges and alternatives. In addition, we perform an empirical study to assess the performance of beacon-based and beacon-less routing protocols using a real WSN deployment.