Reducing the Path Length of a Mobile BS in WSNs

Recent research shows that the node energy in WSNs can be significantly saved by integrating mobile BS into the network, which is capable of collecting data from sensor nodes. However, the mobile BS may aggravate the latency problem of the network, and thus hinder its use. Rendezvous points are a subset of nodes that buffer data from other sensor nodes, and transfer the buffered data to mobile BS. The locations that the mobile BS must arrive in order to collect all the data from the WSN are called the stop points. Reduction in the number of stop points can serve as a balance between network energy saving and network latency. In this paper, we propose a stop points reducing algorithm, which can get the smallest stop point set in sensor networks while guarantees the coverage of the entire network. The algorithm is verified by extensive experiments.

[1]  Mehdi Behzad,et al.  Graphs and Digraphs , 1981, The Mathematical Gazette.

[2]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[3]  Eylem Ekici,et al.  Mobile element based differentiated message delivery in wireless sensor networks , 2006, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06).

[4]  Saumyendra Sengupta,et al.  Graphs and Digraphs , 1994 .

[5]  Jie Shao,et al.  A spanning tree algorithm for data aggregation in wireless sensor networks , 2008, 2008 7th World Congress on Intelligent Control and Automation.

[6]  A. M. Geoffrion.  Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

[7]  Guoliang Xing,et al.  Rendezvous design algorithms for wireless sensor networks with a mobile base station , 2008, MobiHoc '08.

[8]  Weijia Jia,et al.  Rendezvous Planning in Mobility-Assisted Wireless Sensor Networks , 2007, RTSS 2007.

[9]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[10]  Jie Lin,et al.  Towards mobility as a network control primitive , 2004, MobiHoc '04.

[11]  Sanjay Kumar Madria,et al.  Sensor networks: an overview , 2003 .

[12]  R. Ernst,et al.  Scenario Aware Analysis for Complex Event Models and Distributed Systems , 2007, RTSS 2007.

[13]  Ellen W. Zegura,et al.  Message ferry route design for sparse ad hoc networks with mobile nodes , 2006, MobiHoc '06.

[14]  Nicos Christofides,et al.  The Optimum Location of Multi-centres on a Graph , 1971 .

[15]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[16]  Archana Bharathidasan,et al.  Sensor Networks : An Overview , 2002 .

[17]  Thambipillai Srikanthan,et al.  Energy-efficient cluster-based scheme for failure management in sensor networks , 2008, IET Commun..

[18]  Eylem Ekici,et al.  Mobility-based communication in wireless sensor networks , 2006, IEEE Communications Magazine.

[19]  Yiu-Tong Chan,et al.  Exact and approximate maximum likelihood localization algorithms , 2006, IEEE Trans. Veh. Technol..