13.07.2015 Views

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

On the Interaction of Bandwidth Constra<strong>in</strong>tsand Energy Efficiency <strong>in</strong> All-Wireless NetworksTommy Chu and Ioanis NikolaidisComput<strong>in</strong>g <strong>Science</strong> DepartmentUniversity of AlbertaEdmonton, Alberta T6G 2E8, Canada{tommy,yannis}@cs.ualberta.caAbstract. The m<strong>in</strong>imization of expended energy for unicast and broadcastcommunication between nodes <strong>in</strong> a wireless network has been studiedmostly as a path optimization problem without particular regard forthe traffic load demands. In this paper, we consider the call admissionproblem where<strong>by</strong> given a traffic load (described as source-dest<strong>in</strong>ationrate demands) the required expended energy is m<strong>in</strong>imized. In addition,we explicitly model bandwidth capacity constra<strong>in</strong>ts. The capacity constra<strong>in</strong>tsreflect the fact that, from the perspective of a s<strong>in</strong>gle node, traffic<strong>in</strong>cludes data that the nodes orig<strong>in</strong>ate and forward, as well as trafficthey receive and is of no <strong>in</strong>terest to them. This last class of traffic isunavoidable due to the transmission radius of near<strong>by</strong> stations. Underthe assumption that the MAC protocol behaves <strong>in</strong> an ideal fashion, weconsider two centralized algorithms that attempt to admit the given loadand we remark on their relative performance, especially with respect totheir energy consumption and block<strong>in</strong>g (connection rejection) rate.1 IntroductionApart from elim<strong>in</strong>at<strong>in</strong>g the need for a pre-exist<strong>in</strong>g <strong>in</strong>frastructure, a serious motivationbeh<strong>in</strong>d the deployment of wireless networks is the ability to establishconnectivity among, hopefully, unrestricted number of wireless nodes. Naturally,the extent to which this is doable has to do with the volume of carried trafficand the extent to which the radio spectrum is wisely reused among all participat<strong>in</strong>gnodes. While a sufficiently <strong>in</strong>tense traffic load can render any network<strong>in</strong>adequate, the idea of proper reuse of the radio spectrum <strong>in</strong> light of compet<strong>in</strong>gnodes is not at all solved. In fact, there have been studies, such as the one <strong>in</strong> [1]suggest<strong>in</strong>g that wireless ad hoc networks are, <strong>in</strong> pr<strong>in</strong>ciple, not scalable. That is,the foreseen benefit of spatial reuse of the radio spectrum produces dim<strong>in</strong>ish<strong>in</strong>greturns. The rate at which bandwidth reuse <strong>in</strong>creases with <strong>in</strong>creas<strong>in</strong>g numberof nodes cannot catch up with the <strong>in</strong>creas<strong>in</strong>g load demands that the additionalnodes place on the network.The broadcast wireless advantage, furthermore <strong>in</strong> [2], illustrates the propertyof manipulate the transmission range. Increas<strong>in</strong>g the transmission powercan reach more neighbors while it decreases the spatial reuse and <strong>in</strong>crease theS. Pierre, M. Barbeau, and E. Kranakis (Eds.): ADHOC-NOW 2003, LNCS <strong>2865</strong>, pp. 211–222, 2003.c○ Spr<strong>in</strong>ger-Verlag Berl<strong>in</strong> Heidelberg 2003

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!