检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学综合业务网国家重点实验室信息科学研究所,西安710071
出 处:《计算机科学》2007年第5期38-40,56,共4页Computer Science
基 金:国家自然科学基金(No.60572144;No.60532060)
摘 要:为给无线Ad Hoc网络设计者提供参考依据,本文基于场景,用仿真方法研究了网络传输CBR业务时影响最佳UDP分组长度的主要因素。仿真中分别采用了AODV和DSR路由协议,并考虑了信道无误码及有误码两种情况。结果表明,路由协议、业务强度、信道误码率都是影响最佳UDP分组长度的重要因素。在无差错信道条件下,AODV协议对应的最佳UDP分组长度比DSR协议的要短一些;随着业务强度的增强,最佳UDP分组长度变长。信道误码率BER为10-4时的最佳UDP分组长度比无差错信道条件下的短。当采用的分组长度由最佳长度逐渐增加时,网络性能迅速变差。To provide reference for mobile Ad Hoc network designers, the main factors which affect the optimal UDP (User Datagram Protocol) packer's length when transmitting CBR traffic is studied by simulation in this paper. Both AODV and DSR routing protocols are adopted in the research. Moreover, the channel BER (Bit Error Rate) is taken into consideration. Extensive simulations are made in a specifically scenario where nodes move randomly. The simula- ting results show that routing protocol, traffic intension and the BER are all main factors that affect the optimal UDP packer's length. When considering an error free channel, the optimal UDP packer's length corresponding AODV is a little shorter than that corresponding DSR, and it becomes longer when the traffic intension increases. When consider- ing a channel with BER equaling to 10-4, the optimal UDP packer's length is shorter than that under errorfree channel, and network performance becames worse quickly when the packet's length increases from the optimal value gradually.
关 键 词:无线AD Hoc网络 最佳UDP分组长度 网络性能
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229