TY - GEN
T1 - Capacity bounds for energy efficient data streaming in homogeneous wireless ad hoc networks
AU - Shpungin, Hanan
AU - Gopinathan, Ajay
AU - Li, Zongpeng
PY - 2011/9/20
Y1 - 2011/9/20
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=80052808316&partnerID=8YFLogxK
U2 - 10.1109/SAHCN.2011.5984907
DO - 10.1109/SAHCN.2011.5984907
M3 - Conference contribution
AN - SCOPUS:80052808316
SN - 9781457700934
T3 - 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011
SP - 269
EP - 277
BT - 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011
T2 - 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011
Y2 - 27 June 2011 through 30 June 2011
ER -