Abstract
This paper presents graph coloring algorithms and their applications to the channel assignment problems. Two application problems of frequency assignment of low power FM broadcasting and reader collision problem of RFID system are modeled as graph coloring problems. Instead of performing an exhaustive search for the optimal result, we provide both search space reduction and variable ordering heuristics to obtain good approximate solutions. Constraint optimization modeling and variable ordering enforce the backtracking process in graph coloring algorithms, so the search space is greatly reduced and the approximate solution is found quickly. A great deal of outstanding work on graph coloring algorithms is described and applied to the simulation results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hale WK (1980) Frequency assignment: theory and applications. In: Proceedings of the IEEE, vol 68, pp 1497–1514
Giortzis AI, Turner LF (1997) Application of mathematical programming to the fixed channel assignment problem in mobile radio networks. In: IEEE Proceedings of Communication, vol 144, pp. 257–264
Carlsson M, Grindal M (1993) Automatic frequency assignment for cellular telephone using constraint satisfaction techniques. In: Proceedings of the tenth international conference on logic programming, pp 647–665
Walsher JP (1996) Feasible cellular frequency assignment using constraint programming abstractions. In: Proceedings of the workshop on constraint programming applications, Cambridge
Skiena S (1998) The Algorithm Design Manual, Springer, New York
Br′elaz D (1979) New methods to color the vertices of a graph. Commun ACM 22(4):251–256
Achlioptas D, Naor A (2005) The two possible values of the chromatic number of a random graph. Ann Math 162(3):1333–1349
Sohn S, Jo GS (2006) Solving a constraint satisfaction problem for frequency assignment in low power FM broadcasting. Lect Notes Artif Intell 4304:739–748
Zhou S, Luo Z, Wong E, Tan CJ, Luo J (2007) Interconnected RFID reader collision model and its application in reader anti-collision. In: Proceeding of the 2007 IEEE international conference on RFID, pp 212–219
Engels DW, Sarma SE (2002) The reader collision problem. In: Proceedings of the 2002 IEEE international conference on systems, man and cybernetics, pp 92–97
Sayeed SK, Kim YS, Yang H, Yook JG (2011) A solution to the RFID reader interference problem using adaptive beam-forming approach. IETE Tech Rev 28(1):17–28
Song I, Hong S, Chang (2009) An improved reader Anti-collision algorithm based on pulse protocol with slot occupied probability in dense reader mode. In: Proceeding of the IEEE 69th vehicular technology conference, pp 1–5
Yu J, Lee W (2008) GENTLE: reducing reader collision in mobile RFID networks. In: Proceeding of the 4th international conference on mobile Ad-hoc and sensor networks, pp 280–287
Tian J, Fan Y, Zhu Y, Hu K (2008) RFID reader anti-collision using chaos neural network based on annealing strategy. In: Proceeding of the world congress on intelligent control and automation, pp. 6128–6132
Golomb SW, Baumert LD (1965) Backtrack programming. J ACM 12(4):516–524
Haralick RM, Elliott GL (1980) Increasing tree search efficiency for constraint satisfaction problems. Artif Intell 14(3):263–313
Freuder EC (1982) A sufficient condition for backtrack-free search. J ACM 29(1):24–32
Bessi`ere C, R′egin J-C (1996) MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. Lect Notes Comput Sci 1118:61–75
Boussemart F, Hemery F, Lecoutre C Sais L (2004) Boosting systematic search by weighting constraints. In: Proceeding of the ECAI, pp 146–150
Acknowledgments
This research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education, Science and Technology (KRF-2008-313- D00954)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Sohn, S. (2013). Graph Coloring Algorithms and Applications to the Channel Assignment Problems. In: Kim, K., Chung, KY. (eds) IT Convergence and Security 2012. Lecture Notes in Electrical Engineering, vol 215. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-5860-5_44
Download citation
DOI: https://doi.org/10.1007/978-94-007-5860-5_44
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-5859-9
Online ISBN: 978-94-007-5860-5
eBook Packages: EngineeringEngineering (R0)