Earticle

초록

영어

Wireless sensor networks (WSN) technologies are widely used in today’s world for monitoring purposes. In most applications, the sensors are not plugged in. Instead, they get power from the batteries they carry. To keep the network alive for a long time with such limited power, it is very important to conserve energy while the network is functioning. In this paper, we present an energy efficient routing algorithm for WSN. In this algorithm, we divide the sensor nodes into several scheduling sets and let them work alternatively. In this way, the sensors do not have to be active all the time which saves a lot of energy. When choosing the next sensor to forward the information to, we consider both the distance from the base station to the sensor and its current energy level. So the network power consumption will be distributed among the sensors. When the network does not have enough sensors that have sufficient energy to run, it generates new scheduling sets automatically. Simulations and comparisons demonstrate that our algorithm outperforms the previous work on energy efficient routing algorithms.

목차

Abstract
 1. Introduction
 2. WSN Design Challenges
 3. Energy Efficient WSN
 4. Proposed Energy Efficient Routing Algorithm
  4.1. Algorithm Basis
  4.2. Algorithm Description
  4.3. Energy Model
  4.4. Example Networks
 5. Simulation and Comparison
 6. Conclusion and Future Work
 References

키워드

저자

• Yuping Dong [ Tufts University ]
• Hwa Chang [ Tufts University ]
• Zhongjian Zou [ Tufts University ]
• Sai Tang [ Tufts University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605