赵东风, 刘春花, 李莉, 李剑. 随机N叉树形隔离型冲突分解算法研究[J]. 云南大学学报(自然科学版), 2003, 25(2): 101-104.
引用本文: 赵东风, 刘春花, 李莉, 李剑. 随机N叉树形隔离型冲突分解算法研究[J]. 云南大学学报(自然科学版), 2003, 25(2): 101-104.
ZHAO Dong-feng, LIU Chun-hua, LI Lian, LI Jian. Study on random N-Ray trees algorithms of isolated conflict resolution for random access channels[J]. Journal of Yunnan University: Natural Sciences Edition, 2003, 25(2): 101-104.
Citation: ZHAO Dong-feng, LIU Chun-hua, LI Lian, LI Jian. Study on random N-Ray trees algorithms of isolated conflict resolution for random access channels[J]. Journal of Yunnan University: Natural Sciences Edition, 2003, 25(2): 101-104.

随机N叉树形隔离型冲突分解算法研究

Study on random N-Ray trees algorithms of isolated conflict resolution for random access channels

  • 摘要: 提出了一类新的随机N叉树形冲突分解算法,并对随机存取系统中信息分组冲突分解进行了研究,给出了冲突信息分组平均分解次数的解析式,给出了系统的最大吞吐量和极限吞吐量,数值计算与计算机模拟实验值相一致.

     

    Abstract: It is presented a new random N Ray tree algorithm of isolated conflict resolution to analyze random access channels.The mean times of packet conflict resolution are explicitly obtained.The analytic formulae of the throughputs for dynamic and static algorithms are provided.Also,the simulation results is given.

     

/

返回文章
返回