Repellent voids for improving geographical routing efficiency in wireless sensor networks

Authors:
Mohamed Aissani;S. Bouznad;S. E. Allia;A. Hariza
Affiliations:
Computer Science Unit, Ecole Militaire Polytechnique EMP, P.O. Box 17, Bordj-El-Bahri, 16111, Algiers, Algeria;Computer Science Unit, Ecole Militaire Polytechnique EMP, P.O. Box 17, Bordj-El-Bahri, 16111, Algiers, Algeria;Computer Science Unit, Ecole Militaire Polytechnique EMP, P.O. Box 17, Bordj-El-Bahri, 16111, Algiers, Algeria;Computer Science Unit, Ecole Militaire Polytechnique EMP, P.O. Box 17, Bordj-El-Bahri, 16111, Algiers, Algeria
Venue:
International Journal of Communication Networks and Distributed Systems
Year:
2013

Citing 18
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A Self-organizing Technique for Sensor Placement in Wireless Micro-Sensor Networks

AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
A Spatiotemporal Communication Protocol for Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Path Vector Face Routing: Geographic Routing with Local Face Information

ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
MMSPEED: Multipath Multi-SPEED Protocol for QoS Guarantee of Reliability and Timeliness in Wireless Sensor Networks

IEEE Transactions on Mobile Computing
Locating and bypassing holes in sensor networks

Mobile Networks and Applications
A Real-time Routing Protocol with Constrained Equivalent Delay in Sensor Networks

ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Modeling and analyzing the correctness of geographic face routing under realistic conditions

Ad Hoc Networks
Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms

Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
An algorithmic approach to geographic routing in ad hoc and sensor networks

IEEE/ACM Transactions on Networking (TON)
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
Performance analysis of probabilistic multi-path geographic routing in wireless sensor networks

International Journal of Communication Networks and Distributed Systems
On the lifetime of wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
An Enhanced Self-deployment Algorithm in Mobile Sensor Network

FITME '08 Proceedings of the 2008 International Seminar on Future Information Technology and Management Engineering
Energy-Efficient SPEED Routing Protocol for Wireless Sensor Networks

AICT '09 Proceedings of the 2009 Fifth Advanced International Conference on Telecommunications
A sensor deployment algorithm for mobile wireless sensor networks

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Multipath geographic routing using false destinations

International Journal of Communication Networks and Distributed Systems
Reliable congestion-aware information transport in wireless sensor networks

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The geographical routing suffers from communication voids in wireless sensor networks WSNs. Thus, several void-handling techniques are proposed in the literature, but they are limited in case of critical applications. In this paper, we propose an efficient approach handling both open and closed voids by using three complementary mechanisms. The first mechanism orients each packet that arrives on the network boundary toward the network middle by using the shortest path leading to the sink. The second mechanism is used by a node located on the boundary of a closed void to orient the received packets in optimal paths toward the sink. The third mechanism uses repellent forces generated by each closed void to repulse the packets from its boundary. To discharge the boundary nodes, our approach defines an announcement zone around each closed void and uses a two-hop forwarding mode in each boundary node. Our proposals achieved good performance.