Routing of Wireless Sensor Network Based on Small World

Author

Yu Ge ; Dong Jiang-ying

Author_Institution

Dept. of Electron. Eng., Tsinghua Univ., Beijing, China

fYear

2012

fDate

21-23 Sept. 2012

Firstpage

1

Lastpage

4

Abstract

The theory of small-world can be introduced into Wireless Sensor Networks(WSN). Due to the small-world topology characteristics, a routing of wireless sensor network based on the theory of small-world (SWR) is proposed. The algorithm introduces into super-node ring which is considered as an undirected graph. The improved Floyd algorithm is utilized to calculate the shortest transmission path in order to shorten the route setup time, increase transmission efficiency and reduce energy consumption in wireless sensor networks. The simulation results show that the algorithm is more effective than the PSCF and the Metropolis-Hastings in the routing setup time, energy consumption and the throughput of the networks.

Keywords

telecommunication network routing; wireless sensor networks; Floyd algorithm; Metropolis-Hastings; PSCF; WSN; energy consumption reduction; route setup time; shortest transmission path; small-world theory; small-world topology characteristics; super-node ring; transmission efficiency; undirected graph; wireless sensor network routing; wireless sensor networks; Algorithm design and analysis; Clustering algorithms; Energy consumption; Network topology; Routing; Topology; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing (WiCOM), 2012 8th International Conference on

Conference_Location

Shanghai

ISSN

2161-9646

Print_ISBN

978-1-61284-684-2

Type

conf

DOI

10.1109/WiCOM.2012.6478667

Filename

6478667