PROJECT TITLE :
Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access
In this paper, a random access theme is introduced, that depends on the mix of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is known as coded slotted ALOHA. A bipartite graph illustration of the SIC method, resembling iterative decoding of generalized low-density parity-check codes over the erasure channel, is exploited to optimize the choice possibilities of the element erasure correcting codes through a density evolution analysis. The capability (in packets per slot) of the scheme is then analyzed within the context of the collision channel without feedback. Moreover, a capability bound is developed, and component code distributions tightly approaching the certain are derived.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here