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

基于欧氏最小生成树的无线Ad Hoc网络容量研究
引用本文:郭中华,史浩山.基于欧氏最小生成树的无线Ad Hoc网络容量研究[J].传感技术学报,2008,21(10).
作者姓名:郭中华  史浩山
作者单位:西北工业大学电子信息学院,西安,710072
基金项目:国家自然科学基金,高等学校博士学科点专项科研项目,国防科工委基础科研项目
摘    要:无线Adhoc网络容量是当前的一个研究热点。在Gupta和Kumar提出的协议模型和物理模型基础上,推导了无线Adhoc网络基于欧氏最小生成树的单播、多播容量,且指出当多播组尺寸小于总的网络节点数时,多播容量比单播容量大。基于NS-2的仿真实验验证了多播容量上限是有效的。

关 键 词:无线Adhoc网络  网络容量  欧氏最小生成树  多播组尺寸

Research on the capacity of Ad Hoc networks based on Euclidean Minimum Spanning Tree
GUO Zhong-hu,SHI Hao-shan.Research on the capacity of Ad Hoc networks based on Euclidean Minimum Spanning Tree[J].Journal of Transduction Technology,2008,21(10).
Authors:GUO Zhong-hu  SHI Hao-shan
Abstract:The network capacity is a focus of current research on wireless Ad Hoc networks.Under the Protocol Models and Physical Models of communication proposed by Gupta and Kumar,this paper derives the theory result of unicast and multicast capacity of Ad Hoc networks based on Euclidean Minimum Spanning Tree(EMST)and indicates that multicast capacity of Ad Hoc networks is larger than the unicast capacity,when the group size is small compared to the total number of nodes in the network.The results of simulations based on NS-2 verify that the upper multicast capacity bounds for wireless Ad hoc netowrks is valid.
Keywords:wireless Ad Hoc networks  network capacity  Euclidean Minimum Spanning Tree  multicast group size
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《传感技术学报》浏览原始摘要信息
点击此处可从《传感技术学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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