检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]清华大学计算机科学与技术系,北京100084 [2]澳门科技大学资讯科技学院
出 处:《小型微型计算机系统》2014年第4期689-693,共5页Journal of Chinese Computer Systems
基 金:澳门科学与技术发展基金项目(015/2007/A2)资助
摘 要:无线多跳网络中通信节点利用相邻的中继节点转发数据,当节点因移动而需切换中继时,决定中继选择的路由协议对通信性能起关键作用.本文在具有基础设施的混合式无线多跳网络中,提出一种以OLSR路由算法为基础来构建最小生成树中继拓扑的MST-OLSR路由算法,通过引入对中继负载预估的机制,减少各节点通信中在上行链路所需的中继跳数的同时,平衡了中继间的流量负载.仿真结果表明,与传统的OLSR相比,MST-OLSR可以有效提高移动节点中继切换的时延及丢包的通信性能.In the wireless multi-hop networks, nodes have to communicate with others by relaying the packets through their neighbor- ing nodes, therefore the routing protocol, deciding how to choose the relay path in the network, plays a critical role in the perform- ance when the mobile nodes handoff between the relay nodes in the mobility communication. In this paper, we propose a routing al- gorithm, MST-OLSR, used in hybrid infrastructure wireless multi-hop networks to construct the minimum spanning tree topology of the relay nodes based on the conventional routing algorithm, OLSR. The mechanism of estimating the relay nodes' load is introduced to this algorithm for balancing the traffic load between relay nodes while creating the relay topology with lower relay hops required on the uplink path. Simulation results demonstrate that the MST-OLSR algorithm can effectively reduce the delay and the packet loss dur- ing the relay handoff process, and thus improve the mobile node's communication performance with respect to the conventional OLSR algorithm.
关 键 词:无线多跳网络 路由算法 中继切换 负载平衡 OLSR
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.13