基于欧氏最小生成树的无线Ad Hoc网络容量研究  

Research on the Capacity of Ad Hoc Networks Based on Euclidean Minimum Spanning Tree

作　　者：郭中华[1] 史浩山[1] 

机构地区：[1]西北工业大学电子信息学院,西安710072

出　　处：《传感技术学报》2008年第10期1750-1754,共5页Chinese Journal of Sensors and Actuators

基　　金：国家自然科学基金项目资助(60472074);教育部博士点基金项目资助(20050699037);国防科工委基础研究计划资助(D3320060259)

摘　　要：无线Adhoc网络容量是当前的一个研究热点。在Gupta和Kumar提出的协议模型和物理模型基础上,推导了无线Adhoc网络基于欧氏最小生成树的单播、多播容量,且指出当多播组尺寸小于总的网络节点数时,多播容量比单播容量大。基于NS-2的仿真实验验证了多播容量上限是有效的。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 hoe netowrks is valid.

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

分 类 号：TP393.01[自动化与计算机技术—计算机应用技术]