A Collision Resolution Protocol for Random Access Channels with Energy Detectors

Georgiadis, Leonidas; Papantoni-Kazakos, P.

doi:10.1109/tcom.1982.1095438

Cited by 63 publications

(27 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The receiver can distinguish between 1 and c by using energy detectors [19], [33]. Thus, at the end of every slot, only two bits are required to provide feedback from the receiver to all users.…”

Section: System Modelmentioning

confidence: 99%

Power-Controlled FCFS Splitting Algorithm for Wireless Networks

Gore¹,

Karandikar

2010

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-We consider random access in wireless networks under a physical interference model, wherein a receiver is capable of power-based capture, i.e., a packet can be correctly decoded in the presence of multiple transmissions if the received signalto-interference-plus-noise ratio (SINR) exceeds a threshold. We propose a splitting algorithm that varies the transmission power of users on the basis of quaternary channel feedback (idle, success, capture, and collision). We show that our algorithm achieves a maximum stable throughput of 0.5518. Simulation results demonstrate that our algorithm achieves higher throughput and lower delay than those of first-come-first-serve and residual-energybased splitting algorithms with uniform transmission power.Index Terms-Collision resolution, Markov chain, random access, tree algorithm, wireless medium access control (MAC).

show abstract

Section: System Modelmentioning

confidence: 99%

Power-Controlled FCFS Splitting Algorithm for Wireless Networks

Gore¹,

Karandikar

2010

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…Tsybakov [4] examined a model where the number of colliding hosts is known. Georgiadis and Papantoni-Kazakos [5] studied a channel where the number of colliding hosts is known up to some bound. Pippenger [6] proved that the capacity of a collision channel with full multiplicity feedback is 1, and Ruszinkó and Vanroose [7] gave an algorithm that achieves this bound.…”

Section: Related Workmentioning

confidence: 99%

Distributed Council Election

Raz

Shavitt

Zhang

2004

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-This paper studies the problem of electing a small number of representatives (council) out of a (possible large) group of anonymous candidates. The problem arises in scenarios such as multicast where, to avoid feedback implosion, a small subset of the receivers is chosen to provide feedback on network conditions. We present several algorithms for this problem and analyze the expected number of messages and rounds required for their convergence. In particular, we present an algorithm that almost always converges in one round using a small number of messages (for typical council size) when the number of hosts is known. In the case where the number of hosts is unknown (and too large to be polled), our algorithms converge in a small number of rounds that improves previous results by Bolot et al. (1994).

show abstract

“…In [12] it is assumed that after each collision the number (up to an upper maximum limit)of the packets involved is revealed to all users, through a bank of energy detectors.…”

Section: We Refer To Conditi-: (I) -(Iv) As the Poisson Multiplementioning

confidence: 99%

Multiaccess of a Slotted Channel Using a Control Mini-Slot.

Kazakos¹

1982

View full text Add to dashboard Cite

A Collision Resolution Protocol for Random Access Channels with Energy Detectors

Cited by 63 publications

References 4 publications

Power-Controlled FCFS Splitting Algorithm for Wireless Networks

Power-Controlled FCFS Splitting Algorithm for Wireless Networks

Distributed Council Election

Multiaccess of a Slotted Channel Using a Control Mini-Slot.

Contact Info

Product

Resources

About