The Application of 3-Colour Theorem and 4-Colour Theorem in the Problem of Repeaters’ Site Selection

Article Preview

Abstract:

In wireless networks, implementing repeaters can improve network capacity and CCTSS systems can be used to mitigate interference. This paper discussed the selection of covering shapes in a given area, and presented an optimum scheme of channel assignment and PL allocation. Meanwhile, the 3-colour theorem and 4-colour theorem in graph theory will be given. At last, we introduce the application of 3-colour theorem and 4-colour theorem in the problem of repeaters’ site selection. By the relevant calculation, we can prove the application is reasonable.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1106-1115

Citation:

Online since:

November 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Krzysztof Wesołowski, Mobile communication systems, Poland: John Wiley&Sons, Ltd. (2001).

Google Scholar

[2] Asrar U. H. Sheikh, Wireless communications: theory and techniques,., vol. 2. United States of America: Kluwer Academic Publishers. (2004).

Google Scholar

[3] V.S. Bagad, Wireless Communication, Indian: Technical Publications Pune., 1963, p.221–253. (2009).

Google Scholar

[4] Er. Vikrant Vij, Wireless Communication, Newnes: University Science Press. (2010).

Google Scholar

[5] Rappaport, Wireless Communications Principles And Practice, 2rd: Pearson Education. (2009).

Google Scholar

[6] Peter J.M. van Laarhoven, Simulated Annealing: Theory and Applications, Netherlands: Kuwer Academic Publishers. (1987).

Google Scholar

[7] Proakis J, Digital communications., 3rd. New York: McGraw-Hill,. (1995).

Google Scholar

[8] Andrea Goldsmith, Wireless Communications., Cambridge UniversityPress. (2005).

Google Scholar

[9] K. Appel, W. Haken, Every planar map is four colorable., Part I. Discharging, Illinois J. Math. 21 429_490Article in a conference proceedings. (1977).

DOI: 10.1215/ijm/1256049011

Google Scholar

[10] H. Grötzsch, Ein dreifarbensatz für dreikreisfreie netze auf der kugel, Math. -Nat. Reihe 8 109_120. (1959).

Google Scholar

[11] M.R. Garey, D.S. Johnson, L.J. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 237_267. (1976).

DOI: 10.1016/0304-3975(76)90059-1

Google Scholar

[12] R. Steinberg, The state of the three color problem, in: Quo Vadis, Graph Theory?, Ann. Discrete Math. 55 211_248. (1993).

DOI: 10.1016/s0167-5060(08)70391-1

Google Scholar