This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Distributed Coverage- and Connectivity-Centric Technique for Selecting Active Nodes in Wireless Sensor Networks
August 2005 (vol. 54 no. 8)
pp. 978-991
Due to their low cost and small form factors, a large number of sensor nodes can be deployed in redundant fashion in dense sensor networks. The availability of redundant nodes increases network lifetime as well as network fault tolerance. It is, however, undesirable to keep all the sensor nodes active at all times for sensing and communication. An excessive number of active nodes leads to higher energy consumption and it places more demand on the limited network bandwidth. We present an efficient technique for the selection of active sensor nodes in dense sensor networks. The active node selection procedure is aimed at providing the highest possible coverage of the sensor field, i.e., the surveillance area. It also assures network connectivity for routing and information dissemination. We first show that the coverage-centric active nodes selection problem is {\cal NP}{\hbox{-}}{\rm complete}. We then present a distributed approach based on the concept of a connected dominating set (CDS). We prove that the set of active nodes selected by our approach provides full coverage and connectivity. We also describe an optimal coverage-centric centralized approach based on integer linear programming. We present simulation results obtained using an ns2 implementation of the proposed technique.

[1] K.M. Alzoubi, P.J. Wan, and O. Frieder, “Distributed Heuristics for Connected Dominating Sets in Wireless Ad Hoc Networks,” J. Comm. and Networks, vol. 4, no. 1, pp. 1-8, 2002.
[2] V. Bharghavan and B. Das, “Routing in Ad Hoc Networks Using Minimum Connected Dominating Sets,” Proc. IEEE Int'l Conf. Comm., pp. 376-380, 1997.
[3] D. Braginsky and D. Estrin, “Rumor Routing for Sensor Networks,” Proc. ACM Intl Workshop Wireless Sensor Networks and Applications, pp. 22-31, 2002.
[4] R.R. Brooks and S.S. Iyengar, Multi-Sensor Fusion: Fundamentals and Applications with Software. Prentice Hall, 1997.
[5] R.R. Brooks, C. Griffin, and D. Friedlander, “Distributed Target Classification and Tracking in Sensor Networks,” Proc. IEEE, pp. 1163-1171, 2003.
[6] K. Chakrabarty, S.S. Iyengar, H. Qi, and E. Cho, “Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks,” IEEE Trans. Computers, vol. 51, pp. 1448-1453, 2002.
[7] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Proc. MobiCom, pp. 85-96, 2001.
[8] J.C. Chen, K. Yao, and R.E. Hudson, “Source Localization and Beamforming,” IEEE Signal Processing Magazine, vol. 19, pp. 30-39, 2002.
[9] B.N. Clark, C.J. Colbourn, and D.S. Johnson, “Unit Disk Graphs,” Discrete Math., vol. 86, pp. 165-177, 1990.
[10] T. Clouqueur, V. Phipatanasuphorn, P. Ramanathan, and K.K. Saluja, “Sensor Deployment Strategy for Target Detection,” Proc. ACM Workshop Wireless Sensor Networks and Applications, pp. 42-48, 2002.
[11] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” Proc. MobiCom, pp. 263-270, 1999.
[12] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of ${\cal NP}$ -Completeness. W.H. Freeman, 1979.
[13] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating Sets,” Algorithmica, vol. 20, no. 4, pp. 374-387, 1998.
[14] H. Gupta, S.R. Das, and Q.Y. Gu, “Connected Sensor Cover: Self-Organziation of Sensor Networks for Efficient Query Execution,” Proc. MobiHoc, pp. 189-200, 2003.
[15] W.R. Heizelman, A. Chandrakasan, and H. Balakrishnan, “Energy Efficient Communication Protocol for Wireless Micro Sensor Networks,” Proc. IEEE Int'l Conf. System Sciences, pp. 1-10, 2000.
[16] A. Howard, M.J. Mataric, and G.S. Sukhatme, “Mobile Sensor Networks Deployment Using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem,” Proc. Int'l Symp. Distributed Autonomous Robotic Systems, 2002.
[17] C. Intanagonwiwat, D. Estrin, and R. Govindan, “Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks,” Proc. MobiCom, pp. 56-67, 2000.
[18] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Adhoc Wireless Networks,” Mobile Computing, T. Imielinski and H. Korth, eds., Kluwer Academic, 1996.
[19] B. Krishnamachari and S.S. Iyengar, “Distributed Bayesian Algorithms for Fault-Tolerant Event Region Detection in Wireless Sensor Networks,” IEEE Trans. Computers, vol. 53, no. 3, pp. 241-250, Mar. 2004.
[20] S. Lindsey and C.S. Raghavendra, “PEGASIS: Power-Efficient Gathering in Sensor Information Systems,” Proc. IEEE Aerospace Conf., vol. 3, pp. 1125-1130, 2002.
[21] J. Liu, J. Reich, and F. Zhao, “Collaborative In-Network Processing for Target Tracking,” EURASIP, J. Applied Signal Processing, vol. 23, no. 4, pp. 378-391, 2003.
[22] S. Meguerdichian, F. Koushanfar, G. Qu, and M. Potkonjak, “Exposure in Wireless Ad-Hoc Sensor Networks,” Proc. MobiCom, pp. 139-150, 2001.
[23] C.S. Raghavendra and S. Singh, “PAMAS: Power-Aware Multi-Access Protocol with Signaling for Ad Hoc Networks,” ACM Comm. Rev., pp. 5-26, 1998.
[24] G.J. Pottie and W.J. Kaiser, “Wireless Integrated Network Sensors,” Comm. ACM, vol. 43, no. 5, pp. 51-58, 2000.
[25] C. Schurgers, V. Tsiatsis, and M.B. Srivastava, “STEM: Topology Management for Energy-Efficient Sensor Networks,” Proc. IEEE Aero Conf., pp. 135-145, 2002.
[26] R. Sivakumar, B. Das, and V. Bharghavan, “Spine-Based Routing in Ad Hoc Networks,” ACM/Baltzer Cluster Computing J., vol. 1, pp. 237-248, 1998.
[27] I. Stojmenovic, M. Seddigh, and J. Zunic, “Dominating Sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks,” Proc. IEEE Int'l Conf. System Sciences, vol. 13, no. 1, pp. 14-15, 2002.
[28] D. Tian and N.D. Georganas, “A Node Scheduling Scheme for Energy Conservation in Large Wireless Sensor Networks,” Wireless Comm. and Mobile Computing, vol. 3, pp. 271-290, 2003.
[29] Q. Wang, W.P. Chen, R. Zheng, K. Lee, and L. Sha, “Acoustic Target Tracking Using Tiny Wireless Sensor Devices,” Proc. Information Processing in Sensor Networks, pp. 642-657, 2003.
[30] G. Wang, G. Cao, and T. La Porta, “Movement-Assisted Sensor Deployment,” Proc. InfoCom, 2004.
[31] X.R. Wang, G.L. Xing, Y.F. Zhang, C.Y. Lu, R. Pless, and C. Gill, “Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks,” Proc. ACM SenSys, pp. 28-39, 2003.
[32] J. Wu, “Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 9, pp. 866-881, Sept. 2002.
[33] Y. Xu, J. Heidemann, and D. Estrin, “Geography-Informed Energy Conservation for Ad Hoc Routing,” Proc. MobiCom, pp. 70-84, 2001.
[34] F. Zhao, J. Liu, J. Liu, L. Guibas, and J. Reich, “Collaborative Signal and Information Processing: An Information Directed Approach,” Proc. IEEE, pp. 1199-1209, 2003.
[35] Y. Zou and K. Chakrabarty, “Sensor Deployment and Target Localization in Distributed Sensor Networks,” ACM Trans. Embedded Computing Systems, vol. 3, pp. 61-91, 2004.
[36] Y. Zou and K. Chakrabarty, “Uncertainty-Aware and Coverage-Oriented Deployment for Sensor Networks,” J. Parallel and Distributed Computing, vol. 64, pp. 788-798, 2004.
[37] AMPL/CPLEX student version, ILOG, Inc., http://www.ilog com//setminusampl or http://www.ampl.com/DOWN LOADSdetails.html#CPLEX , May 2005.

Index Terms:
Index Terms- Coverage and connectivity, distributed system, energy efficiency, wireless sensor networks.
Citation:
Yi Zou, Krishnendu Chakrabarty, "A Distributed Coverage- and Connectivity-Centric Technique for Selecting Active Nodes in Wireless Sensor Networks," IEEE Transactions on Computers, vol. 54, no. 8, pp. 978-991, Aug. 2005, doi:10.1109/TC.2005.123
Usage of this product signifies your acceptance of the Terms of Use.