Article

Free access

An optimization method for the channel assignment in mixed environments

Author:

Ewa MalesińskaAuthors Info & Claims

MobiCom '95: Proceedings of the 1st annual international conference on Mobile computing and networking

Pages 210 - 217

https://doi.org/10.1145/215530.215576

Published: 01 December 1995 Publication History

PDF eReader

References

[1]

M. Bir6, M. Hujter, 2s. Tuza. Precoloring extensions. 1. Interval graphs. Discrete Mad 100 (1992), 267-279.

Digital Library

Google Scholar

[2]

H. Bodlaendcr. A linear time algorithm for findingtreedecomposition of small treewidth. Proc. of rhe 25th Annual ACM Symp. on Theory of Comp. (1993), 226- 234.

Digital Library

Google Scholar

[3]

A. Brandstadt. Graphen und Algorithmen. B. Cl. Teubner Stuttgart, 1994.

Crossref

Google Scholar

[4]

J. Chuang, N. Sollenberger. Performance of Autonomous Dynamic Channel Assignment and Power Control for TDMA/FDMA Wireless Access. IEEE 44rh Vehicular Technology Conference (I 994). 794-798.

Google Scholar

[5]

G. Dahl, K. Jomsten, G. LBvnes, S. Svaet. Graph optimization problems in connection with the management of mobile communication systems. Telecommunicafions Sysrems, Vol. 3 (1994), 3 19-340.

Google Scholar

[6]

D. Dimittijevic, J. VuEetic. Design and Performance Analysis of the Algorithms for Channel Allocation in Cellular Networks. IEEE Transactions on Vehicufar Technology, Vol. 42 (1993). 526-534.

Google Scholar

[7]

A. Gamst. A Resource Allocation Technique for FDMA Systems. Aha Frequenza, Vol. LVII - N. 2, (Feb.-March 1988), 89-96.

Google Scholar

[8]

M.R. Garey, D.S. Johnson. Computers and Inrracrabiliry A Guide IO the Theory of NP-Completeness. W.H. Freeman, New York, 1979.

Digital Library

Google Scholar

[9]

M. Grevel, A. Sachs. A Graph Theoretical Analysis of Dynamic Channel Assignment Algorithms for Mobile Radiocommunication Systems. Siemens Forsch.- u. Enfwickk-Ber., Bd.12 (1983). 298-305.

Google Scholar

[10]

J.E. Hopcroft, R.M. Karp. An r?/~ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2 (1973), 225-231.

Crossref

Google Scholar

[11]

K. Jansen, P. Scheffler. Generalized coloring for treelike graphs. Proceedings of rhe WG~92, Lect. Notes Comput. Sci. 657 (1993). 50-59.

Digital Library

Google Scholar

[12]

T. Jensen, B. Toft. Graph Coloring Problems. John Wiley & Sons, Inc., 1995.

Google Scholar

[13]

D. Kunz. Channel Assignment for Cellular Radio Using Neural Networks. IEEE Transactions on Vehicular Technology, Vol. 40 (1991). 188-193.

Google Scholar

[14]

D.W. Matula, L.L. Beck. Smallest-Last Ordering and Clustering and Graph Coloring Algorithms. JACM 01.30, (1983). 417-427.

Digital Library

Google Scholar

[15]

Ch.H. Papadimitriou, K. Steiglitz. Combinatorial Oprimizarion: Algorithms and Complexity. Prentice-Hall, Inc. Englewood Cliffs, New Jersey 1982.

Digital Library

Google Scholar

[16]

J. Plehn. Applied frequency assignment. IEEE44th Vehicular Technology Conference (1994), 853-857.

Crossref

Google Scholar

[17]

M. Zhang, T.S. Yum. Comparison of Channel Assignment Strategies in Cellular Mobile Telephone Systems. IEEE Transactions on Vehicular Technology, vol. 38 (1989). 21 l-215.

Google Scholar

[18]

A.A. Zykov. On Some Properties of Linear Complexes (Russian).Marh. Sb. N. S. vol.24 (1949). 163-188. (English transl.: Amer Marh. Sot. Transl., Vol. 79, 1952.)

Google Scholar

Cited By

View all

