Ad Hoc 네트워크에서 잔여전력량을 이용한 효율적인 클러스터 헤더 선출 기법 = An Efficient Scheme for Electing Cluster Header Using Remaining Electric Energy in Ad Hoc Networks

다국어 초록 (Multilingual Abstract)

In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header.

참고문헌 (Reference)

1 허태성, "무선 Ad Hoc 네트워크에서 보조헤더를 이용한 효율적 클러스터-기반 라우팅 프로토콜" 인하대학교 대학원 2002

2 김혁수, "모바일 애드 혹 네트워크에서 이동성을 고려한 안정적인 클러스터링 기법" 한국통신학회 34 (34): 480-488, 2009

3 김진수, "계층적 불균형 클러스터링 기법을 이용한 에너지 소비 모델" 한국산학기술학회 12 (12): 2815-2822, 2011

4 Zygmunt J. Haas, "The Zone Routing Protocol(ZRP) for Ad Hoc Networks"

5 V. Park, "Temporally-Ordered Routing Algorithm(TORA) Version 1"

6 Charles E. Perkins, "Highly dynamic destination-sequenced distance-vector routing(DSDV) for mobile computers" 1994

7 Johnson D, "Dynamic source routing in ad hoc wireless network, In Mobile Computing, Chapter 5" Kluwer Academic 1996

8 M. Jiang, "Cluster Based Routing Protocol(CBRP)"

9 Charles E. Perkins, "Ad Hoc On-demand Distance Vector (AODV) Routing"

10 Charles E. Perkins, "Ad Hoc Networking" Addison-Wesley 75-138, 2000