A novel approach for void avoidance in wireless sensor networks

  • Authors:

  • Mohamed Aissani;Abdelhamid Mellouk;Nadjib Badache;Mouloud Boumaza

  • Affiliations:

  • Image, Signal and Intelligent Systems Lab-Lissi and Network & Telecommunication Dept., (UPEC), Vitry sur Seine, France and LSI Lab., (USTHB), P.O. Box 32, EL-Alia 16111, Algiers and Lab. of Res. i ...;Image, Signal and Intelligent Systems Lab-Lissi and Network & Telecommunication Department, University of Paris-Est Creteil Val de Marne (UPEC), Vitry sur Seine, France;LSI Laboratory, University of Science and Technology (USTHB), P.O. Box 32, EL-Alia 16111, Algiers, Algeria;Laboratory of Research in Artificial Intelligence, EMP School, P.O. Box 17 EMP, Bordj-El-Bahri 16111, Algiers, Algeria

  • Venue:
  • International Journal of Communication Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a novel approach to treat the problem of void avoidance in sensor networks. In our approach, the choice of the forwarding region around a discovered void is oriented by the locations of (i) the sender node, (ii) the void center and (iii) the destination node. Three void-avoidance schemes are described which use the same void-discovery algorithm. Based on an oriented face routing, the first scheme is used by the boundary nodes to prevent packets from dropping. The second scheme is used by sender nodes located n-hops away from the void boundary to launch a preventive rerouting. The third scheme tends to protect packets from both the concave zones and the boundaries nodes of voids. Proposed schemes are simple to implement. They save network resources and could be easily associated with existing geographic routing protocols. Simulation results show the efficiency of the proposed approach. Copyright © 2009 John Wiley & Sons, Ltd. We propose a novel approach to treat the problem of void avoidance in sensor networks. In our approach, the choice of the forwarding region around a void is oriented by the locations of: the sender node, the void center and the destination node. Three void-avoidance schemes are described. They save the network resources and could be easily associated to the existing geographic routing protocols. Each proposed scheme consists of void-discovery, void-announce and packet-rerouting steps, as shown in the figure. Simulation results show the efficiency of the proposed approach. Copyright © 2009 John Wiley & Sons, Ltd.