By Topic

Power Optimal Control in Multihop Wireless Networks With Finite Buffers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dongyue Xue ; Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA ; Eylem Ekici

In this paper, we propose two cross-layer algorithms, namely, the Power-optimal Scheduling Algorithm (PSA) and the Throughput-optimal Scheduling Algorithm (TSA), to minimize energy consumption and to maximize throughput, respectively, in multihop wireless networks. Our algorithms guarantee a flow-based minimum data rate and jointly integrate congestion control, power allocation, routing, and link rate scheduling. Different from traditional algorithms that assume infinite buffers, the proposed algorithms deterministically upper bound the flow-based packet queue length and thus can be employed in multihop networks with finite buffers. In addition, the algorithms achieve a power expenditure/throughput “ε-close” to the optimal value, with a tradeoff of order O(1/ε) in buffer size. The average end-to-end delay upper bound can also be derived from the finite buffer property. Finally, numerical results are presented to show the performance of the two algorithms with different system parameters.

Published in:

IEEE Transactions on Vehicular Technology  (Volume:62 ,  Issue: 3 )