Perturbative Time and Frequency Allocations for RFID Reader Networks
RFID reader networks often have to operate in frequency and time constrained regimes. One approach to the allocation of frequency and time to various readers in such regimes is to perturb the network slightly so as to ease the constraints. We investigate how to perform these perturbations in a manner that is profitable from time and frequency allocation point of view.
KeywordsSchedule Problem Bipartite Graph Planar Graph Chromatic Number Bipartite Network
- 4.Engels, D.: The Reader Collision Problem, Technical Report, Available at: http://www.autoidcenter.org/research/MIT-AUTOID-WH-007.pdf
- 10.Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)Google Scholar
- 11.Malesinska, E.: Graph-Theoretical Models for Frequency Assignment Problems. Ph.D. thesis, Technischen Universität Berlin (1997)Google Scholar
- 13.Waldrop, J., Engels, D.W., Sarma, S.E.: Colorwave: An Anticollision Algorithm for the Reader Collision Problem. IEEE International Conference Communications ICC 2003, May 11-15, vol. 2, pp. 1206–1210 (2003)Google Scholar