Abstract
In this chapter, we consider the scheduling of wireless nodes, assuming perfect CSMA and no hidden nodes, as we did in Chapter 2. The arrival rates are fixed and each packet reaches its intended receiver in one hop. We model the interference between links by a conflict graph. The objective is to design a distributed scheduling protocol to keep up with the arrivals.
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). Scheduling 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-79992-1_3
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