Abstract
In Chapter 3, the problem was to design a distributed scheduling algorithm to keep up with fixed arrival rates when the transmissions are single hop. In this chapter, we study the combined admission control, routing, and scheduling problem in a multi-hop network. That is, the arrival rates are not given ahead of time. Instead, the nodes exercise some admission control. Moreover, packets may have to go across a number of hops from their source to their destination. Finally, the routing is not fixed. The nodes choose where to send their packets. The objective is to maximize the total utility of the flows of packets across the network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Jiang, L., Walrand, J. (2010). Utility Maximization in Wireless Networks. In: Scheduling and Congestion Control for Wireless and Processing Networks. Synthesis Lectures on Learning, Networks, and Algorithms. Springer, Cham. https://doi.org/10.1007/978-3-031-79992-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-79992-1_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-79991-4
Online ISBN: 978-3-031-79992-1
eBook Packages: Synthesis Collection of Technology (R0)eBColl Synthesis Collection 3