检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]长江师范学院数学与计算机学院,重庆408100 [2]武汉大学电信学院,湖北武汉430072
出 处:《电子技术应用》2015年第1期94-98,103,共6页Application of Electronic Technique
基 金:国家科技支撑计划项目(2011BAD30E05);重庆市科委自然科学基金计划(2010BB2244)
摘 要:车联网节点高速移动、拓扑动态变化的特性给数据传输提出挑战。为此,充分利用车辆的移动模型、车辆速度和车辆密度等信息,提出了基于蚁群优化算法的移动感知区域VANET路由(Mobility Aware Zone based Ant Colony Optimization Routing for VANET,MAZACORNET)。MAZACORNET属于多路径的混合路由协议。该协议首先利用蚁群优化算法在节点间寻找多路径,用以辅助断裂链路的数据传输。同时,将网络分为多个区域。在区域内使用先应式路由方案寻找路由,而区域间利用局部信息,引用反应式路由方案去建立路由,从而降低了数据风暴以及拥塞率。仿真结果表明,MAZACORNET在车辆密集环境表现出良好性能。与其他路由方案相比,MAZACORNET具有较高的数据传输率和较低的传输时延。Vehicular ad hoc networks (VANETs) exhibit highly dynamic behavior with mobility and changed network topologies, which make a challenge in data transmission. Therefore, to make use the information of the vehicle's movement pattern, vehicle density and vehicle velocity,mobility aware zone based ant colony optimization routing for VANET (MAZACORNET) is proposed. MAZACORNET is hybrid and multi-path routing. It uses ACO to find multiple routes between nodes in the network to aid in link failures. Meanwhile, the network is partitioned into multiple zones. The proactive approach is used to find a route within a zone and the reactive approach is used to find routes between zones using the local information stored in each zone thereby trying to re- duce broadcasting and congestion. The simulation results show that the algorithm works well for dense networks. When compared to other existing algorithms ,the hybrid algorithm proved to on more efficient in terms of packet delivery ratio and end to end delay.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229