Data quality maximization in sensor networks with a mobile sink

In this paper we consider a wireless sensor network with a mobile sink moving along a fixed trajectory without stop to collect data. We assume that a few powerful and high-capacity sensors deployed nearby the trajectory are the gateways, which are able to communicate with the sink directly when the sink is within their transmission ranges. Gateways play the role of relay nodes for the other sensors in the network. We also assume that the time of data uploading from the gateways to the mobile sink is limited. Thus, data from only a subset of sensors, called packet nodes, can be collected and used to estimate those of the others. The data quality is measured by the estimation accuracy. The upper bound on the number of packet nodes for a gateway is defined as the gateway quota. We formulate the optimization problem with the objective to identify the set of packet nodes, allocate them to gateways subject to gateway quotas, and devise an energy-efficient routing protocol, such that the sink can efficiently collect data generated from packet nodes with the maximum quality. Due to the NP-hardness of this problem, we propose a heuristic with low computation complexity. We also conduct extensive experiments by simulation to evaluate the performance of the proposed heuristic.

[1]  Balaji Raghavachari,et al.  Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design , 2004, TALG.

[2]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

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

[4]  Yannis Kotidis,et al.  Snapshot queries: towards data-centric sensor networks , 2005, 21st International Conference on Data Engineering (ICDE'05).

[5]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[6]  Ye Xia,et al.  Maximizing the Lifetime of Wireless Sensor Networks with Mobile Sink in Delay-Tolerant Applications , 2010, IEEE Transactions on Mobile Computing.

[7]  Jian Ma,et al.  Designing Energy-Efficient Wireless Sensor Networks with Mobile Sinks , 2006 .

[8]  Rajesh K. Gupta,et al.  Optimizing Energy-Latency Trade-Off in Sensor Networks with Controlled Mobility , 2009, IEEE INFOCOM 2009.

[9]  Weifa Liang,et al.  Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[10]  Subir Biswas,et al.  Joint routing and navigation protocols for data harvesting in sensor networks , 2008, 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[11]  Jennifer Widom,et al.  Adaptive filters for continuous queries over distributed data streams , 2003, SIGMOD '03.

[12]  Nick Roussopoulos,et al.  Hierarchical In-Network Data Aggregation with Quality Guarantees , 2004, EDBT.

[13]  Yuanyuan Yang,et al.  SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[14]  Catherine Rosenberg,et al.  Design guidelines for wireless sensor networks: communication, clustering and aggregation , 2004, Ad Hoc Networks.

[15]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

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

[17]  Weifa Liang,et al.  Placing Optimal Number of Sinks in Sensor Networks for Network Lifetime Maximization , 2011, 2011 IEEE International Conference on Communications (ICC).

[18]  Yuanyuan Yang,et al.  Efficient Data Gathering with Mobile Collectors and Space-Division Multiple Access Technique in Wireless Sensor Networks , 2011, IEEE Transactions on Computers.

[19]  Yu Hen Hu,et al.  Adaptive nodes scheduling approach for clustered sensor networks , 2009, 2009 IEEE Symposium on Computers and Communications.

[20]  Christos H. Papadimitriou,et al.  The complexity of the capacitated tree problem , 1978, Networks.

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

[22]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .