| 改进型二叉树形冲突分解隔离算法研究 |
| |
| 引用本文： | 张挺,赵东风,孙云山. 改进型二叉树形冲突分解隔离算法研究[J]. 云南大学学报(自然科学版), 2004, 26(2): 119-122 |
| |
| 作者姓名： | 张挺 赵东风 孙云山 |
| |
| 作者单位： | 云南大学,通信工程系,云南,昆明,650091 |
| |
| 基金项目： | 国家教育部骨干教师基金资助. |
| |
| 摘 要： | 提出了一种改进型的二叉树形冲突分解隔离算法,对随机争用多址访问系统中的冲突分解进行了研究,且尝试将此算法应用于Adhoc网络,并给出了改进型隔离算法的冲突分解平均时隙数和系统吞吐量的解析式,其结果与计算机仿真实验相吻合.
|
| 关 键 词： | 二叉树形 冲突分解 隔离算法 吞吐量 Adhoc网络 |
| 文章编号： | 0258-7971(2004)02-0119-04 |
| 修稿时间： | 2003-09-01 |
Study on improved isolated algorithm of conflict resolution for binary trees |
| |
| ZHANG Ting,ZHAO Dong-feng,SUN Yun-shan. Study on improved isolated algorithm of conflict resolution for binary trees[J]. Journal of Yunnan University(Natural Sciences), 2004, 26(2): 119-122 |
| |
| Authors: | ZHANG Ting ZHAO Dong-feng SUN Yun-shan |
| |
| Affiliation: | Department of Communication Engineering, Yunnan University, Kunming 650091, China |
| |
| Abstract: | It is presented an improved isolated algorithm of conflict resolution for binary trees.It is analyzed the packet conflict resolution in random multiple access system,and tried to use this algorithm to the Ad hoc network.Furthermore,the average times of packet conflict resolution and the analytic formulae of the throughput of improved isolated algorithm are explicitly obtained.It is accorded with the computer simulation results of packet conflict resolution. |
| |
| Keywords: | binary trees conflict resolution isolated algorithm throughput Ad hoc network |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《云南大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《云南大学学报(自然科学版)》下载全文 |
