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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

On the Interaction of Bandwidth Constra<strong>in</strong>ts and Energy Efficiency 219Fraction of Infeasible Solutions10.90.80.70.60.50.40.30.20.10N=10N=20N=30N=500 0.5 1 1.5 2Relative loadFig. 2. Percentage of <strong>in</strong>feasible solution correspond<strong>in</strong>g to Fig. 1.that the transmissions will congest other nodes, and hence it restricts paths frombe<strong>in</strong>g available. The unavailability of a path therefore has a direct impact on theability of conserve energy <strong>by</strong> us<strong>in</strong>g it as a relay.Apply<strong>in</strong>g the Successive M<strong>in</strong>imum Energy Paths construction, we f<strong>in</strong>d thatit is highly unlikely to obta<strong>in</strong> the optimal solution (or even a solution when thetraffic demand is high) for this multiple source-dest<strong>in</strong>ation demands and energyconsumption optimization problem. Our experiments were also run with differentorder for path construction, such as <strong>in</strong>creas<strong>in</strong>g traffic demands or decreas<strong>in</strong>gtraffic demands for the source-dest<strong>in</strong>ation pairs, but the results are similar tothe ones reported here. The Successive M<strong>in</strong>imum Energy Paths algorithm constructsone path at a time us<strong>in</strong>g the shortest path algorithm us<strong>in</strong>g the energycost matrix. Each path construction achieves the m<strong>in</strong>imum energy consumptionrequirement of a particular path. However, <strong>in</strong> the Successive M<strong>in</strong>imum EnergyPaths algorithm, the bandwidth reservation is performed <strong>by</strong> ignor<strong>in</strong>g the alreadyallocated source-dest<strong>in</strong>ation pairs.Furthermore, we observe that <strong>in</strong> order to m<strong>in</strong>imize the energy consumption,the path construction process will likely end up with a longer path. Assume Sis the source node and D is the dest<strong>in</strong>ation node. An additional node R caneither act a relay transmission such that the path is from S to R and fromR to D or sitt<strong>in</strong>g there overhear<strong>in</strong>g it. The distance between a node pair isdenoted d i,j , and the energy usage is (d i,j ) α , where α is correspond<strong>in</strong>g to theloss exponent (2 ≤ α ≤ 4). Assume d S,D is equal to 5 units of distance; d S,R andd S,D are equal to 3 units. With the energy as the cost matrix, s<strong>in</strong>ce (d S,D ) α ≥(d S,R ) α +(d R,D ) α , R will not act as an relay, and therefore D will <strong>in</strong>crease the

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

Saved successfully!

Ooh no, something went wrong!