Aggregation Latency-Energy Tradeoff in Wireless Sensor Networks with Successive Interference Cancellation

Minimizing latency and energy consumption is the prime objective of the design of data aggregation in battery-powered wireless networks. A tradeoff exists between the aggregation latency and the energy consumption, which has been widely studied under the protocol interference model. There has been, however, no investigation of the tradeoff under the physical interference model that is known to capture more accurately the characteristics of wireless interferences. When coupled with the technique of successive interference cancellation, by which a receiver may recover signals from multiple simultaneous senders, the model can lead to much reduced latency but increased energy usage. In this paper, we investigate the latency-energy tradeoff for data aggregation in wireless sensor networks under the physical interference model and using successive interference cancellation. We present theoretical lower bounds on both latency and energy as well as their tradeoff, and give an efficient approximation algorithm that can achieve the asymptotical optimum in both aggregation latency and latency-energy tradeoff. We show that our algorithm can significantly reduce the aggregation latency, for which the energy consumption is kept at its lowest possible level.

[1]  Xiaohua Jia,et al.  Minimum-latency aggregation scheduling in multihop wireless networks , 2009, MobiHoc '09.

[2]  Paolo Santi,et al.  Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks , 2006, MobiCom '06.

[3]  Jeffrey G. Andrews,et al.  Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation , 2007, IEEE Transactions on Information Theory.

[4]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Béla Bollobás,et al.  Energy-latency tradeoff for in-network function computation in random networks , 2011, 2011 Proceedings IEEE INFOCOM.

[6]  Sajal K. Das,et al.  Trade-off between energy savings and source-to-sink delay in data dissemination for wireless sensor networks , 2005, MSWiM '05.

[7]  J. G. Andrews,et al.  Interference cancellation for cellular systems: a contemporary overview , 2005, IEEE Wireless Communications.

[8]  Yingshu Li,et al.  Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

[10]  T. Moscibroda,et al.  The Worst-Case Capacity of Wireless Sensor Networks , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[11]  Shaojie Tang,et al.  Efficient data aggregation in multi-hop wireless sensor networks under physical interference model , 2009, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems.

[12]  Sandeep S. Kulkarni,et al.  TRADEOFF BETWEEN ENERGY AND LATENCY FOR CONVERGECAST , 2005 .

[13]  Xiang-Yang Li,et al.  Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks , 2011, IEEE Transactions on Computers.

[14]  Roger Wattenhofer,et al.  Scheduling Wireless Links with Successive Interference Cancellation , 2012, 2012 21st International Conference on Computer Communications and Networks (ICCCN).

[15]  Jianzhong Li,et al.  Minimum-time aggregation scheduling in multi-sink sensor networks , 2011, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[16]  David Wetherall,et al.  Taking the sting out of carrier sense: interference cancellation for wireless LANs , 2008, MobiCom '08.

[17]  Yingshu Li,et al.  An Energy-Efficient Distributed Algorithm for Minimum-Latency Aggregation Scheduling in Wireless Sensor Networks , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[18]  Liqun Fu,et al.  Effective Carrier Sensing in CSMA Networks under Cumulative Interference , 2010, 2010 Proceedings IEEE INFOCOM.

[19]  J. J. Garcia-Luna-Aceves,et al.  Embracing Interference in Ad Hoc Networks Using Joint Routing and Scheduling with Multiple Packet Reception , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[20]  Xiaodong Wang,et al.  Scheduling in wireless ad hoc networks with successive interference cancellation , 2011, 2011 Proceedings IEEE INFOCOM.

[21]  Christoph Ambühl,et al.  An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks , 2005, ICALP.

[22]  Helmut Groemer,et al.  Über die Einlagerung von Kreisen in einen konvexen Bereich , 1960 .

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

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

[25]  Shlomo Shamai,et al.  Capacity of Linear Two-hop Mesh Networks with Rate Splitting, Decode-and-forward Relaying and Cooperation , 2007, ArXiv.

[26]  Shaojie Tang,et al.  A Delay-Efficient Algorithm for Data Aggregation in Multihop Wireless Sensor Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[27]  Aravind Srinivasan,et al.  Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[28]  Yiwei Thomas Hou,et al.  Squeezing the most out of interference: An optimization framework for joint interference exploitation and avoidance , 2012, 2012 Proceedings IEEE INFOCOM.