检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京工业大学信息科学与工程学院,南京210009
出 处:《计算机应用》2007年第9期2221-2223,2235,共4页journal of Computer Applications
摘 要:为解决AdHoc网络的DSR路由协议在通信过程中存在拥塞问题,提出了改进DSR路由协议的思想,即联合"最短路径"和节点发送接收数据包时的"传输状态"来避免拥塞。仿真结果表明,改进后的路由协议有效地减少了发生拥塞的几率,从而提高了无线多跳AdHoc网络环境下Web通信的性能。In order to solve the problem of traffic congestion that always occurs in multi-hop ad hoc networks, a new algorithm for the routing selection was proposed in this paper, i.e. the improved DSR routing -- DSRSL, in consideration of both the" shortest-path" and " transmission status" of packet delivery from the source to the destination for congestion avoidance. Our simulation results show that DSRSL can reduce the congestion probability effectively, thereby improve the Web traffic performance in multi-hop ad hoc networks significantly.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.78