한국통신학회논문지 (The Journal of Korean Institute of Communications and Information Sciences)

  • 제35권3B호
  • /
  • Pages.453-461
  • /
  • 2010
  • /
  • 1226-4717(pISSN)
  • /
  • 2287-3880(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

무선 센서 네트워크에서 다중 타겟 커버리지와 연결성을 고려한 스케줄링 기법

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

  • 김용환 (한국기술교육대학교 첨단기술연구소) ;
  • 한연희 (한국기술교육대학교 첨단기술연구소) ;
  • 박찬열 (한국과학기술정보연구원)
  • 투고 : 2009.10.31
  • 심사 : 2010.02.12
  • 발행 : 2010.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

무선 센서 네트워크의 센서 노드들은 한정된 자원을 가지고 있으며 배터리의 교체가 어렵다는 특성을 가지고 있기 때문에 제한된 에너지를 효율적으로 사용하는 기법은 매우 중요하다. 지금까지 이러한 센서 노드의 에너지 소모를 최소화하기 위하여 다양한 스케줄링 문제 및 해결 방안에 관한 연구들이 진행되어 왔다. 특히 CTC(Connected Target Coverage) 문제는 타겟 커버리지와 연결성을 동시에 고려하여 센서 노드들의 효율적인 상태 전이 시점을 결정하는 대표적인 스케줄링 문제로 간주된다. 본 논문에서는 중복되어 센싱되는 타겟을 고려한 보다 올바른 센서 에너지 소비 모델을 제안하고 센서 네트워크의 수명을 더욱 연장 할 수 있는 CMTC(Connected Multiple-Target Coverage) 문제를 제시한다. 또한, 이 문제를 해결하기 위한 SPT(Shortest Path based on Targets) Greedy 알고리즘을 제안하고 시뮬레이션을 통하여 제안기법이 기존기법보다 센서 네트워크의 수명을 더욱 연장하는 기법임을 보인다.

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.

키워드

참고문헌

  1. 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.
  2. 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. https://doi.org/10.1007/s11276-005-6615-6
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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. https://doi.org/10.1109/79.985674
  9. 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. https://doi.org/10.1109/LCOMM.2009.081650
  10. 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.