Capacity bounds for energy efficient data streaming in homogeneous wireless ad hoc networks

According to the Gaussian channel model, the throughput of a wireless link (u, v) is B log(l + S/N) bps, where B is the channel bandwidth and S/N is the signal to noise ratio. Wireless links which are scheduled simultaneously add to the noise levels of each other and cause the overall network capacity to decrease. In this paper we consider a wireless ad hoc network with unicast or multicast routing and simultaneously transmitting nodes along the route. Our major goal is to increase the capacity of the unicast/multicast sessions when all the wireless links are scheduled simultaneously. In addition, we try to minimize the number of active nodes involved in the unicast/multicast session for the purpose of energy efficiency. We assume that all the nodes share the same transmission range if activated and propose several node activation schemes with provable asymptotic bounds on the capacity and energy efficiency of the induced communication graph. We verify our results by simulations.

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

[2]  Yunhao Liu,et al.  Capacity of large scale wireless networks under Gaussian channel model , 2008, MobiCom '08.

[3]  Yue Wang,et al.  Understanding the paradoxical effects of power control on the capacity of wireless networks , 2008, IEEE Transactions on Wireless Communications.

[4]  Martin Thimm,et al.  On the approximability of the Steiner tree problem , 2003, Theor. Comput. Sci..

[5]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[6]  Zongpeng Li,et al.  Group Strategyproof Multicast in Wireless Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[7]  Oktay Günlük,et al.  The multicast packing problem , 2000, TNET.

[8]  Jack M. Holtzman,et al.  Wireless information networks , 2010, 2010 International Conference on Wireless Information Networks and Systems (WINSYS).

[9]  Weili Wu,et al.  A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs , 2009, COCOA.

[10]  Rong Zheng,et al.  Asymptotic Bounds of Information Dissemination in Power-Constrained Wireless Networks , 2008, IEEE Transactions on Wireless Communications.

[11]  Hamid R. Sadjadpour,et al.  The capacity of wireless ad hoc networks with multi-packet reception , 2010, IEEE Transactions on Communications.

[12]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[13]  Roger Wattenhofer,et al.  The Complexity of Connectivity in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[14]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[15]  Alex Zelikovsky,et al.  An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.

[16]  Hanan Shpungin,et al.  Throughput and Energy Efficiency in Wireless Ad Hoc Networks with Gaussian Channels , 2010, 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

[17]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[18]  Paul J.M. Havinga,et al.  A Lightweight Medium Access Protocol (LMAC) for Wireless Sensor Networks: Reducing Preamble Transmissions and Transceiver State Switches , 2004 .

[19]  Katia Obraczka,et al.  Energy-efficient collision-free medium access control for wireless sensor networks , 2003, SenSys '03.

[20]  Shaojie Tang,et al.  Multicast Throughput for Hybrid Wireless Networks under Gaussian Channel Model , 2009, IEEE Transactions on Mobile Computing.

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .