Abstract
The availability of multiple orthogonal channels in a wireless network can lead to substantial performance improvement by alleviating contention and interference. However, this also gives rise to non-trivial channel coordination issues. The situation is exacerbated by variability in the achievable data-rates across channels and links. Thus, scheduling in such networks may require substantial information-exchange and lead to non-negligible overhead. This provides a strong motivation for the study of scheduling algorithms that can operate with limited information while still providing acceptable worst-case performance guarantees. In this paper, we make an effort in this direction by examining the scheduling implications of multiple channels and heterogeneity in channel-rates. We establish lower bounds on the performance of a class of maximal schedulers. We first demonstrate that when the underlying scheduling mechanism is “imperfect”, the presence of multiple orthogonal channels can help alleviate the detrimental impact of the imperfect scheduler, and yield a significantly better efficiency-ratio in a wide range of network topologies. We then establish performance bounds for a scheduler that can achieve a good efficiency-ratio in the presence of channels with heterogeneous rates without requiring explicit exchange of queue-information. Our results indicate that it may be possible to achieve a desirable trade-off between performance and information.
This research was supported in part by NSF grant CNS 06-27074, US Army Research Office grant W911NF-05-1-0246, and a Vodafone Graduate Fellowship.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhandari, V.: Performance of wireless networks subject to constraints and failures. Ph.D. Thesis, UIUC (2008)
Georgiadis, L., Neely, M.J., Tassiulas, L.: Resource allocation and cross-layer control in wireless networks. Found. Trends Netw. 1(1), 1–144 (2006)
Joo, C., Shroff, N.B.: Performance of random access scheduling schemes in multi-hop wireless networks. In: Proceedings of IEEE INFOCOM, pp. 19–27 (2007)
Lin, X., Rasool, S.: A Distributed Joint Channel-Assignment, Scheduling and Routing Algorithm for Multi-Channel Ad-hoc Wireless Networks. In: Proceedings of IEEE INFOCOM, May 2007, pp. 1118–1126 (2007)
Lin, X., Shroff, N.B.: The impact of imperfect scheduling on cross-layer rate control in wireless networks. In: Proceedings of IEEE INFOCOM, pp. 1804–1814 (2005)
Neely, M.J., Modiano, E., Rohrs, C.E.: Dynamic power allocation and routing for time varying wireless networks. In: Proceedings of IEEE INFOCOM (2003)
Sharma, G., Mazumdar, R.R., Shroff, N.B.: On the complexity of scheduling in wireless networks. In: MobiCom 2006: Proceedings of the 12th annual international conference on Mobile computing and networking, pp. 227–238. ACM Press, New York (2006)
Tassiulas, L., Ephremides, A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control 37(12), 1936–1948 (1992)
Wu, X., Srikant, R.: Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks. In: Proceedings of IEEE INFOCOM (2006)
Wu, X., Srikant, R., Perkins, J.R.: Queue-length stability of maximal greedy schedules in wireless networks. In: Workshop on Information Theory and Applications (2006)
Wu, X., Srikant, R., Perkins, J.R.: Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks. IEEE Trans. Mob. Comput. 6(6), 595–605 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhandari, V., Vaidya, N.H. (2010). Scheduling in Multi-Channel Wireless Networks. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds) Distributed Computing and Networking. ICDCN 2010. Lecture Notes in Computer Science, vol 5935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11322-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-11322-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11321-5
Online ISBN: 978-3-642-11322-2
eBook Packages: Computer ScienceComputer Science (R0)