This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks
June 2006 (vol. 17 no. 6)
pp. 562-575
Chong Liu, IEEE
Kui Wu, IEEE
Yang Xiao, IEEE
Bo Sun, IEEE

Abstract—Sensor scheduling plays a critical role for energy efficiency of wireless sensor networks. Traditional methods for sensor scheduling use either sensing coverage or network connectivity, but rarely both. In this paper, we deal with a challenging task: Without accurate location information, how do we schedule sensor nodes to save energy and meet both constraints of sensing coverage and network connectivity? Our approach utilizes an integrated method that provides statistical sensing coverage and guaranteed network connectivity. We use random scheduling for sensing coverage and then turn on extra sensor nodes, if necessary, for network connectivity. Our method is totally distributed, is able to dynamically adjust sensing coverage with guaranteed network connectivity, and is resilient to time asynchrony. We present analytical results to disclose the relationship among node density, scheduling parameters, coverage quality, detection probability, and detection delay. Analytical and simulation results demonstrate the effectiveness of our joint scheduling method.

[1] Z. Abrams, A. Goel, and S. Plotkin, “Set k-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks,” Proc. Third Int'l Symp. Information Processing in Sensor Networks (IPSN 2004), Apr. 2004.
[2] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, no. 8, pp. 102-114, Aug. 2002.
[3] A. Cerpa and D. Estrin, “Ascent: Adaptive Self-Configuring Sensor Networks Topologies,” Proc. IEEE INFOCOM 2002, June 2002.
[4] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking (Mobicom 2001), pp. 85-96, July 2001.
[5] E. Elson and K. Romer, “Wireless Sensor Networks: A New Regime for Time Synchronization,” Proc. First Workshop Hot Topics in Networks, Oct. 2002.
[6] P. Godfrey and D. Ratajczak, “Robust Topology Management in Wireless Ad Hoc Networks,” Proc. Third Int'l Symp. Information Processing in Sensor Networks (IPSN 2004), Apr. 2004.
[7] H. Gupta, S. Das, and Q. Gu, “Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution,” Proc. ACM MobiHoc 2003, June 2003.
[8] P. Gupta and P. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, 1998.
[9] C. Hsin and M. Liu, “Network Coverage Using Low Duty-Cycled Sensors: Random & Coordinated Sleep Algorithm,” Proc. Third Int'l Symp. Information Processing in Sensor Networks (IPSN 2004), Apr. 2004.
[10] C. Liu, “Randomized Scheduling Algorithm for Wireless Sensor Neworks,” Project Report of Randomized Algorithm, Univ. of Victoria, Mar. 2004.
[11] C. Liu, K. Wu, and V. King, “Randomized Coverage-Preserving Scheduling Schemes for Wireless Sensor Networks,” Proc. IFIP Networking Conf. 2005, May 2005.
[12] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, “Coverage Problems in Wireless Ad-Hoc Sensor Neworks,” Proc. IEEE Infocom 2001, Apr. 2001.
[13] C. Schurgers, V. Tsiatsis, S. Ganeriwal, and M. Strivastava, “Topology Management for Sensor Networks: Exploiting Latency and Density,” Proc. ACM MobiHoc 2002, June 2002.
[14] S. Shakkottai, R. Srikant, and N. Shroff, “Unreliable Sensor Grids: Coverage, Connectivity and Diameter,” Proc. IEEE INFOCOM 2003, Apr. 2003.
[15] S. Slijepcevic and M. Potkonjak, “Power Efficient Organization of Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Comm. 2001, June 2001.
[16] D. Tian and D. Georganas, “A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks,” Proc. ACM Workshop Wireless Sensor Networks and Applications, Oct. 2002.
[17] D. Tian and D. Georganas, “Connectivity Maintenance and Coverage Preservation in Wireless Sensor Networks,” Ad Hoc Networks J., pp. 744-761, 2005.
[18] S. Tilak, N. Abu-Ghazaleh, and H. W, “Infrastructure Tradeoffs for Sensor Networks,” Proc. First Int'l Workshop Wireless Sensor Networks and Applications (WSNA '02), Sept. 2002.
[19] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks,” Proc. ACM Sensys, 2003, Nov. 2003.
[20] B. Warneke, M. Last, B. Leibowitz, and K. Pister, “Smart Cust: Communicating with a Cubic-Millimeter Computer,” Ad Hoc Networks J., vol. 34, no. 1, pp. 44-51, Jan. 2001.
[21] K. Wu, Y. Gao, F. Li, and Y. Xiao, “Lightweight Deployment-Aware Scheduling for Wireless Sensor Networks,” ACM/Springer Mobile Networks and Applications (MONET), special issue on energy constraints and lifetime performance in wireless sensor networks, vol. 10, no. 6, pp. 837-852, Dec. 2005.
[22] Y. Xu, S. Bien, Y. Mori, J. Heidemann, and D. Estrin, “Topology Control Protocols to Conserve Energy in Wireless Ad Hoc Networks,” CENS Technical Report 0006, Jan. 2003.
[23] F. Xue and P. Kumar, “The Number of Neighbors Needed for Connectivity of Wireless Networks,” Wireless Networks, vol. 10, no. 2, pp. 169-181, 2004.
[24] T. Yan, T. He, and J. Stankovic, “Differentiated Surveillance for Sensor Networks,” Proc. First Int'l Conf. Embedded Networked Sensor Systems, Nov. 2003.
[25] F. Ye, G. Zhong, J. Cheng, S. Lu, and L. Zhang, “Peas: A Robust Energy Conserving Protocol for Long-Lived Sensor Networks,” Proc. 10th IEEE Int'l Conf. Network Protocols, Nov. 2002.
[26] H. Zhang and J. Hou, “Maintaining Coverage and Connectivity in Large Sensor Networks,” Proc. Int'l Workshop Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless and Peer-to-Peer Networks, invited paper, Feb. 2004.

Index Terms:
Wireless sensor networks, scheduling algorithms, performance analysis.
Citation:
Chong Liu, Kui Wu, Yang Xiao, Bo Sun, "Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 6, pp. 562-575, June 2006, doi:10.1109/TPDS.2006.77
Usage of this product signifies your acceptance of the Terms of Use.