The Research of Routing Algorithm Based on Shortest Path Tree in WSNs
- https://doi.org/10.2991/iccsee.2013.562How to use a DOI?
- LAC, Energy, Multi-hop, Distance.
This article poses an algorithm of the hierarchical topology in wireless sensor network based on shortest path tree algorithm to cover the shortage of LAC Routing Algorithm (LAC-T), which based on SPT(Shortest Path Tree). LAC-T algorithm elects cluster head by the remaining energy of nodes and the distance between node and base station. Meanwhile, it uses SPT to communicate among cluster heads in WSNs. The result of stimulation shows that LAC-T algorithm is not only easy to achieve, but could be better balance the energy consumption of each node, extend the lifespan of WSN (Wireless Sensor Network).
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Yuhua Liu AU - Zhenrong Luo AU - Ke Xu AU - Cui Xu PY - 2013/03 DA - 2013/03 TI - The Research of Routing Algorithm Based on Shortest Path Tree in WSNs BT - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013) PB - Atlantis Press SP - 2243 EP - 2245 SN - 1951-6851 UR - https://doi.org/10.2991/iccsee.2013.562 DO - https://doi.org/10.2991/iccsee.2013.562 ID - Liu2013/03 ER -