An efficient real-time routing with presence of concave voids in wireless sensor networks

  • Authors:

  • Mohamed Aissani;Abdelhamid Mellouk;Nadjib Badache;Brahim Saidani

  • Affiliations:

  • University of Paris, Vitry-sur-Seine, France and USTHB University, Bordj-El-Bahri, Algiers, Algeria;University of Paris, Paul Armangot, Vitry-sur-Seine, France;USTHB University, EL-Alia, Algiers, Algeria;AI laboratory, Polytechnic School, Bordj-El-Bahri, Algiers, Algeria

  • Venue:
  • Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

To bypass voids in sensor networks, most existing geographic routing protocols tend to route packets along the boundary nodes. Generally, a packet will be either forwarded along a void boundary by the right-hand rule or pushed back to find another route when it encounters the void. The two techniques consume more energy of boundary nodes, drop many packets and may incur data collisions if multiple communication sessions share the same boundary nodes. We propose in this paper an alternative and efficient void avoidance scheme. The proposed on-demand scheme consists of void discovery, void announce and packet rerouting steps. After discovering a void, a sender node inside the void's announce-area reroutes all data packets to get around the void in advance by selecting one appropriate forwarding side. The double objective of our scheme is to prevent data packets from traveling along the boundaries of voids and to avoid them the concave zones of voids. By achieving this objective we can reduce the energy consumption of boundary nodes and data collisions in these nodes. We can also reduce the packets rerouting overhead and the number of packets dropped by nodes on the boundaries of voids. Simulation showed the efficiency of our scheme.