Research and Improve on Secure Routing Protocols in Wireless Sensor Networks

Author

Di Wu ; Gang Hu

Author_Institution

Coll. of Comput. & Inf. Eng., Hohai Univ., Changzhou

fYear

2008

Firstpage

853

Lastpage

856

Abstract

Most routing protocols in wireless sensor networks take networks lifetime as design target, but not security. This paper researches on routing security and proposes SS-LEACH algorithm based on LEACH algorithm. The SS-LEACH algorithm makes use of nodes self-localization technology and keys pre-distribution strategy. It improves the method electing cluster-heads and forms dynamic stochastic multi-paths cluster-heads chains. The results of simulation demonstrate that the SS-LEACH algorithm not only prolongs the lifetime of wireless sensor networks effectively, but also enhances routing security strongly.

Keywords

routing protocols; stochastic processes; telecommunication security; wireless sensor networks; SS-LEACH algorithm; dynamic stochastic multipaths cluster-heads chains; predistribution strategy; routing protocols; routing security; self-localization technology; wireless sensor networks; Algorithm design and analysis; Clustering algorithms; Data security; Equations; Floods; Information security; Nominations and elections; Routing protocols; Stochastic processes; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems for Communications, 2008. ICCSC 2008. 4th IEEE International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4244-1707-0

Electronic_ISBN

978-1-4244-1708-7

Type

conf

DOI

10.1109/ICCSC.2008.186

Filename

4536878