Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks
The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communication. We address the problem of assigning channels to communication links in the network with the objective of minimizing overall network interference. Since the number of radios on any node can be less than the number of available channels, the channel assignment must obey the constraint that the number of different channels assigned to the links incident on any node is atmost the number of radio interfaces on that node. The above optimization problem is known to be NP-hard. We design centralized and distributed algorithms for the above channel assignment problem. To evaluate the quality of the solutions obtained by our algorithms, we develop a semidefinite program formulation of our optimization problem to obtain a lower bound on overall network interference. Empirical evaluations on randomly generated network graphs show that our algorithms perform close to the above established lower bound, with the difference diminishing rapidly with increase in number of radios. Also, detailed ns-2 simulation studies demonstrate the performance potential of our channel assignment algorithms in 802.11-based multi-radio mesh networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
Wireless mesh networks: a survey
Akyildiz, I. F., Wang, X., & Wang, W. (2005) · Computer Networks · doi:10.1016/j.comnet.2004.12.001 · Cited by 4,007
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587 · cited 2×
“The reader is referred to [3, 12 ] for further details on semidefinite programming and its application to combinatorial optimization.”
BackgroundMethodGeometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Alizadeh, F. (1995) · SIAM Journal on Optimization · doi:10.1137/0805002 · Cited by 892
Bahl, P., Chandra, R., & Dunagan, J. (2004) · Proceedings of the 10th annual international conference on Mobile computing and networking · doi:10.1145/1023720.1023742 · Cited by 863
A multi-radio unification protocol for IEEE 802.11 wireless networks
Adya, A., Bahl, P., Padhye, J., Wolman, A., & Zhou, L. (2004) · First International Conference on Broadband Networks · doi:10.1109/broadnets.2004.8 · Cited by 701
Using tabu search techniques for graph coloring
Hertz, A., & de Werra, D. (1987) · Computing · doi:10.1007/bf02239976 · Cited by 657
Capacity of multi-channel wireless networks
Kyasanur, P., & Vaidya, N. H. (2005) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/1080829.1080835 · Cited by 528
Improved approximation algorithms for MAXk-CUT and MAX BISECTION
Frieze, A., & Jerrum, M. (1997) · Algorithmica · doi:10.1007/bf02523688 · Cited by 406
Alicherry, M., Bhatia, R., & Li, L. E. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.881641 · Cited by 384
Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
Benson, S. J., Ye, Y., & Zhang, X. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497328008 · Cited by 276
On the Hardness of Approximating Max k-Cut and Its Dual
Kann, V., Khanna, S., Lagergren, J., & Panconesi, A. (1997) · Cited by 80
Metadata
- Authors
- Subramanian, A. P., Gupta, H., & Das, S. R.
- Venue
- 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks
- Publisher
- IEEE
- Published
- 2007-06
- Pages
- 481-490
- OpenAlex
- W2151392965
- Cited by
- 267
- References
- 13
- FWCI
- 29.24
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.