Earticle

초록

영어

The LNCR-IDS for the mobile Ad-HOC network is put forward for the problem that the redundancy clusters are adverse to energy saving because leaf node independent clusters exist in the CHS and cluster partition in the traditional mobile Ad-Hoc network containing IDS. Firstly, make analysis on the traditional random cluster partition method and find that the method easily results in the problem of redundancy partition, put forward the new method which carries out cluster partition starting from the leaf node, try to solve the problem of redundancy of cluster partition, so as to lower the energy consumption; secondly, make analysis on the realization of algorithm, construct the algorithm of single node elimination and give the process of cluster partition via simple analysis example in allusion to the proposed method; finally, carry out simulation comparison with the existed algorithm via the experimental platform created, the proposed algorithm should be about 30% less than the comparing algorithm in the number of clusters, which is beneficial to the improvement of network service life.

목차

Abstract
 1. Introduction
 2. Efficient Cluster Creation
  2.1. Problem Description
  2.2. Single Node Cluster Removing Algorithm
 3. Simulation Experiment and Analysis
 4. Conclusion
 References

키워드

저자

• Jinshan Huang [ Department of computer science, Yunyang Teachers'College, Hubei Shiyan ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605