GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
WEAR: a balanced, fault-tolerant, energy-aware routing protocol in WSNs
International Journal of Sensor Networks
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Connectivity-based localization of large-scale sensor networks with complex shape
ACM Transactions on Sensor Networks (TOSN)
Efficient approximation of routing holes in wireless sensor networks
Proceedings of the Second Symposium on Information and Communication Technology
The capacity of wireless networks
IEEE Transactions on Information Theory
Hi-index | 0.00 |
A critical issue in designing efficient routing algorithms for wireless sensor networks (WSN) is dealing with holes which do occur due to several reasons, including cases caused by natural obstacles or disaster suffered areas. Traditional solutions utilize perimeter routing techniques that however lead to traffic concentration on the nodes on the hole boundary, which can make these nodes getting energy exhausted and the hole enlarging, consequently. Several recent proposals attempt to fix this by deploying a special, forbidding area around the hole, which helps to improve path length but still causes significant load unbalancing due to the fixed shape of this forbidding area. We introduce a novel approach in dealing with routing holes where the packet forwarder node notices early enough about the occurrence of a hole in the direction to the destination and hence, can "bend" the path around this hole efficiently. This can be done by deploying a hole aware area around the hole where each node maintains an angle of its view to this hole. We achieve this hole awareness mechanism by using an economical learn-and-disseminate strategy where the nodes on a hole's boundary learn and create a core shape of the hole and then economically disseminate this information piece to the surrounding neighborhood of a controlled size wherein each node then compute and store its hole-view angle. To the best of our knowledge, our proposed routing scheme is the first one that targets and achieves both the two requirements of energy efficiency and load balancing in dealing with the occurrence of holes. Our simulation experiments show that our scheme strongly outperforms several important existing schemes in several performance factors, including route length, efficient use of energy and load balancing.