期刊文献+

随机N叉树形隔离型冲突分解算法研究 被引量:4

Study on random N-Ray trees algorithms of isolated conflict resolution for random access channels
原文传递
导出
摘要 提出了一类新的随机N叉树形冲突分解算法,并对随机存取系统中信息分组冲突分解进行了研究,给出了冲突信息分组平均分解次数的解析式,给出了系统的最大吞吐量和极限吞吐量,数值计算与计算机模拟实验值相一致. 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.
出处 《云南大学学报(自然科学版)》 CAS CSCD 2003年第2期101-104,共4页 Journal of Yunnan University(Natural Sciences Edition)
基金 国家自然科学基金资助项目(69862001) 国家教育部骨干教师基金资助项目 云南省自然科学基金资助项目(99F0014M).
关键词 随机N叉树形算法 隔离型冲突分解 吞吐量 random N-Ray trees algorithm isolated conflict resolution throughput
  • 相关文献

参考文献12

  • 1CAPETANAKIS J I. Tree algorithms for packet broadcast channds [ J ]. IEEE Inform Theory, 1979, 25 (5):505-515.
  • 2TSYBAKOV B S. Resolution of a conflict of known multiplicity[J ]. Prob Information Transmission, 1980,16(2): 134-144.
  • 3GEORGIADOS L, PAPANTONI-KAZAKOS P. A collision resolution protocol for random access channels with energy detectors[J]. IEEE Trans Commun, 1982, 30:2 413-2 420.
  • 4黄建成 谢海 徐秉铮.分解信息包冲突的随机预测树形协议[J].通信学报,1983,4(3):80-85.
  • 5GULKO E. Tree-based multiaccess protocols where collision multiplicities are known[J]. IEEE Trans Commun,1985, 33:999-1 001.
  • 6SUDA T, JUNGOK BAE J, BAXTER D C. The robustness and rerformance of tree collision resolution algorithms in an unshared feedback error environment[J].Computer Networks and ISDN Systems, 1990, 18(4):275-292.
  • 7TSYBAKOV B S, PRIVALOV A Y. The throughput of the stack algorithm in a channel with N-conflicts[J].Prob Information Transmission, 1992, 28(2) :78-85.
  • 8赵东风,李必海,郑苏民.二叉树形冲突分解算法研究[J].电子科技大学学报,1996,25(S2):260-264. 被引量:19
  • 9DOLORS SAIA. Design and evaluation of MAC protocols for hybrid fiber/coaxial systems[Z]. Ph D. Dissertation, Georgia Institute of Technology, March 1998.
  • 10王健成,姚庆栋,戴文琪.阻塞Stack-3随机多用户接入算法及其性能研究[J].通信学报,1999,20(11):66-71. 被引量:3

二级参考文献7

共引文献21

同被引文献34

  • 1盛敏,李建东,江帆.应用于无线信道的混合型冲突分解算法[J].电子学报,2005,33(4):692-696. 被引量:1
  • 2THOMAS R W, DASILVA L A, MACKENZIE A B. Cognitive net -works[A]. First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN'05)[C]. Baltimore, USA, 2005, 352-360.
  • 3CAPETANAKIS J. Tree algorithms for packet broadcast channels[J]. IEEE Transactions on Information Theory, 1979, 25(5): 505-515.
  • 4TSYBAKOV B S, MIKHAILOV V A. Free synchronous packet ac- cess in a broadcast channel with feedback[J]. Problemy Peredachi ln- formatsii, 1978, 14(4): 32-59.
  • 5JOHN M. A class of efficient contention resolution algorithms for multiple access[J]. IEEE Transactions on Communications, 1985, 33(2): 145-151.
  • 6BERTSEKAS D, GALLAGER R. Data Networks, 2nd Edition[M]. New Jersey: Prentice-Hal, 1992.
  • 7HAMILTON J D. Time-series Analysis[M]. New Jersey: Princeton University Press, 1994.
  • 8LELAND W E, WILLINGER W, TAQQU M Set al. On the self- similar nature of ethernet traffic[J]. Computer Communication Review, 1995, 25(1): 202-213.
  • 9LELAND W E, WILLINGER W, TAQQU M Set al. On the self- similar nature of ethemet traffic (Extended Version)[J]. IEEE/ACM Transactions on Networking, 1994, 2(1): 1-15.
  • 10HUANG C C, DEVETSIKIOTIS M, LAMBADARIS Iet al. Model- ing and simulation of self-similar variable bit rate compressed video: a unified approach[J]. Computer Communications Review, 1995, 25(4): 114-125.

引证文献4

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部