Coded random access: applying codes on graphs to design random access protocols
نویسندگان
چکیده
منابع مشابه
Random access protocols based on rateless codes
We present two coded random access protocols that rely on the ideas of rateless codes and Successive Interference Cancellation (SIC). The rateless aspect is seen in that the contention period continues until the Base Station (BS) decides that a sufficient fraction of users has been resolved. The first protocol is referred to as frameless ALOHA, in which a device transmits the packet multiple ti...
متن کاملRandom Access to Fibonacci Codes
A Wavelet tree allows direct access to the underlying file, resulting in the fact that the compressed file is not needed any more. We adapt, in this paper, the Wavelet tree to Fibonacci Codes, so that in addition to supporting direct access to the Fibonacci encoded file, we also increase the compression savings when compared to the original Fibonacci compressed file.
متن کاملHigh-Throughput Random Access via Codes on Graphs
Recently, contention resolution diversity slotted ALOHA (CRDSA) has been introduced as a simple but effective improvement to slotted ALOHA. It relies on MAC burst repetitions and on interference cancellation to increase the normalized throughput of a classic slotted ALOHA access scheme. CRDSA allows achieving a larger throughput than slotted ALOHA, at the price of an increased average transmitt...
متن کاملOptical CDMA Random Access Protocols
The link layer of an optical directdetection code-division-multiple access packet network is considered. Three different protocols are proposed. Two of them need pretransmission coordination, whereas the third one does not. Both system throughput and average packet delay are derived and investigated for two different receiver models, namely the correlation and chip-level receivers. Both multip...
متن کاملMeasurement-adaptive cellular random access protocols
This work considers a single-cell random access channel (RACH) in cellular wireless networks. Communications over RACH take place when users try to connect to a base station during a handover or when establishing a new connection. We approach the problem of optimal coordination of user actions, taking into account a dynamic environment (channel fading, mobility, etc.). Within the framework of S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Magazine
سال: 2015
ISSN: 0163-6804
DOI: 10.1109/mcom.2015.7120031