DOI QR코드

DOI QR Code

클러스터 기반 라우팅 프로토콜의 에너지 효율성에 관한 연구

A Study on Energy Efficiency for Cluster-based Routing Protocol

  • 이원석 (동양미래대학교 전기전자통신공학부) ;
  • 안태원 (동양미래대학교 전기전자통신공학부) ;
  • 송창영 (동양미래대학교 전기전자통신공학부)
  • Lee, Won-Seok (School of Electrical Engineering, DongYang Mirae University) ;
  • Ahn, Tae-Won (School of Electrical Engineering, DongYang Mirae University) ;
  • Song, ChangYoung (School of Electrical Engineering, DongYang Mirae University)
  • 투고 : 2016.01.29
  • 심사 : 2016.03.03
  • 발행 : 2016.03.25

초록

클러스터 기반 라우팅 프로토콜로 대표적인 LEACH는 에너지 부하의 공평한 분배를 위해 매 라운드 미리 정해진 확률에 따라 랜덤하게 클러스터 헤드를 선출한다. 하지만 센서 노드가 갖는 현재 에너지 레벨은 고려대상이 아니기에 만일 잔존 에너지가 적은 센서 노드가 클러스터 헤드로 선출된다면 에너지 부하가 큰 헤드의 역할을 완수하지 못하고 사망할 수 있을 것이다. 결국 노드의 첫 사망시간이 매우 빨라져 WSN의 서비스 품질도 나빠질 것이다. 이러한 점에 착안하여 본 논문에서는 클러스터 헤드의 에너지 레벨과 기지국까지의 통신거리를 고려하여 클러스터 내부에 서브 클러스터 헤드를 선택하는 방법을 제안한다. 기존 LEACH에 제안하는 방법을 적용 시 클러스터 헤드의 에너지 부담이 줄어들어 노드의 첫 번째 사망시간이 증가하였고 더욱 증가된 데이터가 기지국에 도착하였으며 이로 인한 WSN의 서비스 품질도 개선되었음을 확인할 수 있었다.

To establish the equitable distribution of total energy load, a representative cluster based routing protocol LEACH selects cluster heads randomly in accordance with the pre-determined probability every round. But because the current energy level of sensor nodes is not considered, if a sensor node which has little residual energy is elected as a cluster head, it can not live to fulfil the role of cluster head which has big energy load. As a result, the first time of death of a node is quickened and the service quality of WSN gets worse. In this regard we propose a new routing method that, by considering the current energy of a cluster head and the distance between cluster heads and a base station, selects the sub cluster head for saving the energy of a cluster head. Simulation results show that the first time of death of a node prolongs, more data arrive at the base station and the service quality of WSN improves.

키워드

참고문헌

  1. H. Dhawan and S. Waraich, "A Comparative Study on LEACH Routing Protocol and its Variants in WSNs: A Survey," International Journal of Computer Applications, Vol. 95, No. 8, pp. 21-27, June 2014. https://doi.org/10.5120/16614-6454
  2. C. Singh and M. R. Aloney, "Comparative Study of LEACH Routing Protocol for WSN," International Journal of Advance Research in Computer Science and Management Studies, Vol. 3, Issue 3, pp. 322-327, March. 2015.
  3. A. Gupta and A. Nayyar, "A Comprehensive Review of Cluster-Based Energy Efficient Routing Protocols in WSNs," International Journal of Research in Computer and Communication Technology, Vol 3, Issue 1, pp. 104-110, Jan. 2014.
  4. W. B. Heinzelman, A. P. Chandrakasan and H. Balakrishnan, "An Application-Specific Protocol Architecture for Wireless Microsensor Networks," IEEE Transactions on Wireless Communications, Vol. 1, No. 4, pp. 660-670, Oct. 2002. https://doi.org/10.1109/TWC.2002.804190
  5. P. Saxena, P. Patra and N. Kumar, "Energy Aware Approach in Leach Protocol for Balancing the Cluster Head in Setup Phase: An Application to Wireless Sensor Network," Journal of Information Assurance and Security, Vol. 10, Issue 1, pp. 40-47, Jan. 2015.
  6. C. Y. Song, S. I. Kim, Y. J. Won and Y. J. Chung, "An Energy Efficient Routing Scheme for Cluster-based WSNs," Journal of The Institute of Electronics Engineers of Korea, Vol. 47-IE, No. 3, pp. 41-46, Sep. 2010.
  7. M. Shanthi and E. RamaDevi, "A Cluster Based Routing Protocol in Wireless Sensor Network for Energy Consumption," International Journal of Advanced Networking and Applications, Vol. 5, Issue 4, pp. 2015-2020, Mar. 2014.
  8. W. S. Lee, T. W. Ahn and C. Y. Song, "A Study on Improvement of Energy Efficiency for LEACH Protocol in WSN," Journal of The Institute of Electronics and Information Engineers, Vol. 52, No. 3, pp. 213-220, Mar. 2015. https://doi.org/10.5573/ieie.2015.52.3.213
  9. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "uAMPS ns Code Extensions," LEACH Algorithm Code, http://wwwmtl.mit.edu/researchgroups/icsystems/uamps/research/leach/leach_code.shtml
  10. UCB/LBNL/VINT. "Network Simulator-ns," http://www.mash.cs.berkeley.edu/ns