Earticle

초록

영어

As WSN is energy constraint so energy efficiency of nodes is important. Because avoiding long distance communication, clustering operating in rounds is an efficient algorithm for prolonging the lifetime of WSN and its performance depends on duration of a round. A short round time leads to frequent re-clustering while a long round time increases energy consume of cluster heads more. So existing clustering schemes determine proper round time, based on the parameters of initial WSN. But it is not appropriate to apply the round time according to initial value throughout the whole network time because WSN is very dynamic networks nodes can be added or vanished. In this paper we propose a new algorithm which calculates the round time relying on the alive node number to adapt the dynamic WSN. Simulation results validate the proposed algorithm has better performance in terms of energy consumption of nodes and loss rate of data.

목차

Abstract
 1. Introduction
 2. Related Reserchs
  2.1. LEACH protocol
 3. Routing technique for the energy efficiency
 4. Performance Analysis
  4.1. Simulation environment
 5. Conclusion
 References

키워드

저자

• Ganesh Gauta [ Kathmandu Engineering College Tribhuvan University, Nepal ]
• Seongsoo Cho [ Institute of Information Science and Engineering Research, Mokpo National University, Korea ]
• Kyedong Jung [ Department of Culture, Kwangwoon University, Korea ]
• Jong-Yong Lee [ Department of Culture, Kwangwoon University, Korea ] Corresponding Author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Internet, Broadcasting and Communication

• 간기

  계간

• pISSN

  2288-4920

• eISSN

  2288-4939

• 수록기간

  2009~2025

• 십진분류

  KDC 326 DDC 380