Abstract
In wireless networks, interferences from adjacent nodes that are concurrently transmitting can cause packet reception failures and thus result in significant throughput degradation. The interference can be simply avoided by assigning different orthogonal channel to each interfering node. However, if the number of orthogonal channels is smaller than that of adjacent nodes, this simple channel assignment method does not work. In this paper, we propose a vertex coloring based power control algorithm for wireless networks with a limited number of channels. In order to maintain high data transmission rate between two nodes, the transmission power is increased as long as different orthogonal channel is assigned to each adjacent node. We show that the proposed algorithm significantly improves the network throughput performance for various wireless network topologies with different number o f orthogonal channels.
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
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. The Macmillan Press Ltd., Great Britain (1976)
Kim, G., Li, Q., Negi, R.: A Graph-based Algorithm for Scheduling with Sum-Interference in Wireless Networks. In: IEEE GLOBECOM (2007)
Cardieri, P.: Modeling Interference in Wireless Ad Hoc Networks. IEEE Communications Surveys and Tutorials 12, 551–572 (2010)
Gore, A.D., Karandikar, A., Jagabathula, S.: On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks. In: IEEE GLOBECOM (2007)
Bianchi, G.: Perfomance Analysis of the IEEE 802. 11 Distributed Coordination Function. IEEE Journal on Selected Areas in Communications 18, 535–547 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burton Mwamila, A., Hwang, J., Ha, T., Lim, H. (2012). Power Control for Wireless Networks with a Limited Number of Channels. In: Bellalta, B., et al. Multiple Access Communications. MACOM 2012. Lecture Notes in Computer Science, vol 7642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34976-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-34976-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34975-1
Online ISBN: 978-3-642-34976-8
eBook Packages: Computer ScienceComputer Science (R0)