SWER:small world-based efficient routing for
wireless sensor networks with mobile sinks

doi:10.1007/s11704-009-0052-0

Front. Comput. Sci.

2009, Vol. 3

Issue (3) : 427-434 https://doi.org/10.1007/s11704-009-0052-0

Research articles

SWER:small world-based efficient routing for wireless sensor networks with mobile sinks

Xuejun LIU ¹, Jihong GUAN ², Guangwei BAI ³, Haiming LU ³,

1.Department of Computer Science and Engineering, Fudan University, Shanghai 200433, China；College of Information Science and Engineering, Nanjing University of Technology, Nanjing 210009, China; 2.Department of Computer Science and Techology, Tongji University, Shanghai 200092, China; 3.College of Information Science and Engineering, Nanjing University of Technology, Nanjing 210009, China;

Download: PDF(369 KB)
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

Abstract The interest in small-world network has highlighted the applicability of both the graph theory and the scaling theory to the analysis of network systems. In this paper, we introduce a new routing protocol, small world-based efficient routing (SWER), dedicated to supporting sink mobility and small transfers. The method is based on the concept of the small worlds where the addition of a small number of long-range links in highly clustered networks results in significant reduction in the average path length. Based on the characteristic of sensor networks, a cluster-based small world network is presented, and an analytical model is developed to analyze the expected path length. SWER adopts a simple and effective routing strategy to forward data to the mobile sink in a small transfer scene and avoid expensive mechanisms to construct a high quality route. We also study the routing scheme and analyze the expected path length in the case where every node is aware of the existence of p longrange links. In addition, we develop a hierarchical mechanism in which the mobile sink only transmits its location information to the cluster heads when it enters a new cluster. Thus we also avoid expensive cost to flood the location of the mobile sink to the whole network.

Keywords sensor networks small world routing scheme mobile sinks

Issue Date: 05 September 2009

Cite this article:

Xuejun LIU,Guangwei BAI,Jihong GUAN, et al. SWER:small world-based efficient routing for wireless sensor networks with mobile sinks[J]. Front. Comput. Sci., 2009, 3(3): 427-434.

URL:

https://academic.hep.com.cn/fcs/EN/10.1007/s11704-009-0052-0
https://academic.hep.com.cn/fcs/EN/Y2009/V3/I3/427

	Watts D, Strogatz S. Collective dynamics of small-worldnetworks. Nature, 1998, 393(6684): 440―442 doi: 10.1038/30918
	Kleinberg J. Thesmall-world phenomenon: An algorithmic perspective. In: Proceedings of ACM Symp. on Theory of Computing (STOC), 2000, 163―170
	Helmy A. Smallworlds in wireless networks. IEEE CommunicationsLetters, 2003, 7(10): 490―492 doi: 10.1109/LCOMM.2003.818887
	Chitradurga R, Helmy A. Analysis of wired short cutsin wireless sensor networks. In: Proceedingsof IEEE/ACS International Conference on Pervasive Services, 2004, 167―176
	Sharma G, Mazumdar R. Hybrid sensor networks :Asmall world. In: Proceedings of the 6thACM international symposium on Mobile Ad Hoc networking and computing, 2005, 366―377
	Ken Y K, John C S, David K Y. Small world overlay P2P networks. In: Proceedings of the Twelfth IEEE International Workshop on Qualityof Service, Canada: IEEE, 2004, 201―210
	Helmy A, Garg S, Pamu P, et al. Contact based architecture for resource discovery(CARD) in large scale MANets. In: Proceedingsof the 17th International Symposium on Parallel and Distributed Processing, 2003, 219―227
	Helmy A, Garg S, Pamu P, et al. CARD: A Contact-based architecture for resourcediscovery in Ad Hoc networks. Mobile Networksand Applications, 2005, 10(1-2): 99―113 doi: 10.1023/B:MONE.0000048549.15371.53
	Cavalcanti D, agrawal D, Kelner J, et al. Exploiting the small-world effect to increaseconnectivity in wireless ad hoc networks. In: Proceedings of the 11th International Conference on Telecommunications, 2004, 388―393
	Ye Q, Cheng L. A lightweight approach tomobile multicasting in wireless sensor networks. International Journal of Ad Hoc and Ubiquitous Computing, 2007, 2(1/2): 36―45 doi: 10.1504/IJAHUC.2007.011602
	Kim H, Abdelzaher T, Kwon W. Minimum-energy asynchronous dissemination to mobile sinksin wireless sensor networks. In: Proceedingsof Embedded Networked Sensor Systems, 2003, 193―204
	Luo H, Ye F, Cheng J, et al. TTDD: two-tier data dissemination in large-scalewireless sensor networks. Journal of WirelessNetworks, 2005, 11(1-2): 161―175 doi: 10.1007/s11276-004-4753-x
	Luo J, Panchard J, Piorkowski M, et al. MobiRoute: routing towards a. mobile sink forimproving lifetime in sensor networks. In: Proceedings of International Conference on Distributed Computingin Sensor Systems, 2006, 480―497
	Jain S, Shah R, Brunette W, et al. Exploiting mobility for energy efficient datacollection in sensor networks. Mobile Networksand Applications, 2006, 11(3): 327―339 doi: 10.1007/s11036-006-5186-9
	Vincze Z, Vass D, Vida R, et al. Adaptive sink mobility in event-driven denselydeployed wireless sensor networks. InternationalJournal on Ad Hoc & Sensor Networks, 2007, 3(2―3): 255―284
	Fodor K, Vid´ĺccs A. Efficient routingto mobile sinks in wireless sensor networks. In: Proceedings of the 2nd International Workshop on PerformanceControl in Wireless Sensor Networks, 2007, 156―162

