Routing of Wireless Sensor Network Based on Small World

被引：0

作者：

Yu Ge ^{[1
]}

Dong Jiang-ying ^{[2
]}

机构：

[1] Tsinghua Univ, Dept Elect Engn, Beijing 100084, Peoples R China

[2] Zhengzhou Univ Light Ind, Zhengzhou, Peoples R China

来源：

2012 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING (WICOM) | 2012年

关键词：

Small World; Wireless Sensor Networks; Routing;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页数：4

共 10 条

[1]

Anbo Meng, 2008, COMPUTER DIGITAL ENG, V36, P98

[2]

Fuhrmann Thomas, 2003, SMALL WORLD NETWORKS

[3] Small worlds in wireless networks [J].

Helmy, A .

IEEE COMMUNICATIONS LETTERS, 2003, 7 (10) :490-492

[4]

Qiang Guo, 2001, OPERATIONS RES MANAG, V10, P36

[5]

Sandberg O, 2006, SIAM PROC S, P144

[6]

SHARMA G, 2005, MOBIHOC05 MAY25 27 C

[7]

Wen Jia-Yan, 2007, ELECT MEASUREMENT TE, V30, P202

[8] Small world model-based polylogarithmic routing using mobile nodes [J].

Wu, Jie ;

Yang, Shu-Hui .

JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2008, 23 (03) :327-342

[9] Complex networks: Small-world, scale-free and beyond [J].

Wang, Xiao Fan ;

Chen, Guanrong .

IEEE Circuits and Systems Magazine, 2003, 3 (01) :6-20

[10]

YU CHANGWU, 2009, P 4 IEEE INT C WIR C, P483

← 1 →