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

Abstract:

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

• Periodical: Applied Mechanics and Materials (Volumes 347-350)
• Pages: 3899-3902
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.347-350.3899
• Online since: August 2013
• Authors: Yu Hua Liu, Zhen Rong Luo, Ke Xu, Cui Xu
• Keywords: Distance, Energy, LAC, Multi-Hop

References

[1] Wendi B. Heinzelman. An application-specific protocol architectures for wireless: networks [D]. Boston: Massachusetts institute of Technology, (2002).

[2] Handy J, Haase M, Timmermann D. Low energy adaptive clustering hierarchy with deterministic cluster head selection [C]/Proc of the 4 the International Workshop on Mobile and Wireless Communications of Network. 2002: 368-372.

DOI: 10.1109/mwcn.2002.1045790

[3] YOUNG IO, FAHMY S. HEED: a hybrid, energy-efficient distributed clustering approach for Ad hoc sensor networks [J]. IEEE Trans on Mobile Computing, 2004, 3 (4): 366-379.

DOI: 10.1109/tmc.2004.41

[4] C. Wang, K. S sohraby and B. Li etc, A survey of transport protocols for wireless sensor networks, IEEE Network [J], vol. 20, pp.34-40, (2006).

DOI: 10.1109/mnet.2006.1637930

[5] C.Y. Wan, A. T. Campbell, and L. Krishnamurthy, PSFQ: A reliable transport protocol for wireless sensor networks[C], Proc. ACM Intern. Workshop on Wireless. Sensor Network. Appl., pp.1-11, (2002).

DOI: 10.1145/570738.570740

[6] F. Stann and J. Heidemann, RMST: Reliable Data Transport in Sensor Networks[C], 1st IEEE International Workshop on Sensor Net Protocols and Applications, (2003).

DOI: 10.1109/snpa.2003.1203361

[7] Y. Sankarasubramaniam, O. B. Akan, and I. F. Akyildiz, ESRT: Event-to-sink reliable transport in wireless sensor networks[C], Proc. Int. Symp. Mobile Ad Hoc Networking Computer, pp.177-188, (2003).

DOI: 10.1145/778415.778437

[8] C. T. Ee and R. Bajcsy, Congestion control and fairness for many-to-one routing in sensor networks[C], in Proceedings of the 2nd international conference on Embedded networked sensor systems Baltimore, MD, USA: ACM, (2004).

DOI: 10.1145/1031495.1031513

[9] Wenwen Dai, Kaihua Xu, James J. (Jong Hyuk) Park, Naixue Xiong and Yuhua Liu. A Ring and Clustering Routing Scheme based on Data Field in Sensor Network., The 3rd FTRA International Conference on Computer Science and its Applications (CSA-11), Dec. 2011, vol. 114, Part 1.

DOI: 10.1007/978-94-007-2792-2_18

[10] Yuhua liu, Zhenrong luo, Kaihua xu and Lilong chen, A Reliable Clustering Algorithm base on LEACH Protocolin Wireless Mobile Sensor Networks, The 2010 International Conference on Mechanical and Electrical Technology(ICMET 2010), IEEE Computer Society Singapore, September 10-12, (2010).

DOI: 10.1109/icmet.2010.5598449