Distributed algorithms for sleep scheduling in wireless sensor networks

It has been found that the sensor nodes dissipate a significant proportion of their energy in redundant sensing and idle listening. The former occurs when multiple sensor nodes perform their sensing activity in the same region. The latter occurs when sensor nodes have their radios switched on awaiting incoming communication from other sensor nodes, but none is received since no sensor node is wanting to communicate with it. Researchers have proposed putting the sensors and/or the radios of sensor nodes to sleep (switch them off) so as to conserve energy. The task of scheduling when the sensors and/or radios need to be in sleep/active mode is referred to as sleep scheduling. Sensor sleeping may result in interesting events being missed by the network or may lead to a lower quality of data being sensed. Radio sleeping may lead to communication delays in the network. In this work we propose several distributed algorithms to perform sensor and radio sleep scheduling in wireless sensor networks while trying to minimize its negative impact

[1]  相場亮.  Distributed Constraint Satisfaction： Foundations of Cooperation in Multi - Agent Systems , 2001 .

[2]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[3]  Deborah Estrin,et al.  Medium access control with coordinated adaptive sleeping for wireless sensor networks , 2004, IEEE/ACM Transactions on Networking.

[4]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[5]  Marko Fabiunke,et al.  Parallel Distributed Constraint Satisfaction , 1999, PDPTA.

[6]  相場 亮,et al.  Distributed Constraint Satisfaction : Foundations of Cooperation in Multi-Agent Systems, Mokoto Yokoo (著), Springer-Verlag, ISBN3540675965 , 2001 .

[7]  Weixiong Zhang,et al.  An analysis and application of distributed constraint satisfaction and optimization algorithms in sensor networks , 2003, AAMAS '03.

[8]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[9]  Jiming Liu,et al.  Agent-based, energy efficient routing in sensor networks , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[10]  Makoto Yokoo,et al.  Distributed Constraint Satisfaction , 2000, Springer Series on Agent Technology.

[11]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[13]  Manoj Kumar Tiwari,et al.  Solving Part-Type Selection and Operation Allocation Problems in an FMS: An Approach Using Constraints-Based Fast Simulated Annealing Algorithm , 2006, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[14]  Bhaskar Krishnamachari,et al.  Delay efficient sleep scheduling in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Stephen B. Wicker,et al.  Phase transitions, structure, and complexity in wireless networks , 2002 .

[16]  Stephen Fitzpatrick,et al.  An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs , 2001, SAGA.

[17]  Stuart A. Kauffman,et al.  ORIGINS OF ORDER , 2019, Origins of Order.

[18]  Athanassios Siapas,et al.  Criticality and Parallelism in Combinatorial Optimization , 1996, Science.