首页 | 本学科首页   官方微博 | 高级检索  
     检索      

p值二叉树形冲突分解算法分析
引用本文:张峰,赵东风,王菽兰,程俊林.变p值二叉树形冲突分解算法分析[J].云南大学学报(自然科学版),2007,29(6):566-569.
作者姓名:张峰  赵东风  王菽兰  程俊林
作者单位:1. 云南大学,通信工程系,云南,昆明,650091
2. 昆明冶金高等专科学校,云南,昆明,650204
基金项目:云南省自然科学基金,云南省教育厅资助项目
摘    要: 提出了一种二叉树形冲突分解的改进算法,通过对随机争用多址访问系统中的信息分组冲突分解的研究,给出了冲突信息分组平均分解次数的解析式和系统吞吐量的解析式,仿真实验表明,仿真实现结果与理论值相吻合.

关 键 词:二叉树形  冲突分解  树形算法  吞吐量  p
文章编号:0258-7971(2007)06-0566-04
修稿时间:2006-11-13

Study on isolated algorithm of conflictresolution with alterable values of p for binary trees
ZHANG Feng,ZHAO Dong-feng,WANG Shu-lan,CHENG Jun-lin.Study on isolated algorithm of conflictresolution with alterable values of p for binary trees[J].Journal of Yunnan University(Natural Sciences),2007,29(6):566-569.
Authors:ZHANG Feng  ZHAO Dong-feng  WANG Shu-lan  CHENG Jun-lin
Institution:1. Department of Communication Engineering, Yunnan University, Kunming 650091, China; 2. Kunming Metallurgy College, Kunming 650204, China
Abstract:It is presented an improved isolated algorithm of conflict resolution for binary tree,and analyzed the packet conflict resolution in random multiple access system.Furthermore,the average times of packet conflict resolution and the analytic formulae of the throughput of improved isolated algorithm are explicitly obtained.The simulation results shows that the theory results of packet conflict resolution are accorded with its simulation results.
Keywords:binary trees  packet conflict resolution  tree algorithm  throughput  alterable values of p
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《云南大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《云南大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号