GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
GPS Query Optimization in Mobile and Wireless Networks
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Impact of radio irregularity on wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
On-demand Geographic Forwarding for data delivery in wireless sensor networks
Computer Communications
Robust and timely communication over highly dynamic sensor networks
Real-Time Systems
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
Surviving sensor node failures by MMU-less incremental checkpointing
Journal of Systems and Software
Hi-index | 0.00 |
In this paper, to achieve fast and energy-efficient message delivery in multi-hop wireless sensor networks, we propose ABC, a simple geographic forwarding scheme capable of bypassing routing holes. ABC is a lightweight and reliable routing protocol in that nodes do not need to set up or maintain routing or neighbor tables; instead, ABC achieves lightweight routing via its ''Angled relaying'' mechanism and uses the ''Backoff time and relay Cancellation'' mechanism to reduce contention and the number of retransmissions. One of the main features of ABC is a message based implicit ACK mechanism where a relayed message is used as an implicit ACK to a previous sender, avoiding an explicit RTS/CTS. Another main feature of ABC is its on-demand routing hole bypassing mechanism based on reactive boundary recognition. In this paper we provide an extensive analysis of ABC in terms of average hop count and average delay per hop. Simulation results also show that ABC outperforms other protocols in terms of average delay and number of transmissions per message delivery.