检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:朱斌[1] 曾孝平[1] 陈礼[1] 廖红云 颜芳[1]
机构地区:[1]重庆大学通信工程学院,重庆400044 [2]重庆金美通信有限责任公司,重庆400030
出 处:《西安电子科技大学学报》2011年第5期101-107,共7页Journal of Xidian University
基 金:重庆市科委自然科学基金资助项目(CSTC;2008BB2313);重庆大学"211"工程三期创新人才培养计划建设资助项目(20100234);重庆市"信息制造业"重大科技专项资助项目(CSTC;2009AB2146)
摘 要:提出了一种基于流言机制的自适应负载均衡路由算法.该算法结合流言路由机制与网络负载均衡的思想,在路由发现阶段,根据节点分布情况和节点当前负载在局部范围内的相对轻重,自适应地调整流言转发概率,让负载较轻的节点优先参与路由建立.仿真实验表明,该算法减少了路由开销,提高了分组平均投递率,降低了数据分组端到端平均时延,具有较强的实用性.The traditional routing algorithms for Ad hoc networks use the minimum hop count as the routing metric, so some central nodes are overloaded and the performance of the networks is degraded. Therefore, an adaptive load balancing routing algorithm based on a gossip mechanism is proposed. This routing algorithm combines the gossip routing mechanism and the load balancing of the network. In the phase of routing discovery, it adjusts the transmission probability in gossip adaptively according to the distributing situation of the nodes and the relative degree of the load in the local area, and lets the nodes with a smaller load join the foundation of the routing preferentially. Simulation demonstrates that this algorithm reduces the routing control overhead remarkably, increases the average packet delivery ratio, and decreases the average end-to-end delay of the data packets, so it is of high practicability.
关 键 词:AD HOC网络 路由算法 负载均衡 路由开销 流言机制
分 类 号:TN915[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.85