System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Optimal scheduling of real-time messages in peer-to-peer wireless networks

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
$31 $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

3 Author(s)
Jaramillo, J.J. ; Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA ; Shihuan Liu ; Lei Ying

This paper studies the problem of service allocation and scheduling of real-time messages in peer-to-peer wireless networks. Using stochastic network theory and optimization we propose a model that allows us to design a dynamic service allocation algorithm that maximizes the total network utility while meeting deadline constraints, by appealing to connections between Lagrange multipliers and deficits in service. The model allows for general interference constraints and arrival models. Using simulations we compare our algorithm against an optimal solution proposed for scheduling persistent real-time traffic and show the limitations of that approach to handle real-time messages for providing fairness.

Published in:

Signals, Systems and Computers (ASILOMAR), 2011 Conference Record of the Forty Fifth Asilomar Conference on

Date of Conference:

6-9 Nov. 2011