A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network

2019 ◽  
Vol 75 (9) ◽  
pp. 5930-5945 ◽  
Author(s):  
Guolong Chen ◽  
Zhenghua Xin ◽  
Han Li ◽  
Tonghai Zhu ◽  
Maodi Wang ◽  
...  
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Shortest Path ◽  
Wireless Sensor ◽  
Tree Algorithm

A Recursive Shortest Path Routing Algorithm With Application for Wireless Sensor Network Localization

2016 ◽  
Vol 16 (11) ◽  
pp. 4631-4637 ◽  
Author(s):  
Juan Cota-Ruiz ◽  
Pablo Rivas-Perea ◽  
Ernesto Sifuentes ◽  
Rafael Gonzalez-Landaeta
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Shortest Path ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Sensor Network Localization ◽  
Shortest Path Routing ◽  
Network Localization

The Research of Routing Algorithm Based on Shortest Path Tree in WSNs

2013 ◽  
Vol 347-350 ◽  
pp. 3899-3902
Author(s):  
Yu Hua Liu ◽  
Zhen Rong Luo ◽  
Ke Xu ◽  
Cui Xu
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Shortest Path ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Shortest Path Tree ◽  
Hierarchical Topology

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).

Sign in / Sign up

Export Citation Format

Share Document