Earticle

초록

영어

Clustering is an efficient method adopted in various routing algorithms for wireless sensor networks. In this paper, we propose a Density-based Energy-efficient Clustering Algorithm (DECA). In DECA, we define the density of each node and regard it as an important evaluation metric. Together with nodes' residual energy under consideration, each cluster head is selected based on the density of nodes. We design an intra-cluster algorithm as well as a multi-hop inter-cluster routing algorithm. Moreover, we discuss the optimal number of clusters. Simulation results show that cluster heads are evenly distributed and our proposed routing algorithm do consume much less energy than some existed algorithms. The network lifetime is also largely prolonged.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Our proposed DEGRA Algorithm
  3.1. Relevant Models
  3.2. Cluster Head Selection
  3.3. Optimal Cluster Number
  3.4. Routing Procedure
 4. Performance Evaluation
  4.1. Simulation Environment
  4.2. Simulation Results
 5. Conclusions
 Acknowledgements
 References

키워드

저자

• Zhanyang Xu [ Institute of Information Network Technology, Nanjing University of Posts and Telecommunications, School of Computer and Software, Nanjing University of Information Science & Technology ]
• Yue Yin [ School of Computer and Software, Nanjing University of Information Science & Technology ]
• Jin Wang [ School of Computer and Software, Nanjing University of Information Science & Technology ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605