Frameless ALOHA Protocol for Wireless Networks

Stefanović, Čedomir; Popovski, Petar; Vukobratović, Dejan

doi:10.1109/lcomm.2012.101712.121073

Cited by 119 publications

(161 citation statements)

References 6 publications

Supporting

Mentioning

157

Contrasting

Order By: Relevance

“…More recently in [9], a new technique, called frameless ALOHA, has been developed. Unlike conventional framed slotted ALOHA protocols and inspired by the concept of rateless coding [10], frameless ALOHA avoids using frames with a fixed number of slots.…”

Section: State Of the Art On Aloha Protocolmentioning

confidence: 99%

“…Note that in the original frameless ALOHA protocol [9,17], p i (m) = p init for any i and m, where p init is a fixed probability assigned to the users by the BS. The value of p init is determined based on BS's estimation from the number of contending users N in a contention round [17].…”

Section: Modified Frameless Slotted Alohamentioning

confidence: 99%

“…The optimization formulation is similar to (9); however, the optimization parameters are reduced to α, p init , and F R 7 . Thus, the intended optimization problem is formulated as…”

Section: Adaptive Probability Of Access With Variable Parametersmentioning

confidence: 99%

“…2 Frequency division or time division duplexing may be used to enable receiving the BS beacon message and transmitting packets by the users at each time slot. For more details, see [9]. 3 Our system model refers to higher layers where we are not concerned about the physical layer effects like fluctuation in the channel gain and noise.…”

Section: Endnotesmentioning

confidence: 99%

See 3 more Smart Citations

An energy-efficient adaptive frameless ALOHA protocol

Rahimian

Noori

Ardakani

2016

J Wireless Com Network

View full text Add to dashboard Cite

Random access protocols are a key feature of a family of emerging communication networks such as machine-to-machine, radio frequency identification (RFID), and sensor networks. To accommodate the needs of such networks with a massive number of uncoordinated devices, new random multiple access (MAC) protocols have been proposed that aim to improve the system efficiency by resolving collisions in the received signal. In this work, we consider one of such protocols, called frameless ALOHA, and propose two techniques to improve its energy efficiency without sacrificing the network throughput. More specifically, we propose mechanisms to adaptively control the access probability at the users. The proposed mechanisms are local and like the original frameless ALOHA, no coordination between the users is needed. Our simulation results verify the improvement achieved in the energy efficiency by the proposed techniques.

show abstract

Section: State Of the Art On Aloha Protocolmentioning

confidence: 99%

Section: Modified Frameless Slotted Alohamentioning

confidence: 99%

“…The optimization formulation is similar to (9); however, the optimization parameters are reduced to α, p init , and F R 7 . Thus, the intended optimization problem is formulated as…”

Section: Adaptive Probability Of Access With Variable Parametersmentioning

confidence: 99%

Section: Endnotesmentioning

confidence: 99%

See 2 more Smart Citations

An energy-efficient adaptive frameless ALOHA protocol

Rahimian

Noori

Ardakani

2016

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…The achievable throughput is nearly one, as N approaches infinity [16,17]. With similar SIC scheme, frameless Slotted Aloha for distributed random access has been proposed in [18,19]. One drawback of the Slotted Aloha and its variants is the occurrence of the sub-optimal throughput due to the lack of information about the number of active nodes [20].…”

Section: Introductionmentioning

confidence: 99%

FISH: Finite Projective Plane Based Interference Cancellation for Slotted ALOHA

Woo

2016

Wireless Pers Commun

View full text Add to dashboard Cite

Due to the large number of light weight, low power devices in the future Internet, an efficient distributed multiple access protocol that can support a small fixed number of machines with continuous traffic along with a large variable number of devices with sporadic traffic is needed. The traffic in the future Internet has fundamentally different requirements: first, the accessing devices are of low power, which limit the transmission range; secondly, the delay is very stringent; thirdly, the number of active devices is time varying. In this paper, we propose a finite projective plane (FPP) based multiple access protocol (FISH) to meet such requirements. A low power node can transmit the replicas of a data packet in multiple time slots to achieve the same range of transmission as a high power node at one time. The initialization time slot of a frame allows for the estimation of the number of active nodes and the adjustment of the size of the frame to maximize the throughput. The interference cancellation and conflict resolution scheme of the FISH protocol is based on the theory of FPP. By using the property that the union of the sets of the FPP sharing one common point is a complete set, we are able to extract each of the individual user signals. One distinguishing feature of the FISH protocol is the amplification of the signal-to-noise ratio (SNR), which can either extend the transmission range or improve the bit error rate without sacrificing the throughput. In the performance evaluation, we demonstrate that the throughput is identical to the Slotted Aloha, while the SNR is magnified m times, where m is the order of the FPP. The proposed FISH protocol is of great use in the machine-to-machine communications as well as traditional cellular and satellite systems.

show abstract

Code‐expanded radio access protocol for machine‐to‐machine communications

Thomsen

Pratas

Stefanović

et al. 2013

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

The random access methods used for support of machine-to-machine, also referred to as Machine-Type Communications, in current cellular standards are derivatives of traditional framed slotted ALOHA and therefore do not support high user loads efficiently. We propose an approach that is motivated by the random access method employed in LTE, which significantly increases the amount of contention resources without increasing the system resources, such as contention subframes and preambles. This is accomplished by a logical, rather than physical, extension of the access method in which the available system resources are interpreted in a novel manner. Specifically, in the proposed scheme, users perform random access by transmitting orthogonal preambles in multiple random access subframes, in this way creating access codewords that are used for contention. We show that, for the same number of random access subframes and orthogonal preambles, the amount of available contention resources is drastically increased, enabling the massive support of Machine-Type Communication users that is beyond the reach of current systems.

show abstract

Frameless ALOHA Protocol for Wireless Networks

Cited by 119 publications

References 6 publications

An energy-efficient adaptive frameless ALOHA protocol

An energy-efficient adaptive frameless ALOHA protocol

FISH: Finite Projective Plane Based Interference Cancellation for Slotted ALOHA

Code‐expanded radio access protocol for machine‐to‐machine communications

Contact Info

Product

Resources

About