The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2010 vol.21)
pp: 579-593
Mohamed Hefeeda , Simon Fraser University, Surrey
Hossein Ahmadi , University of Illnois at Urbana-Champaign, Urbana
ABSTRACT
Various sensor types, e.g., temperature, humidity, and acoustic, sense physical phenomena in different ways, and thus, are expected to have different sensing models. Even for the same sensor type, the sensing model may need to be changed in different environments. Designing and testing a different coverage protocol for each sensing model is indeed a costly task. To address this challenging task, we propose a new probabilistic coverage protocol (denoted by PCP) that could employ different sensing models. We show that PCP works with the common disk sensing model as well as probabilistic sensing models, with minimal changes. We analyze the complexity of PCP and prove its correctness. In addition, we conduct an extensive simulation study of large-scale sensor networks to rigorously evaluate PCP and compare it against other deterministic and probabilistic protocols in the literature. Our simulation demonstrates that PCP is robust, and it can function correctly in presence of random node failures, inaccuracies in node locations, and imperfect time synchronization of nodes. Our comparisons with other protocols indicate that PCP outperforms them in several aspects, including number of activated sensors, total energy consumed, and network lifetime.
INDEX TERMS
Sensor networks, coverage in sensor networks, probabilistic coverage, coverage protocols.
CITATION
Mohamed Hefeeda, Hossein Ahmadi, "Energy-Efficient Protocol for Deterministic and Probabilistic Coverage in Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.21, no. 5, pp. 579-593, May 2010, doi:10.1109/TPDS.2009.112
REFERENCES
[1] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless Sensor Networks: A Survey," Computer Networks, vol. 38, no. 4, pp. 393-422, Mar. 2002.
[2] G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill, "Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks," ACM Trans. Sensor Networks, vol. 1, no. 1, pp. 36-72, Aug. 2005.
[3] Z. Zhou, S. Das, and H. Gupta, "Connected K-Coverage Problem in Sensor Networks," Proc. Int'l Conf. Computer Comm. and Networks (ICCCN '04), pp. 373-378, Oct. 2004.
[4] H. Zhang and J. Hou, "Maintaining Sensing Coverage and Connectivity in Large Sensor Networks," Ad Hoc and Sensor Wireless Networks: An Int'l J., vol. 1, nos. 1/2, pp. 89-123, Jan. 2005.
[5] S. Shakkottai, R. Srikant, and N. Shroff, "Unreliable Sensor Grids: Coverage, Connectivity, and Diameter," Ad Hoc Networks, vol. 3, no. 6, pp. 702-716, Nov. 2005.
[6] S. Kumar, T.H. Lai, and J. Balogh, "On K-Coverage in a Mostly Sleeping Sensor Network," Proc. ACM MobiCom, pp. 144-158, Sept. 2004.
[7] F. Ye, G. Zhong, J. Cheng, S. Lu, and L. Zhang, "PEAS: A Robust Energy Conserving Protocol for Long-Lived Sensor Networks," Proc. Int'l Conf. Distributed Computing Systems (ICDCS '03), pp. 28-37, May 2003.
[8] D. Tian and N. Georganas, "A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks," Proc. First ACM Int'l Workshop Wireless Sensor Networks and Applications, pp. 32-41, Sept. 2002.
[9] Y. Zou and K. Chakrabarty, "Sensor Deployment and Target Localization in Distributed Sensor Networks," ACM Trans. Embedded Computing Systems, vol. 3, no. 1, pp. 61-91, Feb. 2004.
[10] 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.
[11] N. Ahmed, S. Kanhere, and S. Jha, "Probabilistic Coverage in Wireless Sensor Networks," Proc. IEEE Conf. Local Computer Networks (LCN '05), pp. 672-681, Nov. 2005.
[12] B. Liu and D. Towsley, "A Study on the Coverage of Large-Scale Sensor Networks," Proc. IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS '04), pp. 475-483, Oct. 2004.
[13] Q. Cao, T. Yan, T. Abdelzaher, and J. Stankovic, "Analysis of Target Detection Performance for Wireless Sensor Networks," Proc. Int'l Conf. Distributed Computing in Sensor Networks, pp. 276-292, June 2005.
[14] M. Cardei and J. Wu, "Energy-Efficient Coverage Problems in Wireless Ad Hoc Sensor Networks," Elsevier Computer Comm., vol. 29, no. 4, pp. 413-420, 2006.
[15] X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. Lai, "Deploying Wireless Sensors to Achieve Both Coverage and Connectivity," Proc. ACM MobiHoc, pp. 131-142, May 2006.
[16] Z. Abrams, A. Goel, and S. Plotkin, "Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks," Proc. Int'l Symp. Information Processing in Sensor Networks (IPSN '04), pp. 424-432, Apr. 2004.
[17] D. Tian and N. Georganas, "Location and Calculation-Free Node Scheduling Schemes in Large Wireless Sensor Networks," Elsevier Ad Hoc Networks, vol. 2, pp. 65-85, 2004.
[18] T. Wu and K. Ssu, "Determining Active Sensor Nodes for Complete Coverage without Location Information," Int'l J. Ad Hoc and Ubiquitous Computing, vol. 1, nos. 1/2, pp. 38-46, 2005.
[19] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, "Coverage Problems in Wireless Ad-Hoc Sensor Networks," Proc. IEEE INFOCOM, pp. 1380-1387, Apr. 2001.
[20] D. Mehta, M. Lopez, and L. Lin, "Optimal Coverage Paths in Ad-Hoc Sensor Networks," Proc. IEEE Int'l Conf. Comm. (ICC '03), May 2003.
[21] X. Li, P. Wan, and O. Frieder, "Coverage in Wireless Ad Hoc Sensor Networks," IEEE Trans. Computers, vol. 52, no. 6, pp. 753-763, June 2003.
[22] L. Lazos and R. Poovendran, "Stochastic Coverage in Heterogeneous Sensor Networks," ACM Trans. Sensor Networks, vol. 2, no. 3, pp. 325-358, Aug. 2006.
[23] C. Huang and Y. Tseng, "The Coverage Problem in a Wireless Sensor Network," ACM Mobile Networks and Applications (MONET), special issue on wireless sensor networks, vol. 10, no. 4, pp. 519-528, Aug. 2005.
[24] A. So and Y. Ye, "On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams," Proc. Workshop Internet and Network Economics (WINE '05), pp. 584-593, Dec. 2005.
[25] T. Okabe, B. Boots, K. Sugihara, and S.N. Chiu, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, second ed. John Wiley, 2000.
[26] C. Huang, Y. Tseng, and H. Wu, "Distributed Protocols for Ensuring Both Coverage and Connectivity of a Wireless Sensor Network," ACM Trans. Sensor Networks, vol. 3, no. 1, Mar. 2007.
[27] K. Chakrabarty, S. Iyengar, H. Qi, and E. Cho, "Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks," IEEE Trans. Computers, vol. 51, no. 12, pp. 1448-1453, Dec. 2002.
[28] S. Yang, F. Dai, M. Cardei, J. Wu, and F. Patterson, "On Connected Multiple Point Coverage in Wireless Sensor Networks," Int'l J. Wireless Information Networks, vol. 13, no. 4, pp. 289-301, May 2006.
[29] F. Dai and J. Wu, "An Extended Localized Algorithm for Connected Dominating Sets Formation in Ad Hoc Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 10, pp. 908-920, Oct. 2004.
[30] H. Gupta, Z. Zhou, S. Das, and Q. Gu, "Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution," IEEE/ACM Trans. Networking, vol. 14, no. 1, pp. 55-67, Feb. 2006.
[31] M. Hefeeda and M. Bagheri, "Randomized K-Coverage Algorithms for Dense Sensor Networks," Proc. IEEE INFOCOM, pp. 2376-2380, May 2007.
[32] A. Savvides, C. Han, and M. Strivastava, "Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors," Proc. ACM MobiCom, pp. 166-179, July 2001.
[33] L. Doherty, L.E. Ghaoui, and K. Pister, "Convex Position Estimation in Wireless Sensor Networks," Proc. IEEE INFOCOM, pp. 1655-1663, Apr. 2001.
[34] NS-2, http://nsnam.isi.edunsnam/, 2009.
[35] Network Systems Lab, http://nsl.cs.sfu.cawiki, 2009.
41 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool