Batch conflict resolution algorithm with progressively accurate multiplicity estimation

Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC'04

Volumn , Issue , 2004, Pages 31-40

  Popovski, Petar ^a   Fitzek, Frank H P ^a   Prasad, Ramjee ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

Conflict resolution; Multiplicity estimation; Probing; Sensor inquiry; Splitting tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MARKOV PROCESSES; MATHEMATICAL MODELS; SENSORS; STATISTICAL METHODS; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

CONFLICT RESOLUTION; MULTIPLICITY ESTIMATION; PROBING; SENSOR INQUIRY; SPLITTING TREE;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 14844300157     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1022630.1022636     Document Type: Conference Paper

References (16)

1. I. Chlamtac, M. Conti, and J. Liu, "Mobile ad hoc networking: Imperatives and challenges," Ad Hoc Network Journal, vol. 1, no. 1, Jan. 2003.
2. I. F. Akylidiz, W. Su, Y. Sankarasubramaniam, and E. Cayrici, "A survey on sensor networks," IEEE Commun. Mag., vol. 40, no. 8, pp. 102-116, Aug. 2002.
3. D. R. Hush and C. Wood, "Analysis of tree algorithms for RFID arbitration," in Proc. IEEE International Symposium on Information Theory, Boston, USA, Aug. 1998.
4. I. Cidon and M. Sidi, "Conflict multiplicity estimation and batch resolution algorithms," IEEE Trans. Inform. Theory, vol. IT-34, pp. 101-110, Jan. 1988.
5. J. F. Hayes, "An adaptive technique for local distribution," IEEE Trans. Commun., vol. 26, pp. 1178-1186, Aug. 1978.
6. J. I. Capetanakis, "Tree algorithms for packet broadcast channels," IEEE Trans. Inform. Theory, vol. IT-25, pp. 505-515, Sept. 1979.
7. B. S. Tsybakov and V. A. Mikhailov, "Free synchronous packet access in broadcast channel with feedback," Probl. Peredach. Inform., vol. 14, no. 4, pp. 32-59, Oct. 1978.
8. R. G. Gallager, "Conflict resolution in random access broadcast networks," in Proc. AFOSR Workshop Commun. Theory Appl., Provincetown, MA, Sept. 1978, pp. 74-76.
9. P. F. A. G. Greenberg and R. E. Ladner, "Estimating the multiplicities of conflict to speed their resolution in multiple access channels," J. ACM, vol. 34, no. 2, pp. 289-325, Apr. 1987.
10. J. L. Massey, Collision-Resolution Algorithms and Random-Access Communications, ser. CISM Courses and Lectures. Springer-Verlag, 1981, no. 265, pp. 73-137.
11. N. D. Vvedenskaya and M. S. Pinsker, "Non-optimality of the Part-and-Try algorithm," in Abstracts Intl. Workshop Conv. Codes, Multiuser Comm., Sochi, USSR, 1983, pp. 141-148.
12. J. Mosely and P. Humblet, "A class of efficient contention resolution algorithms for multiple access channels," IEEE Trans. Commun., vol. COM-33, no. 2, pp. 145-151, 1985.
13. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge UK and New York: Cambridge University Press, 1995.
14. D. Berstekas and R. Gallager, Data Networks, 2nd ed. New Jersey: Prentice-Hall, 1992.
15. R. Rom and M. Sidi, Multiple Access Protocols: Performance and Analysis. New York: Springer-Verlag, 1990.
16. Y. C. Tay, K. Jamieson, and H. Balakrishnan, "Collision-minimizing CSMA and its applications to wireless sensor networks," IEEE J. Select. Areas Commun., vol. 22, no. 6, pp. 1048-1057, Aug. 2004.