On the Interaction Between Scheduling and Compressive Data Gathering in Wireless Sensor Networks

Compressive data gathering (CDG) has emerged as a useful method for collecting sensory data in large scale sensor networks; this technique is able to reduce global scale communication cost without introducing intensive computation, and is capable of extending the lifetime of the entire sensor network by balancing the aggregation and forwarding load across the network. With CDG, multiple forwarding trees are constructed, each for aggregating a coded or compressed measurement, and these measurements are collected at the sink for recovering the uncoded transmissions from the sensors. This paper studies the problem of constructing forwarding trees for collecting and aggregating sensed data in the network under the realistic physical interference model. The problem of gathering tree construction and link scheduling is addressed jointly, through a mathematical formulation, and its complexity is underlined. Our objective is to collect data at the sink with both minimal latency and fewer transmissions. We show the joint problem is NP-hard and owing to its complexity, we present a decentralized method for solving the tree construction and the link scheduling subproblems. Our link scheduling subproblem relies on defining an interference neighbourhood for each link and co-ordinating transmissions among network links to control the interference. We prove the correctness of our algorithmic method and analyse its performance. Numerical results are presented to compare the performance of the decentralized solution with the joint model as well as prior work from the literature.

[1]  Xiang-Yang Li,et al.  Efficient Aggregation Scheduling in Multihop Wireless Sensor Networks with SINR Constraints , 2013, IEEE Transactions on Mobile Computing.

[2]  Sanjay Shakkottai,et al.  FlashLinQ: A synchronous distributed scheduler for peer-to-peer ad hoc networks , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[4]  Shouling Ji,et al.  Snapshot and Continuous Data Collection in Probabilistic Wireless Sensor Networks , 2014, IEEE Transactions on Mobile Computing.

[5]  Eytan Modiano,et al.  Longest-queue-first scheduling under SINR interference model , 2010, MobiHoc '10.

[6]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[7]  Jun Sun,et al.  Compressive data gathering for large-scale wireless sensor networks , 2009, MobiCom '09.

[8]  Ness B. Shroff,et al.  Delay Performance of Scheduling with Data Aggregation in Wireless Sensor Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[9]  Marco Righero,et al.  An introduction to compressive sensing , 2009 .

[10]  Gang Zhou,et al.  RID: radio interference detection in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Chadi Assi,et al.  A Distributed Method for Compressive Data Gathering in Wireless Sensor Networks , 2014, IEEE Communications Letters.

[12]  Ness B. Shroff,et al.  Maximizing Aggregated Information in Sensor Networks Under Deadline Constraints , 2011, IEEE Transactions on Automatic Control.

[13]  Geng Yang,et al.  An Algorithm for Data Aggregation Scheduling with Long-lifetime and Low-latency in Wireless Sensor Networks , 2012 .

[14]  T.-H. Hsu,et al.  Adaptive time division multiple access-based medium access control protocol for energy conserving and data transmission in wireless sensor networks , 2011, IET Commun..

[15]  Michael Dinitz,et al.  Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory , 2009, IEEE INFOCOM 2009.

[16]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[17]  F. Hwang,et al.  The Steiner Tree Problem , 2012 .

[18]  Wei Wang,et al.  Distributed Sparse Random Projections for Refinable Approximation , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[19]  A. Salman Avestimehr,et al.  ITLinQ: A new approach for spectrum sharing in device-to-device communication systems , 2014, ISIT.

[20]  Jianzhong Li,et al.  Distributed Data Aggregation Scheduling in Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[21]  Yuanyuan Yang,et al.  Low-latency SINR-based data gathering in wireless sensor networks , 2013, 2013 Proceedings IEEE INFOCOM.

[22]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[23]  Chadi Assi,et al.  Optimal and Efficient Algorithms for Projection-Based Compressive Data Gathering , 2013, IEEE Communications Letters.

[24]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[25]  Chadi Assi,et al.  Compressive data gathering using random projection for energy efficient wireless sensor networks , 2014, Ad Hoc Networks.

[26]  Viktor K. Prasanna,et al.  Energy-latency tradeoffs for data gathering in wireless sensor networks , 2004, IEEE INFOCOM 2004.

[27]  Xinbing Wang,et al.  Capacity and Delay Analysis for Data Gathering with Compressive Sensing in Wireless Sensor Networks , 2013, IEEE Transactions on Wireless Communications.

[28]  Chuan Wu,et al.  Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model , 2010, MSWIM '10.

[29]  Shouling Ji,et al.  Distributed Data Collection in Large-Scale Asynchronous Wireless Sensor Networks Under the Generalized Physical Interference Model , 2013, IEEE/ACM Transactions on Networking.

[30]  Roger Wattenhofer,et al.  Complexity in geometric SINR , 2007, MobiHoc '07.

[31]  Wen-Zhan Song,et al.  Time-Optimum Packet Scheduling for Many-to-One Routing in Wireless Sensor Networks , 2006, MASS.

[32]  Nitin H. Vaidya,et al.  Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing , 2010, MobiCom 2010.

[33]  Siyuan Chen,et al.  Data Collection Capacity of Random-Deployed Wireless Sensor Networks under Physical Models , 2012 .