Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Habitat monitoring: application driver for wireless communications technology
SIGCOMM LA '01 Workshop on Data communication in Latin America and the Caribbean
Research challenges in wireless networks of biomedical sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Proceedings of the 1st international conference on Embedded networked sensor systems
IEEE Communications Magazine
Localized algorithm for aggregate fairness in wireless sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
An efficient void resolution method for geographic routing in wireless sensor networks
Journal of Systems and Software
Scoped Bellman-Ford geographic routing for large dynamic wireless sensor networks
Journal of Computer Science and Technology
Virtual Convex Polygon Based Hole Boundary Detection and Time Delay Based Hole Detour Scheme in WSNs
Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009
Void Avoidance in Three-Dimensional Mobile Underwater Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
EEGFGR: an energy-efficient greedy-face geographic routing for wireless sensor networks
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
Journal of Parallel and Distributed Computing
A geographic routing hybrid approach for void resolution in wireless sensor networks
Journal of Systems and Software
Maximizing lifetime vector in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Wireless sensor networks have attracted great attention in research and industrial development due to their fast-growing application potentials. New techniques must be developed for sensor networks due to their lack of infrastructure support and the constraints on computation capability, memory space, communication bandwidth and above all, energy supply. To prolong the life time of a battery-powered sensor network, an energy efficient routing algorithm for data collection is essential. We propose a new geographic routing algorithm that forwards packets from sensors to base stations along efficient routes. The algorithm eliminates the voids that cause non-optimal routing paths in geographic routing. It replaces the right-hand rule by distance upgrading. It is fully distributed and responds to topology changes instantly with localised operations. We formally prove the correctness of the algorithm and evaluate its performance by simulations.