| Improved Ternary-tree Algorithm for Contention Resolution over Random Multi-access Channel |
| |
| 作者姓名： | GAO Fei ZHAO Dong feng |
| |
| 作者单位： | 1. The Department of Information and Electrical Engineering，Yunnan Institute of the Nationalities，Kunming 650031，P.R.China; 2. The Department of Communication Engineering，Yunnan University，Kunming 650091，P.R.China |
| |
| 基金项目： | ThisresearchwassupportedbyNationalNaturalScienceFoundation!(69862 0 0 1 )，YunnanProvinceNaturalScienceFoundation!(2 0 0 0F0 0 |
| |
| 摘 要： | 1 ＩｎｔｒｏｄｕｃｔｉｏｎＩｎｔｈｅｐａｓｔｔｈｉｒｔｙｙｅａｒｓ,ｒａｎｄｏｍａｃｃｅｓｓｔｅｃｈ ｎｉｑｕｅｓｈａｖｅｗｉｄｅｌｙｂｅｅｎａｐｐｌｉｅｄｉｎｓａｔｅｌｌｉｔｅｓｙｓｔｅｍｓ,ｇｒｏｕｎｄｒａｄｉｏｎｅｔｗｏｒｋｓ,ａｎｄｃｏｍｐｕｔｅｒａｎｄｃｏｍｍｕｎｉ ｃａｔｉｏｎｓｙｓｔｅｍｓ.ＴｈｅｏｒｉｇｉｎａｌｒａｎｄｏｍａｃｃｅｓｓｓｃｈｅｍｅｗａｓＡＬＯＨＡｓｙｓｔｅｍｗｈｉｃｈｗａｓｉｎｔｒｏｄｕｃｅｄｂｙＡｂｒａｍｓｏｎｉｎ 1 970 .Ｔｈｉｓｓｙｓｔｅｍｓｃｈｅｍｅｗａｓｓｉｍ…
|
Improved Ternary-tree Algorithm for Contention Resolution over Random Multi-access Channel |
| |
| GAO Fei ,ZHAO Dong feng .Improved Ternary-tree Algorithm for Contention Resolution over Random Multi-access Channel[J].The Journal of China Universities of Posts and Telecommunications,2001,8(2). |
| |
| Authors: | GAO Fei ZHAO Dong-feng |
| |
| Affiliation: | 1. The Department of Information and Electrical Engineering, Yunnan Institute of the Nationalities,
2. The Department of Communication Engineering, Yunnan University, |
| |
| Abstract: | This paper studies the tree based contention resolution algorithm over a random multi access channel, and proposes a new algorithm model which is named Improved Ternary tree Algorithm( ITA ). The channel throughput over blocked access reaches 0 422. The analytical expression and computer simulation results indicate that the performance of ITA is better than the basic binary and ternary tree algorithm. |
| |
| Keywords: | contention resolution tree based algorithms mean slot length throughput blocked access |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
