Earticle

초록

영어

LEACH algorithm is a classical hierarchical routing algorithm; it uses the cluster head rotation mechanism to allocate the energy consumption to the whole network. But because of the randomness of the cluster head selection, the optimal number of cluster heads can not be obtained, at the same time, its position cannot do the best, some regions of the cluster head may be more concentrated, some areas may not cluster head, lead to the distance of non-cluster head node and cluster head node is too large, the energy consumption is too large. Soan improved routing algorithm based on LEACH algorithm is proposed, the basic idea is to determine the optimal number of cluster heads, non-uniform clustering, at the same time, the threshold is added in the LEACH algorithm, the nodes with high residual energy become cluster heads, in the process of transmission, multi hop transmission mechanism is adopted among cluster heads. Simulation results show that, this algorithm further reduces the energy consumption in the network, effectively extending the life cycle of the network.

목차

Abstract
 1. Introduction
 2. LEACH Protocol and Energy Consumption Model
  2.1. LEACH Protocol
  2.2. Existing Improved Algorithms and their Advantages and Disadvantages
  2.3. Radio Communication Model
 3. Improved LEACH Routing Algorithm (My Leach Algorithm)
  3.1. The Selection of Optimal Cluster Heads and Region Division
  3.2. Select Cluster Head
  3.3. Improved Communication between Cluster Head and Base Station
  3.4. Network Model
 4. Simulation and Results
 5. Conclusions
 References

키워드

저자

• Xiang Lin Qin [ School of Computer and Information Engineering, Harbin University of Commerce, Harbin, China ]
• Wen Zhang [ School of Computer and Information Engineering, Harbin University of Commerce, Harbin, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605