[1]	Bartłomiej PŁACZEK. Decision-aware data suppression in wireless sensor networks for target tracking applications[J]. Front. Comput. Sci., 2017, 11(6): 1050-1060.
[2]	Chengliang WANG,Yayun PENG,Debraj DE,Wen-Zhan SONG. DPHK: real-time distributed predicted data collecting based on activity pattern knowledge mined from trajectories in smart environments[J]. Front. Comput. Sci., 2016, 10(6): 1000-1011.
[3]	Bin WANG,Xiaochun YANG,Guoren WANG,Ge YU,Wanyu ZANG,Meng YU. Energy efficient approximate self-adaptive data collection in wireless sensor networks[J]. Front. Comput. Sci., 2016, 10(5): 936-950.
[4]	Wei LI, Wei ZHANG. Multiple target localization in wireless visual sensor networks[J]. Front Comput Sci, 2013, 7(4): 496-504.
[5]	Jun XU, Xuehai ZHOU, Feng YANG. Traceback in wireless sensor networks with packet marking and logging[J]. Front Comput Sci Chin, 2011, 5(3): 308-315.
[6]	Defu CHEN, Zhengsu TAO. An adaptive polling interval and short preamble media access control protocol for wireless sensor networks[J]. Front Comput Sci Chin, 2011, 5(3): 300-307.
[7]	Ye LI, Honggang LI, Yuwei ZHANG, Dengyu QIAO, . Packet transmission policies for battery operated wireless sensor networks[J]. Front. Comput. Sci., 2010, 4(3): 365-375.
[8]	Jiannong CAO, Xuefeng LIU, Yi LAI, Hejun WU, . iSensNet: an infrastructure for research and development in wireless sensor networks[J]. Front. Comput. Sci., 2010, 4(3): 339-353.
[9]	Qiyuan ZHANG, Xuehai ZHOU, . Efficient distributed location verification in wireless sensor networks[J]. Front. Comput. Sci., 2010, 4(1): 123-134.
[10]	Wei QU, Zhe LI, . Research of localization approach for the new comer in wireless sensor networks[J]. Front. Comput. Sci., 2009, 3(4): 543-549.

Viewed

Full text

Abstract

Cited

Shared

Discussed