A three-tiered node scheduling scheme for sparse sensing in wireless sensor networks

In wireless sensor networks, when the sensing range is significantly higher than the transmission range, a very large amount of sensing redundancy is created. Sparse sensing indicates the case of selecting a small number of representative nodes to cover the sensor field while other nodes relay their data. In this paper we propose a location-free, three-tiered node scheduling protocol to address the sparse sensing problem. These layers are coverage, connectivity and coverage management layers. Coverage tier is responsible for covering the sensor field. Connectivity tier relays the collected data at the coverage tier back to the base station. The coverage management tier is responsible for implementing different coverage patterns.

[1]  Wenye Wang,et al.  TTS: a two-tiered scheduling mechanism for energy conservation in wireless sensor networks , 2006, Int. J. Sens. Networks.

[2]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[3]  Nitin H. Vaidya,et al.  A MAC protocol to reduce sensor network energy consumption using a wakeup radio , 2005, IEEE Transactions on Mobile Computing.

[4]  Erik D. Demaine,et al.  Anchor-Free Distributed Localization in Sensor Networks , 2003 .

[5]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[6]  Wenye Wang,et al.  TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[7]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[8]  Winnie Louis Lee.  Flexible-Schedule-Based TDMA Protocols for Supporting Fault-Tolerance, On-Demand TDMA Slot Transfer, and Peer-to-Peer Communication in Wireless Sensor Networks , 2008 .

[9]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[10]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[11]  Rachel Cardell-Oliver,et al.  FlexiTP: A Flexible-Schedule-Based TDMA Protocol for Fault-Tolerant and Energy-Efficient Wireless Sensor Networks , 2008, IEEE Transactions on Parallel and Distributed Systems.

[12]  Abbas Jamalipour,et al.  Wireless communications , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[13]  Amitava Datta,et al.  An energy-efficient node-scheduling scheme for wireless sensor networks based on minimum dominating sets , 2009, Int. J. Netw. Manag..

[14]  Gianluigi Ferrari,et al.  Optimal Transmit Power in Wireless Sensor Networks , 2006, IEEE Transactions on Mobile Computing.

[15]  Kuo-Feng Ssu,et al.  Determining active sensor nodes for complete coverage without location information , 2005, Int. J. Ad Hoc Ubiquitous Comput..

[16]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[17]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[18]  Ossama Younis,et al.  Coverage Without Location Information , 2007, 2007 IEEE International Conference on Network Protocols.

[19]  Li-Hsing Yen,et al.  Expected k-coverage in wireless sensor networks , 2006, Ad Hoc Networks.

[20]  Songwu Lu,et al.  A randomized energy-conservation protocol for resilient sensor networks* , 2006, Wirel. Networks.

[21]  Krishna M. Sivalingam,et al.  Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications , 2003 .