Skip to Main content Skip to Navigation
Conference papers

A New Security Routing Algorithm Based on MST for Wireless Sensor Network

Abstract : In order to solve the general problems of information overlap, low energy utilization rate and network transmission security in routing protocols of wireless sensor networks, a scheme of energy-efficient and security-high routing for wireless sensor networks (EEASHR) based on improved Kruskal algorithms is proposed in this paper. The proposed scheme takes the energy size required for transmission and the value of reliability between nodes and nodes as the edges value of graph, then uses improved Kruskal algorithm to generate the minimum spanning tree (MST) in sink node, in other words, the optimal route path. The simulation in NS2 shows that the proposed algorithm improves network energy efficiency, reduces the node packet loss rate and prolongs the life cycle of wireless sensor networks.
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, May 19, 2017 - 10:43:30 AM
Last modification on : Thursday, March 5, 2020 - 5:41:53 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Meimei Zeng, Hua Jiang. A New Security Routing Algorithm Based on MST for Wireless Sensor Network. 7th International Conference on Intelligent Information Processing (IIP), Oct 2012, Guilin, China. pp.331-336, ⟨10.1007/978-3-642-32891-6_41⟩. ⟨hal-01524974⟩



Record views


Files downloads