The reader collision problem

Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

Volumn 3, Issue , 2002, Pages 641-646

  Engels, Daniel W ^a   Sarma, Sanjay E ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Frequency assignment; RFID systems; Scheduling

Indexed keywords

FREQUENCY ALLOCATION; GRAPH THEORY; PROBLEM SOLVING; RADIO COMMUNICATION;

RADIO FREQUENCY IDENTIFICATION (RFID);

RADIO INTERFERENCE;

EID: 0038007814     PISSN: 08843627     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. M.B. Cozzens and F.S. Roberts. T-colorings of graphs and the channel assignment problem. Congressus Numerantium, 35:191-208, 1982.
2. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
3. W.K. Hale. Frequency assignment: Theory and applications. Proceedings of the IEEE, 68(12): 1497-1514, 1980.
4. Tommy R. Jensen and Bjarne Toft. Graph Coloring Problems. Wiley-Interscience Publication, John Wiley & Sons, 1995.
5. I. Katzela and M. Naghshineh. Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey. IEEE Personal Communications, pages 10-31, June 1996.
6. L. Lov'asz. A characterization of perfect graphs. Journal of Combinatorial Theory, Ser. B 13:95-98, 1972.
7. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. In Proceedings 25th Annual ACM Symposium on the Theory of Computing, pages 286-293, 1993.
8. Ewa Malesinska. Graph-Theoretical Models for frequency Assignment Problems. PhD thesis, Technischen Universitat Berlin, 1997.
9. B.H. Metzger. Spectrum management techniques. In 38th National ORSA Meeting, Detroit, MI, Fall 1970.
10. Michel Daoud Yacoub. Foundations of Mobile Radio Engineering. CRC Press, Inc., 1993.
11. J.A. Zoellner. Frequency assignment games and strategies. IEEE Transactions on Electromagnetic Compatibility, EMC-15: 191-196, 1973.