Garg NPapatriantafilou MTsigas P(2018)Distributed long-lived list colouringWireless Networks10.1023/A:10127195251088:1(49-60)Online publication date: 28-Dec-2018
https://dl.acm.org/doi/10.1023/A%3A1012719525108
Cheng MHuang SHuang XWu W(2005)New graph model for channel assignment in ad hoc wireless networksIEE Proceedings - Communications10.1049/ip-com:20059053152:6(1039)Online publication date: 2005
https://doi.org/10.1049/ip-com:20059053
Pantziou GPentaris GSpirakis P(2005)Competitive call control in mobile networksAlgorithms and Computation10.1007/3-540-63890-3_43(404-413)Online publication date: 29-Jul-2005
https://doi.org/10.1007/3-540-63890-3_43
Show More Cited By

Index Terms

An optimization method for the channel assignment in mixed environments

Recommendations

Blind channel equalization via multiobjective optimization
SSAP '96: Proceedings of the 8th IEEE Signal Processing Workshop on Statistical Signal and Array Processing (SSAP '96)

Blind equalisation has the potential to improve the efficiency of communication systems by eliminating training signals. Difficulties of its application in wireless communications, however, are due largely to the characteristics of the propagation media-...
Ant colony optimization for satellite customer assignment
ICUCT'06: Proceedings of the 1st international conference on Ubiquitous convergence technology

This paper considers the meta-heuristic method of ant colony optimization to the problem of assigning customers to satellite channels. It is shown in an earlier study that finding an optimal allocation of customers to satellite channels is a difficult ...
Throughput Improvement with Discrete Pilot Signal Assignment and Iterative Channel Identification for MQRD-PCM/OFDM

In MIMO systems, the channel identification is important to distinguish transmitted signals from multiple transmit antennas. One of the most typical channel identification schemes is to employ a code division multiplexing (CDM) based scheme in which a ...

Comments

Information & Contributors

Information

Published In

MobiCom '95: Proceedings of the 1st annual international conference on Mobile computing and networking

December 1995

236 pages

ISBN:0897918142

DOI:10.1145/215530

Conference Chairs:
Baruch Awerbuch
John Hopkins University, Baltimore, MD
,
Dan Duchamp
AT&T Research, Florham Park, NJ

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

MobiCom95

Sponsor:

MobiCom95: ACM International Conference on Mobile Computing and Networking

November 13 - 15, 1995

California, Berkeley, USA

Acceptance Rates

MobiCom '95 Paper Acceptance Rate 20 of 79 submissions, 25%;

Overall Acceptance Rate 440 of 2,972 submissions, 15%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
502
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)8

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Garg NPapatriantafilou MTsigas P(2018)Distributed long-lived list colouringWireless Networks10.1023/A:10127195251088:1(49-60)Online publication date: 28-Dec-2018
https://dl.acm.org/doi/10.1023/A%3A1012719525108
Cheng MHuang SHuang XWu W(2005)New graph model for channel assignment in ad hoc wireless networksIEE Proceedings - Communications10.1049/ip-com:20059053152:6(1039)Online publication date: 2005
https://doi.org/10.1049/ip-com:20059053
Pantziou GPentaris GSpirakis P(2005)Competitive call control in mobile networksAlgorithms and Computation10.1007/3-540-63890-3_43(404-413)Online publication date: 29-Jul-2005
https://doi.org/10.1007/3-540-63890-3_43
Malesińska EPanconesi A(2005)On the hardness of allocating frequencies for hybrid networksGraph-Theoretic Concepts in Computer Science10.1007/3-540-62559-3_25(308-322)Online publication date: 3-Jun-2005
https://doi.org/10.1007/3-540-62559-3_25
Narayanan L(2002)Channel assignment and graph multicoloringHandbook of wireless networks and mobile computing10.5555/512321.512325(71-94)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.5555/512321.512325
Garg NPapatriantafilou MTsigas P(1996)Distributed list coloring: how to dynamically allocate frequencies to mobile base stationsProceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing10.1109/SPDP.1996.570312(18-25)Online publication date: 1996
https://doi.org/10.1109/SPDP.1996.570312

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Blind channel equalization via multiobjective optimization

Ant colony optimization for satellite customer assignment

Throughput Improvement with Discrete Pilot Signal Assignment and Iterative Channel Identification for MQRD-PCM/OFDM

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Blind channel equalization via multiobjective optimization

Ant colony optimization for satellite customer assignment

Throughput Improvement with Discrete Pilot Signal Assignment and Iterative Channel Identification for MQRD-PCM/OFDM

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations