Citation: | SUN Jingyun, LIU Rongke, HU Yingmenget al. A random multi-user access method with unequal protection[J]. Journal of Beijing University of Aeronautics and Astronautics, 2017, 43(12): 2449-2456. doi: 10.13700/j.bh.1001-5965.2016.0938(in Chinese) |
The throughput performance degrades under high traffic loads when massive bursty users have access to the satellite. To solve this problem, a random multi-user access method with unequal protection was proposed. Several copies of a packet were created and sent during different time slots according to a selected degree distribution. The random access procedure could be described by a bipartite graph. By using successive interference cancellation (SIC), collided packets can be recovered instead of abandoned. In addition, a portion of time slots in each frame were selected exclusively for high-priority users to improve the decoding probability of high-priority data packet. An analysis using standard "and-or trees" theory was introduced. Further, the proposed method was verified with experimental simulations. The simulation results show that the proposed random multi-user access method, compared with traditional ALOHA protocol, effectively avoids the throughput degradation caused by impact under low traffic loads. Compared with IRSA protocol, it enhances high-priority users' throughput under high traffic loads.
[1] |
TASAKA S.Multiple-access protocols for satellite packet communication networks:A performance comparison[J].Proceedings of the IEEE, 1984, 72(11):1573-1582. doi: 10.1109/PROC.1984.13054
|
[2] |
ABRAMSON N.The ALOHA system:Another alternative for computer communications[C]//Proceedings of the Fall Joint Computer Conference.New York:ACM, 1970:281-285. https://dl.acm.org/citation.cfm?id=1478502
|
[3] |
CELANDRONI N, FERRO E, GOTTA A.RA and DA satellite access schemes:A survey and some research results and challenges[J].International Journal of Communication Systems, 2014, 27(11):2670-2690. doi: 10.1002/dac.2498/pdf
|
[4] |
CASINI E, DE GAUDENZI R, HERRERO O R.Contention resolution diversity slotted ALOHA (CRDSA):An enhanced random access schemefor satellite access packet networks[J].IEEE Transactions on Wireless Communications, 2007, 6(4):1408-1419. doi: 10.1109/TWC.2007.348337
|
[5] |
LIVA G.Graph-based analysis and optimization of contention resolution diversity slotted ALOHA[J].IEEE Transactions on Communications, 2011, 59(2):477-487. doi: 10.1109/TCOMM.2010.120710.100054
|
[6] |
STEFANOVIC C, PSTEFANOVIC C, POPOVSKI P.ALOHA random access that operates as a rateless code[J].IEEE Transactions on Communications, 2013, 61(11):4653-4662. doi: 10.1109/TCOMM.2013.100913.130232
|
[7] |
PAOLINI E, LIVA G, CHIANI M.Coded slotted ALOHA:A graph-based method for uncoordinated multiple access[J].IEEE Transactions on Information Theory, 2015, 61(12):6815-6832. doi: 10.1109/TIT.2015.2492579
|
[8] |
HASAN M N, ANWAR K.Massive uncoordinated multiway relay networks with simultaneous detections[C]//IEEE International Conference on Communication Workshop.Piscataway, NJ:IEEE Press, 2015:2175-2180. http://ieeexplore.ieee.org/document/7247504/
|
[9] |
ALSBOU N, HENRY D, REFAI H.R-ALOHA with priority (PR-ALOHA) in non ideal channel with capture effects[C]//2010 IEEE 17th International Conference on Telecommunications (ICT).Piscataway, NJ:IEEE Press, 2010:566-570. http://ieeexplore.ieee.org/document/5478849/
|
[10] |
PURWITA A A, ANWAR K.Massive multiway relay networks applying coded random access[J].IEEE Transactions on Communications, 2016, 64(10):4134-4146. http://ieeexplore.ieee.org/document/7544584/
|
[11] |
ANWAR K.Graph-based decoding for high-dense vehicular multiway multirelay networks[C]//IEEE Vehicular Technology Conference.Piscataway, NJ:IEEE Press, 2016:1-5. http://ieeexplore.ieee.org/document/7504263/
|
[12] |
RAHNAVARD N, FEKRI F.Generalization of rateless codes for unequal error protection and recovery time:Asymptotic analysis[C]//2006 IEEE International Symposium on Information Theory.Piscataway, NJ:IEEE Press, 2006:523-527. http://ieeexplore.ieee.org/document/4036017/
|
[13] |
NEKOUI M, RANJKESH N, LAHOUTI F.A fountain code approach towards priority encoding transmission[C]//Proceedings of 2006 IEEE Information Theory Workshop (ITW'06).Piscataway, NJ:IEEE Press, 2006:52-55. http://ieeexplore.ieee.org/document/4119253/
|
[14] |
LUBY M, MITZENMACHER M, SHOKROLLAHI M A.Analysis of random processes via and-or tree evaluation[C]//Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms.New York:ACM, 1998:364-373. https://mathscinet.ams.org/mathscinet-getitem?mr=1642948
|