WSAN의 생존성 향상을 위한 계층적 라우팅 알고리즘
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 w...
Saved in:
Published in | 한국컴퓨터정보학회논문지 Vol. 21; no. 2; pp. 51 - 60 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | Korean |
Published |
한국컴퓨터정보학회
01.02.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. KCI Citation Count: 0 |
---|---|
Bibliography: | G704-001619.2016.21.2.007 |
ISSN: | 1598-849X 2383-9945 |