The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2011 vol.10)
pp: 465-478
Changlei Liu , The Pennsylvania State University, University Park
Guohong Cao , The Pennsylvania State University, University Park
ABSTRACT
Mission-driven sensor networks usually have special lifetime requirements. However, the density of the sensors may not be large enough to satisfy the coverage requirement while meeting the lifetime constraint at the same time. Sometimes, coverage has to be traded for network lifetime. In this paper, we study how to schedule sensors to maximize their coverage during a specified network lifetime. Unlike sensor deployment, where the goal is to maximize the spatial coverage, our objective is to maximize the spatial-temporal coverage by scheduling sensors' activity after they have been deployed. Since the optimization problem is NP-hard, we first present a centralized heuristic whose approximation factor is proved to be {1\over 2}, and then, propose a distributed parallel optimization protocol (POP). In POP, nodes optimize their schedules on their own but converge to local optimality without conflict with one another. Theoretical and simulation results show that POP substantially outperforms other schemes in terms of network lifetime, coverage redundancy, convergence time, and event detection probability.
INDEX TERMS
Wireless sensor network, coverage, sensor scheduling, distributed protocol, parallel algorithm.
CITATION
Changlei Liu, Guohong Cao, "Spatial-Temporal Coverage Optimization in Wireless Sensor Networks", IEEE Transactions on Mobile Computing, vol.10, no. 4, pp. 465-478, April 2011, doi:10.1109/TMC.2010.172
REFERENCES
[1] H. Liu, P. Wan, C.-W. Yi, X. Jia, S. Makki, and P. Niki, "Maximal Lifetime Scheduling in Sensor Surveillance Networks," Proc. IEEE INFOCOM, Mar. 2005.
[2] M. Cardei and J. Wu, "Energy-Efficient Coverage Problems in Wireless Ad Hoc Sensor Networks," J. Computer Comm. Sensor Networks, vol. 29, pp. 413-420, 2005.
[3] D. Tian and N. Georganas, "A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks," Proc. ACM Int'l Workshop Wireless Sensor Networks and Applications, 2002.
[4] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, "Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks," Proc. ACM Conf. Embedded Networked Sensor Systems (SenSys), 2003.
[5] T. Yan, T. He, and J.A. Stankovic, "Differentiated Surveillance for Sensor Networks," Proc. ACM Conf. Embedded Networked Sensor Systems (SenSys), 2003.
[6] H. Zhang and J.C. Hou, "Maintaining Sensing Coverage and Connectivity in Large Sensor Networks," Wireless Ad Hoc and Sensor Networks, vol. 1, pp. 89-124, 2005.
[7] M.H. Alsuwaiyel, Algorithms Design Techniques and Analysis. World Scientific, 1999.
[8] S. Khuller, A. Moss, and J. Naor, "The Budgeted Maximum Coverage Problem," Information Processing Letters, vol. 70, no. 1, pp. 39-45, 1999.
[9] S. Basagni, "A Distributed Algorithm for Finding a Maximal Weighted Independent Set in Wireless Networks," Proc. 11th Int'l Conf. Parallel and Distributed Computing and Systems (PDCS), 1999.
[10] G. Xing, R. Tan, B. Liu, J. Wang, X. Jia, and C.-W. Yi, "Data Fusion Improves the Coverage of Wireless Sensor Networks," Proc. ACM MobiCom, 2009.
[11] C. Liu and G. Cao, "Minimizing the Cost of Mine Selection via Sensor Networks," Proc. IEEE INFOCOM, 2009.
[12] J. Hwang, T. He, and Y. Kim, "Exploring In-Situ Sensing Irregularity in Wireless Sensor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 21, no. 4, pp. 547-561, Apr. 2010.
[13] M. Hefeeda and H. Ahmadi, "An Integrated Protocol for Maintaining Connectivity and Coverage under Probabilistic Models for Wireless Sensor Networks," Ad Hoc and Sensor Wireless Networks, vol. 7, pp. 295-323, 2009.
[14] L. Su, C. Liu, H. Song, and G. Cao, "Routing in Intermittently Connected Sensor Networks," Proc. IEEE Int'l Conf. Network Protocols (ICNP), 2008.
[15] Y. Zou and K. Chakrabarty, "A Distributed Coverage and Connectivity Centric Technique for Selecting Active Nodes in Wireless Sensor Networks," IEEE Trans. Computers, vol. 54, no. 8, pp. 978-991, Aug. 2005.
[16] S. Kumar, T.H. Lai, and J. Balogh, "On K-Coverage in a Mostly Sleeping Sensor Network," Proc. ACM MobiCom, 2004.
[17] S. Funkey, A. Kesselman, F. Kuhn, and Z. Lotker, "Improved Approximation Algorithms for Connected Sensor Cover," Wireless Networks, vol. 13, pp. 153-164, 2007.
[18] P. Berman, G. Calinescu, C. Shah, and A. Zelikovsly, "Efficient Energy Management in Sensor Networks," Ad Hoc and Sensor Networks, 2005.
[19] G.S. Kasbekar, Y. Bejerano, and S. Sarkar, "Lifetime and Coverage Guarantees through Distributed Coordinate-Free Sensor Activation," Proc. ACM MobiCom, 2009.
[20] X. Bai, S. Kumar, D. Xuan, Z. Yun, and T.H. Lai, "Deploying Wireless Sensors to Achieve both Coverage and Connectivity," Proc. ACM MobiHoc, 2006.
[21] M. Cardei, M. Thai, Y. Li, and J. Wu, "Energy-Efficient Target Coverage in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2005.
[22] C. Liu and G. Cao, "An Multi-Poller Based Energy-Efficient Monitoring Scheme for Wireless Sensor Networks," Proc. IEEE INFOCOM, 2009.
[23] C. Liu and G. Cao, "Distributed Monitoring and Aggregation in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2010.
[24] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M.B. Srivastava, "Coverage Problems in Wireless Ad-Hoc Sensor Networks," Proc. IEEE INFOCOM, 2001.
[25] S. Kumar, T.H. Lai, and A. Arora, "Barrier Coverage with Wireless Sensors," Proc. ACM MobiCom, 2005.
[26] A. Chen, S. Kumar, and T.H. Lai, "Designing Localized Algorithms for Barrier Coverage," Proc. ACM MobiCom, 2007.
[27] B. Liu, O. Dousse, J. Wang, and A. Saipulla, "Strong Barrier Coverage of Wireless Sensor Networks," Proc. ACM MobiHoc, 2008.
[28] A. Saipulla, C. Westphal, B. Liu, and J. Wang, "Barrier Coverage of Line-Based Deployed Wireless Sensor Networks," Proc. IEEE INFOCOM, 2009.
[29] G. Lu, N. Sadagopan, B. Krishnamachari, and A. Goel, "Delay Efficient Sleep Scheduling in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2005.
[30] R. Cohen and B. Kapchits, "An Optimal Algorithm for Minimizing Energy Consumption while Limiting Maximum Delay in a Mesh Sensor Network," Proc. IEEE INFOCOM, 2007.
[31] A. Keshavarzian, H. Lee, and L. Venkatraman, "Wakeup Scheduling in Wireless Sensor Networks," Proc. ACM MobiHoc, 2006.
[32] S. Ren, Q. Li, H. Wang, X. Chen, and X. Zhang, "Design and Analysis of Sensing Scheduling Algorithms under Partial Coverage for Object Detection in Sensor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 3, pp. 334-350, Mar. 2007.
[33] C. Gui and P. Mohapatra, "Power Conservation and Quality of Surveillance in Target Tracking Sensor Networks," Proc. ACM MobiCom, 2004.
[34] W. Zhang and G. Cao, "DCTC: Dynamic Convoy Tree-Based Collaboration for Target Tracking in Sensor Networks," IEEE Trans. Wireless Comm., vol. 3, no. 5, pp. 1689-1701, Sept. 2004.
[35] W. Zhang and G. Cao, "Optimizing Tree Reconfiguration for Mobile Target Tracking in Sensor Networks," Proc. IEEE INFOCOM, 2004.
[36] Q. Cao, T. Abdelzaher, T. He, and J. Stankovic, "Towards Optimal Sleep Scheduling in Sensor Networks for Rare-Event Detection," Proc. ACM/IEEE Int'l Symp. Information Processing in Sensor Networks (IPSN), 2005.
[37] C. Joo, "A Local Greedy Scheduling Scheme with Provable Performance Guarantee," Proc. ACM MobiHoc, 2008.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool