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

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 long-range 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.

[1]  Saurabh Garg,et al.  Contact-based architecture for resource discovery (CARD) in large scale MANets , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[2]  Ahmed Helmy,et al.  Analysis of Wired Short Cuts in Wireless Sensor Networks , 2004, The IEEE/ACS International Conference on Pervasive Services.

[3]  Gaetano Borriello,et al.  Exploiting Mobility for Energy Efficient Data Collection in Wireless Sensor Networks , 2006, Mob. Networks Appl..

[4]  Ahmed Helmy,et al.  CARD: A Contact-based Architecture for Resource Discovery in Wireless Ad Hoc Networks , 2005, Mob. Networks Appl..

[5]  L. Tong,et al.  Energy Efficient Data Collection in Sensor Networks , 2022 .

[6]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[7]  Ahmed Helmy,et al.  CARD: A Contact-based Architecture for Resource Discovery in Ad Hoc Networks , 2004 .

[8]  Rolland Vida,et al.  Adaptive Sink Mobility in Event-Driven Densely Deployed Wireless Sensor Networks , 2007, Ad Hoc Sens. Wirel. Networks.

[9]  Jun Luo,et al.  MobiRoute: Routing Towards a Mobile Sink for Improving Lifetime in Sensor Networks , 2006, DCOSS.

[10]  Liang Cheng,et al.  A lightweight approach to mobile multicasting in Wireless Sensor Networks , 2007, Int. J. Ad Hoc Ubiquitous Comput..

[11]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[12]  Hyung Seok Kim,et al.  Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks , 2003, SenSys '03.

[13]  Attila Vidács,et al.  Efficient routing to mobile sinks in wireless sensor networks , 2007, WICON '07.

[14]  Ahmed Helmy,et al.  Small worlds in wireless networks , 2003, IEEE Communications Letters.

[15]  David K. Y. Yau,et al.  Small-world overlay P2P networks: Construction, management and handling of dynamic flash crowds , 2006, Comput. Networks.

[16]  Haiyun Luo,et al.  TTDD: Two-Tier Data Dissemination in Large-Scale Wireless Sensor Networks , 2005, Wirel. Networks.

[17]  Dharma P. Agrawal,et al.  Exploiting the Small-World Effect to Increase Connectivity in Wireless Ad Hoc Networks , 2004, ICT.

[18]  Ravi Mazumdar,et al.  Hybrid sensor networks: a small world , 2005, MobiHoc '05.