Browse > Article

A Scheduling Scheme Considering Multiple-Target Coverage and Connectivity in Wireless Sensor Networks  

Kim, Yong-Hwan (한국기술교육대학교 첨단기술연구소)
Han, Youn-Hee (한국기술교육대학교 첨단기술연구소)
Park, Chan-Yeol (한국과학기술정보연구원)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.35, no.3B, 2010 , pp. 453-461 More about this Journal
Abstract
A critical issue in wireless sensor networks is an energy-efficiency since the sensor batteries have limited energy power and, in most cases, are not rechargeable. The most practical manner relate to this issue is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy. Especially, CTC (Connected Target Coverage) problem has been considered as a representative energy-efficiency problem considering connectivity as well as target coverage. In this paper, we propose a new energy consumption model considering multiple-targets and create a new problem, CMTC (Connected Multiple-Target Coverage) problem, of which objective is to maximize the network lifetime based on the energy consumption model. Also, we present SPT (Shortest Path based on Targets)-Greedy algorithm to solve the problem. Our simulation results show that SPT-Greedy algorithm performs much better than previous algorithm in terms of the network lifetime.
Keywords
Wireless Sensor Network; Scheduling; Target Coverage; Connectivity; Energy efficiency;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Cardei and D.-Z. Du, "Improving wireless sensor network lifetime through power aware organization," Wireless Networks, Vol.11, No. 3, pp.333-340, 2005.   DOI   ScienceOn
2 D. Li, K. Wong, Y. Hu, and A. Sayeed. "Detection, classification, tracking of targets," IEEE Signal Processing Mag., Vol.19, No.2, pp. 17-29, 2002.   DOI   ScienceOn
3 Q. Zhao, and M. Gurusamy, "Lifetime Maximization for Connected Target Coverage in Wireless Sensor Networks," IEEE/ACM Transactions on Networking, Vol.16, No.6, 2008.
4 S.-Y. Pyun and D.-H. Cho, "Power-Saving Scheduling for Multiple-Target Coverage in Wireless Sensor Networks," IEEE Communication Letter, pp.130-132, Vol.13, No.2, 2009.   DOI
5 M. Lu, J. Wu, M. Cardei, and M. Li, "Energy-efficient connected coverage of discrete targets in wireless sensor netorks," in Int. Conf. of Computer Networks and Mobile Computing (ICCNMC), 2005.
6 P. Bizarro, S. Babu, D. J. DeWitt, J. Widom, "Content-Based Routing: Different Plans for Different Data," In Proceedings of the 31st International Conference on VLDB, pp.757-768, 2005.
7 M. Cardei and J. Wu, "Coverage problems in wireless ad hoc sensor networks," in Handbook of Sensor Networks,M. Ilyas and I. Mahgoub, Eds. Boca Raton, FL: CRC Press, ch. 19, 2004.
8 M. Cardei, M. T. Thai, Y. Li, and W.Wu, "Energy-efficient target coverage in wireless sensor networks," in Proc. IEEE INFOCOM, pp.1976-1984, 2005.
9 C. Wang, M. T. Thai, Y. Li, F. Wang and W. Wu, "Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks," In Proc. of IEEE Globecom '07, pp.1118-1123, 2007.
10 Q. Zhao and M. Gurusamy, "Maximizing network lifetime for connected target coverage problem in wsn," Tech. Rep., Electrical and Computer Engineering Dept., National University of Singapore, 2005.