Perturbative time and frequency allocations for RFID reader networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4097 LNCS, Issue , 2006, Pages 392-402

  Deolalikar, Vinay ^a   Mesarina, Malena ^a   Recker, John ^a   Pradhan, Salil ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER NETWORKS; COMPUTER SCIENCE; CONSTRAINT THEORY; FREQUENCY ALLOCATION; PERTURBATION TECHNIQUES; TELECOMMUNICATION NETWORKS; UBIQUITOUS COMPUTING;

RADIO FREQUENCY IDENTIFICATION (RFID); RFID READER NETWORKS; TIME ALLOCATIONS; TIME CONSTRAINED REGIMES; RFID READERS;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FREQUENCY ALLOCATION;

EID: 33749413222     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11807964_40     Document Type: Conference Paper

References (13)

1. R. Brooks, On colouring the nodes of a network. Proc. Cambridge Philos. Soc. 37 (1941) pp. 194-197.
2. V. Deolalikar, M. Mesarina, J. Recker, and S. Pradhan, Optimal switching strategies for active sensor networks, USN 2005, LNCS 3823, pp.1025-1035.
3. C. Edwards, "Some extremal properties of bipartite subgraphs," Canad. J. Math. 3 (1973), pp. 475-485.
4. D. Engels, The Reader Collision Problem, Technical Report, available at http://www.autoidcenter.org/research/MIT-AUTOID-WH-007.pdf
5. P. Erdös, "On some extremal problems in graph theory," Israel J. Math. 3 (1965), pp. 113-116.
6. P. Erdos, "Graph Theory and Probability - II." Canad. J. Math. 13 (1961), pp. 346-352.
7. P. Erdös, R. Faudree, J. Pach, and J. Spencer, How to make a graph bipartite, J. Comb. Theory (B) 45 (1988), pp. 86-98.
8. M. Goemans and D. Williamson, "Primal-Dual approximation technique for constrained forest problems," SIAM J. Computing 24 (1995), pp. 296-317.
9. F. Hadlock, "Finding a maximum cut of a planar graph in polynomial time," SIAM J. Computing 4(3) 1975, pp. 221-225.
10. F. Harary, Graph Theory, Addison-Wesley, 1969.
11. Ewa Malesinska. Graph-Theoretical Models for Frequency Assignment Problems. Ph.D. thesis, Technischen Universitt Berlin, 1997.
12. J. Shearer, "A note on bipartite subgraphs of triangle-free graphs," Random Structures and Algorithms 3 (1992), pp. 223-226.
13. Waldrop, J., Engels, D.W., Sarma, S.E., "Colorwave: An Anticollision Algorithm for the Reader Collision Problem", Communications, 2003. ICC'03. IEEE International Conference on Volume 2, 11-15 May 2003 Page(s):1206-1210 vol.2.