Rescheduling of Nodes Duty Cycles to Prevent Partitioning in Wireless Sensor Networks

For the perfect operation of a WSN both requirements of sensing coverage and network connectivity are needed simultaneously. The method used in this work satisfies both of those requirements. For the sensing coverage, it uses randomized scheduling algorithm, in which each sensor node randomly selects one of the k predefined working subset. At any time only sensor nodes in one subset are active and nodes in the other subsets are in the sleep mode. Then, the algorithm turns on extra sensor nodes if necessary for the network connectivity. The problem of this method is some of extra-on nodes should be active more than one additional subset and even should be stay on all the time. Also extra-on nodes that are turned on to participate in other nodes routing, sometimes are subjected to many transmissions and receptions. So, they are faced with rapid battery depletion and this problem may lead to network partitioning. In this paper, we utilize rescheduling methods to minimize the number of extra on sensor nodes. By probing mechanism algorithms that allow for some nodes to change their working schedule, number of extra on nodes is reduced up to 35%.

• Publication year

  2016

• Venue

  Bulletin de la Société royale des sciences de Liège

• Publication date

  Unknown publication date

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.25518/0037-9565.5777
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Multiobjective Optimization for Topology and Coverage Control in Wireless Sensor Networks

  2015cited by this paper
• Probing mechanism scheduling for connected coverage wireless sensor network.

  2011cited by this paper
• Optimal Patterns for Four-Connectivity and Full Coverage in Wireless Sensor Networks

  2010cited by this paper
• Connectivity and coverage maintenance in wireless sensor networks

  2010cited by this paper
• Performance of a connected random covered energy efficient wireless sensor network.

  2009cited by this paper
• Lifetime Maximization for Connected Target Coverage in Wireless Sensor Networks

  2008cited by this paper
• Maintaining Sensing Coverage and Connectivity in Large Sensor Networks

  2005cited by this paper
• Connectivity maintenance and coverage preservation in wireless sensor networks

  2004cited by this paper
• ASCENT: adaptive self-configuring sensor networks topologies

  2004cited by this paper
• Differentiated surveillance for sensor networks

  2003cited by this paper
• Composing Domain-Specific Design Environments

  2001cited by this paper
• IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, PAPER ID: TPDS-0307-0605.R1 1 Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks

  year unknowninfluential reference

• No citing papers are available for this paper.