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

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

Energy Efficient Clustering Scheme for Mobile Wireless Sensor Network

이동 무선 센서 네트워크에서의 에너지 효율적인 클러스터링 기법

  • 이은희 (인하대학교 정보통신공학과) ;
  • 김현덕 (인하대학교 정보통신공학과) ;
  • 최원익 (인하대학교 정보통신공학과) ;
  • 채진석 (인천대학교 컴퓨터공학과)
  • Received : 2010.12.13
  • Accepted : 2011.04.06
  • Published : 2011.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we introduce an EMSP(Efficient Mobility Support Protocol) for mobile sensor network with mobility-aware. We propose virtual cluster and node split scheme considering movements of mobile nodes. The existing M-LEACH protocol suffers from communication cost spent on JOIN request information during invitation phase. To address this issue, the large boundary of the cluster in LUR-tree can reduce superfluous update cost. In addition to the expansion of the cluster, the proposed approach exploits node split algorithms used in R-tree in order to uniformly form a cluster. The simulated results show that energy-consumption has less up to about 40% than LEACH-C and 8% than M-LEACH protocol. Finally, we show that the proposed scheme outperforms those of other in terms of lifetime of sensor fields and scalability in wireless sensor network.

본 논문은 무선 센서 네트워크에서 이동 노드들의 위치 업데이트로 인한 에너지 소비를 최소화하는 EMSP(Efficient Mobility Support Protocol)을 제안한다. 제안하는 방법은 이동 노드들의 움직임을 고려한 virtual cluster와 클러스터의 균일한 노드 분포를 위한 node split 기법이다. 기존의 제안된 프로토콜은 Invitation phase 동안 이동 노드의 새로운 CH 선택으로 인하여 업데이트 통신비용에 발생한다. 이를 해결하기 위하여 R-tree의 일종인 LUR-tree에서 사용되는 Expanded MBR을 적용하여 업데이트시 발생되는 불필요한 에너지 소비를 감소시킨다. 또한, 제안하는 기법은 기존의 클러스터 노드 밀도 불균형 문제를 해결하기 위해 R-tree에서 사용되는 split algorithm을 적용하였다. 성능 평가 결과, 기존의 제안된 LEACH-C protocol에 비하여 약 40%, M-LEACH protocol에 비하여 에너지 소비가 약 8% 감소하였다. 이는 제안된 기법이 무선 센서 네트워크에서 센서의 수명 연장과 네트워크 확장에 용이하다는 것을 보여준다.

Keywords

References

  1. C. Intangonwiwat, R. Govindin, D. Estrin, JHeidemann, and F. Silva "Directed Diffusion for Wireless Sensor Networking," IEEE/ACM Transaction on Networking, Vol.11, No.1, pp.2-16, Feb 2003. https://doi.org/10.1109/TNET.2002.808417
  2. J. Kilik, W. Rabiner, and H. Balakrichnan "Adadative Protocols for Information Dissemination in Wireless Sensor Networks," Proc. ACM Mobicom '99, pp.174-185,1999.
  3. Heinzelman W, Chandrakasan A, and Balakrishnan H, "Energy-efficient communication protocol for wireless microsensor networks," Proceedings of the 33rd International Conference on System Science (HICSS '00), 2000.
  4. W. Heinzelman, "An Application-Specific Protocol Architecture for Wireless Micro sensor Networks," IEEE ToWC, Vol.1, No.4, 2002.
  5. S. Lindsey and C. Raghavendra, "PEGASIS : Power-Efficient Gathering in Sensor Information System," IEEE Aerospace Conf. Proc, Vol.3, pp.1125-1130, 2002.
  6. A. Manjeschwar and D. P. Agrawal "TEEN : A Routing Protocol for Enhanced Efficiency in Wireless Sensor Network," 1st International Workshop on Parallel and Distributed Computing Issue in Wireless Networks Mobile Computing, April, 2001.
  7. Jamil Ibriq and Imad Mahgoub "Cluster-Based Routing in wireless Sensor Networks : Issue and Challenges," SPECTS '04, 2004.
  8. Kemal Akkaya and Mohamed Younis "A Survey on Routing Protocols for Wireless Sensor Networks," IEEE Communications Magazine, August 2002.
  9. 김현덕, 최원익, "체인기반 프로토콜에서 노드의 거리에 따른 예비 헤드노드 선출 방법," Journal of Korea Multimedia Society, pp.1273-1287, 2009.
  10. Ian F.Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, and Erdal Cayirci "A Survey on Sensor Networks," IEEE Communications Magazine, August, 2002.
  11. Lan Tien Nguyen, Xavier Defago, Razvan Beuran, and Yoichi Sinoda, " An Energy Efficient Routing Scheme for Mobile Wireless Sensor Networks," IEEE ISWCS, pp.568-572, 2008.
  12. Do-Seong Kim and Ueong-Jee Chung, "Self- Organization Routing Protocol Supporting Mobile Nodes for Wireless Sensor Networks," IMSCCS, 2006.
  13. G. Santhosh Kumar, Vinu Paul M V, and K.Poulose Jacob, "Mobility Metric based LEACH-Mobile Protocol," ADCOM, pp.248- 253, 2008.
  14. Dongseop Kwon, Sangjun Lee, and Sukho Lee, "Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree," Proc. of MDM, 2002.
  15. Antonin Guttman "R-Tree: A Dynamic Index Structure for Spatial Searching," Prco. of SIGMOD, 1984.
  16. Y. Kiri, M. Sugano, and M. Murata,"On characteristics of multi-hop communication in largescale clustered sensor networks", IEICE Transactions on Communications E90-B, 2007.
  17. P. Agarwal and C. Procopiuc, "Exact and approximation algorithms for clustering," in Proc. 9th Annual. ACM-SIAM Symp. Discrete Algorithms, Baltimore, MD, pp.658-667, 1999.
  18. T. Camp, J.Beleng, and V.Davies, "A survey of mobility models for ad hoc network research," Wireless Communications & Mobile Computing (WCMC):Special issue on Mobile Ad Hoc Networking: Research, Trends and Application, Vol.2, No.5 pp.483-502, 2002.