본문 바로가기
  • Home

Hierarchical Routing Algorithm for Improving Survivability of WSAN

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2016, 21(2), pp.51-60
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

조지용 1 최승권 2 Yonghwan Cho 3

1㈜디노ICT
2서원대학교
3충북대학교

Accredited

ABSTRACT

This paper proposes a hierarchical routing algorithm for enhancing survivability of sensor nodes on WSAN. Proposed algorithm has two important parts. The first is a clustering algorithm that uses distance between sensor and actor, and remaining energy of sensor nodes for selecting cluster head. It will induce uniform energy consumption, and this has a beneficial effect on network lifetime. The second is an enhanced routing algorithm that uses the shortest path tree. The energy efficient routing is very important in WSAN which has energy limitation. As a result, proposed algorithm extends network and nodes lifetime through consuming energy efficiently. Simulation results show that the proposed clustering algorithm outperforms conventional routing algorithms such as VDSPT in terms of node and network life time, delay, fairness, and data transmission ratio to BS.

Citation status

* References for papers published after 2023 are currently being built.

This paper was written with support from the National Research Foundation of Korea.