무선 센서 네트워크에서의 Max k-Cut기반의 클러스터링 알고리즘

Max k-Cut based Clustering Algorithm for Wireless Sensor Networks

  • 김재환 (서강대학교 컴퓨터공학과) ;
  • 장형수 (서강대학교 컴퓨터공학과)
  • 발행 : 2009.04.15

초록

본 논문에서는 Wireless Sensor Networks에서 Max k-Cut Problem을 기반으로 위치 정보를 사용하지 않고 클러스터 헤드를 적절히 분산하여 선출함으로써 에너지 효율적인 클러스터링을 하는 중앙처리 방식의 새로운 알고리즘 "MCCA : Max k-Cut based Clustering Algorithm for Wireless Sensor Networks"을 제안한다. MCCA는 이웃 노드와의 상대적이고 근사적인 거리 정보만을 사용하여 효율적으로 클러스터링을 하고 에너지가 적은 노드는 클러스터 헤드 선출에서 일정 기간 제외되는 방법을 사용함으로써 LEACH, EECS보다 에너지 효율이 증대됨과 GPS를 사용한 BCDCP와 에너지 효율이 비슷함을 실험을 통하여 보인다.

In this paper, we propose a novel centralized energy-efficient clustering algorithm, called "MCCA : Max k-Cut based Clustering Algorithm for Wireless Sensor Networks." The algorithm does not use location information and constructs clusters via a distributive Max k-Cut based cluster-head election method, where only relative and approximate distance information with neighbor nodes is used and nodes, not having enough energy, are excluded for cluster-heads for a specific period. We show that the energy efficiency performance of MCCA is better than that of LEACH, EECS and similar to BCDCP's by simulation studies.

키워드

참고문헌

  1. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy efficient communication protocol for wireless microsensor networks," in Proceedings of the 33rd Hawaii International Conference on System Sciences, Vol.8, pp. 3005-3014, Jan. 2000
  2. W. R. Heinzelman, A. 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
  3. S. D. Muruganathan, D. C. F. Ma, R. I. Bhasin, and A. O. Fapojuwo, "A Centralized Energy-Efficient Routing Protocol for Wireless Sensor Networks," Communications Magazine, IEEE, Vol.43, issue 3, Mar. 2005
  4. M. Ye, C. Li, G. Chen, and J. Wu, "EECS : An Energy Efficient Clustering Scheme in Eireless Sensor Networks," Performance, Computing and Communications Conference(IPCCC) 24th IEEE International, pp. 535-540, April 2005
  5. A Frieze and M. Jerrum, "Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION," in Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization, pp. 1-13, 1995
  6. J. D. Cho, S. Raje, and M. Sarrafzaden, "Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering for VLSI Applications," IEEE Transactions on Computers, Vol.47, issue 11, pp. 1253-1266, Nov. 1998 https://doi.org/10.1109/12.736440
  7. Y. J. Han, S. H. Park, J. H. Eom, and T. M. Chung, "Energy-Efficient Distance Based Clustering Routing Scheme for Wireless Sensor Net-works," Computational Science and Its Applications- ICCSA 2007, Vol. 4706, PP. 195-206, Aug. 2007 https://doi.org/10.1007/978-3-540-74477-1_20