Earticle

초록

영어

Clustering is an efficient technique that is widely adopted in wireless sensor networks. It divides network into clusters and let cluster heads be responsible for forwarding aggregated data to the sink. With energy efficiency in account, the conflict between an individual node and the entire network remains to be solved. In this paper, we propose a Density-based Energy-efficient Game-theoretic Routing Algorithm (DEGRA). As a clustering algorithm, DEGRA adopts game theory and set a utility function based on the nodes’ density, residual energy and average energy consumption of its neighboring nodes. Cluster heads are iteratively selected. We also design the intra-cluster and multi-hop inter-cluster routing algorithms. Simulation results show that cluster heads are evenly distributed and our proposed routing algorithm do consume much less energy than algorithms such as LEACH and DEER. The network lifetime is also largely prolonged.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Our Proposed DEGRA Algorithm
  3.1. Energy Model
  3.2. Game-theoretic Model
  3.3. Cluster Head Selection
  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