A New Security Routing Algorithm Based on MST for Wireless Sensor Network - Intelligent Information Processing VI Access content directly
Conference Papers Year : 2012

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

Meimei Zeng
  • Function : Author
  • PersonId : 1008506
Hua Jiang

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.
Fichier principal
Vignette du fichier
978-3-642-32891-6_41_Chapter.pdf (130.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01524974 , version 1 (19-05-2017)

Licence

Attribution

Identifiers

Cite

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⟩
55 View
81 Download

Altmetric

Share

Gmail Facebook X LinkedIn More