A study of reconnecting the partitioned wireless sensor networks

  • Authors:
  • Qing Ye;Liang Cheng

  • Affiliations:
  • Department of Computer Science and Engineering, Laboratory of Networking Group (LONGLAB) Lehigh University, Bethlehem, PA;Department of Computer Science and Engineering, Laboratory of Networking Group (LONGLAB) Lehigh University, Bethlehem, PA

  • Venue:
  • ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most wireless sensor networks (WSN) researches assume that the network is connected and there is always a path connected by wireless links between a source and a destination. In this paper, we argue that network partitioning is not an uncommon phenomenon for practical WSN applications, especially when the sensor nodes are deployed in a hash working environment. We first present a simple distributed method to detect the occurrence of network partitions. Some critical survival nodes would be selected to re-connect to the sink after certain network disruption happens. Two reconnection approaches, Transmission Range Adjustment (TRA) and Message Ferry (MF), are then proposed. We study their performances in terms of power consumption by taking the specifications of the commercial sensor nodes into account. Simulation results show that TRA is more appropriate for the current implementation of WSN. However, MF has the potential to be more energy-efficient if there is a powerful wireless transmitter and a larger amount of buffers at each sensor node.