Article

Batch conflict resolution algorithm with progressively accurate multiplicity estimation

Authors:

Petar Popovski,

Frank H. P. Fitzek,

Ramjee PrasadAuthors Info & Claims

DIALM-POMC '04: Proceedings of the 2004 joint workshop on Foundations of mobile computing

Pages 31 - 40

https://doi.org/10.1145/1022630.1022636

Published: 01 October 2004 Publication History

Abstract

The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc. The communication tasks in such wireless networks often involve an inquiry over a shared channel, which can be invoked for: discovery of neighboring devices in ad hoc networks, counting the number of active sensors in sensor networks, estimating the mean value contained in a group of sensors etc. Such inquiry solicits replies from possibly large number of terminals n. This necessitates the usage of algorithms for resolving batch conflicts with unknown conflict multiplicity n. In this paper we present a novel approach to the batch conflict resolution. We show how the conventional tree algorithms for conflict resolution can be used to obtain progressively accurate estimation of the multiplicity. We use the estimation to propose a more efficient binary tree algorithm, termed Estimating Binary Tree (EBT) algorithm. We extend the approach to design the Interval Estimation Conflict Resolution (IECR) algorithm. For n → ∞ we prove that the efficiency achieved by IECR for batch arrivals is identical with the efficiency that Gallager's FCFS algorithm achieves for Poisson packet arrivals. For finite n, the simulation results show that IECR is, to the best of our knowledge, the most efficient batch resolution algorithm reported to date.

References

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[10]

J. L. Massey, Collision-Resolution Algorithms and Random-Access Communications, ser. CISM Courses and Lectures. 1em plus 0.5em minus 0.4em 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. 1em plus 0.5em minus 0.4em Cambridge UK and New York: Cambridge University Press, 1995.

Digital Library

[14]

D. Berstekas and R. Gallager, Data Networks, 2nd ed. 1em plus 0.5em minus 0.4em New Jersey: Prentice-Hall, 1992.

Digital Library

[15]

R. Rom and M. Sidi, Multiple Access Protocols: Performance and Analysis. 1em plus 0.5em minus 0.4em New York: Springer-Verlag, 1990.

Digital Library

[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.

Digital Library

Cited By

Vilgelm MSchiessl SAl-Zubaidy HKellerer WGross J(2018)On the Reliability of LTE Random Access: Performance Bounds for Machine-to-Machine Burst Resolution Time2018 IEEE International Conference on Communications (ICC)10.1109/ICC.2018.8422323(1-7)Online publication date: May-2018
https://doi.org/10.1109/ICC.2018.8422323
Sorensen JStefanovic CPopovski P(2013)Coded splitting tree protocols2013 IEEE International Symposium on Information Theory10.1109/ISIT.2013.6620748(2860-2864)Online publication date: Jul-2013
https://doi.org/10.1109/ISIT.2013.6620748
Zanella A(2012)Adaptive Batch Resolution Algorithm with Deferred Feedback for Wireless SystemsIEEE Transactions on Wireless Communications10.1109/TWC.2012.081312.11164111:10(3528-3539)Online publication date: Oct-2012
https://doi.org/10.1109/TWC.2012.081312.111641
Show More Cited By

Index Terms

Batch conflict resolution algorithm with progressively accurate multiplicity estimation
1. Networks
  1. Network properties
    1. Network structure
  2. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

Conflict multiplicity estimation and batch resolution algorithms

The standard model of a multiple-access channel with ternary feedback is considered. When packets of a batch of k nodes initially collide, it is assumed that no a priori statistical information about k is available. An algorithm is presented and ...
A Class of Algorithms for Collision Resolution with Multiplicity Estimation

The wireless connectivity in pervasive computing has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID (Radio Frequency Identification) tags etc. The communication tasks in such wireless networks ...
Detection and Prevention of Single and Cooperative Black Hole Attacks in Mobile Ad Hoc Networks

A Mobile Ad hoc Network MANET is a collection of wireless computers nodes communicating over multi-hop paths, without infrastructures such as base stations and access points. Nodes must cooperate to provide necessary network functionalities. The Dynamic ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DIALM-POMC '04: Proceedings of the 2004 joint workshop on Foundations of mobile computing

October 2004

118 pages

ISBN:1581139217

DOI:10.1145/1022630

General Chairs:
Stefano Basagni
Northeastern University
,
Cynthia Phillips
Sandia National Laboratories

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

Dial M - POMC 04

Sponsor:

Dial M - POMC 04: Joint Workshop on Foundations of Mobile Computing 2004 ( co-located with Mobicom 2004 Conference)

October 1, 2004

PA, Philadelphia, USA

Acceptance Rates

Overall Acceptance Rate 21 of 68 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
333
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Vilgelm MSchiessl SAl-Zubaidy HKellerer WGross J(2018)On the Reliability of LTE Random Access: Performance Bounds for Machine-to-Machine Burst Resolution Time2018 IEEE International Conference on Communications (ICC)10.1109/ICC.2018.8422323(1-7)Online publication date: May-2018
https://doi.org/10.1109/ICC.2018.8422323
Sorensen JStefanovic CPopovski P(2013)Coded splitting tree protocols2013 IEEE International Symposium on Information Theory10.1109/ISIT.2013.6620748(2860-2864)Online publication date: Jul-2013
https://doi.org/10.1109/ISIT.2013.6620748
Zanella A(2012)Adaptive Batch Resolution Algorithm with Deferred Feedback for Wireless SystemsIEEE Transactions on Wireless Communications10.1109/TWC.2012.081312.11164111:10(3528-3539)Online publication date: Oct-2012
https://doi.org/10.1109/TWC.2012.081312.111641
Zhao RYang Y(2012)A modified estimation scheme of EBT algorithm for RFID system2012 Third International Conference on Intelligent Control and Information Processing10.1109/ICICIP.2012.6391438(778-781)Online publication date: Jul-2012
https://doi.org/10.1109/ICICIP.2012.6391438
Yoon WVaidya N(2012)RFID reader collision problem: performance analysis and medium accessWireless Communications & Mobile Computing10.1002/wcm.97212:5(420-430)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1002/wcm.972
Popovski PFyhn KJacobsen RLarsen T(2011)Robust statistical methods for detection of missing RFID tagsIEEE Wireless Communications10.1109/MWC.2011.599976718:4(74-80)Online publication date: Aug-2011
https://doi.org/10.1109/MWC.2011.5999767
Zhu LYum T(2011)A critical survey and analysis of RFID anti-collision mechanismsIEEE Communications Magazine10.1109/MCOM.2011.576282049:5(214-221)Online publication date: May-2011
https://doi.org/10.1109/MCOM.2011.5762820
Wang WMing L(2010)Study of Unified Protection and Fault Analysis for HV Asynchronous MotorsProceedings of the 2010 International Conference on Electrical and Control Engineering10.1109/iCECE.2010.741(3043-3046)Online publication date: 25-Jun-2010
https://dl.acm.org/doi/10.1109/iCECE.2010.741
Zhu LYum T(2010)Optimal framed Aloha based anti-collision algorithms for RFID systemsIEEE Transactions on Communications10.1109/TCOMM.2011.102910.09039058:12(3583-3592)Online publication date: 1-Dec-2010
https://dl.acm.org/doi/10.1109/TCOMM.2011.102910.090390
Zhu LYum T(2010)The optimal reading strategy for EPC Gen-2 RFID anti-collision systemsIEEE Transactions on Communications10.1109/TCOMM.2010.080310.09042158:9(2725-2733)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1109/TCOMM.2010.080310.090421
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents