最大累积通信持续时间和遗传算法的GPSR协议

GPSR是一种广泛应用于车载自组织网络的基于地理位置的协议。在一个跳域中，只保留了相邻节点的状态。与基于拓扑的路由协议和基于广播的路由协议相比，它可以很好地减少路由开销。由于GPSR在贪婪算法中存在传输数据包丢失的可能性和周界准则中存在路径冗余，故GPSR服务质量不佳。为了解决GPSR的缺陷，在原GPSR协议的基础上提出了一种新的传动方式。这种方法减少了GPSR因使用右手规则而造成的路径冗余，并且减少了丢包率。     

一种贪婪地理路由协议的改进算法

贪婪转发策略广泛应用于无线传感网络(WSNs)的地理路由协议中,但是,该协议存在数据包丢失严重以及在遭遇路由空洞时路由效率低下的不足。为此,提出一种贪婪地理路由协议的改进算法,记为GPSR-I算法。GPSR-I算法在选择下一跳转发节点时,利用节点离目的节点距离、方向以及节点密度信息计算度量值,然后依据该度量值决策下一跳转发节点。仿真数据表明,与GPSR相比,GPSR-I算法能够有效降低平均端到端传输时延、路由开销,并提高了数据包传输率。     

面向船舶AIS自组织网络的地理位置路由算法

针对船舶自动识别系统（Automatic Identification System,AIS）的自组织网络路由算法设计问题,提出了一种基于优化的贪婪边界无状态路由（Greedy Perimeter Stateless Routing,GPSR）的技术方案。该方案利用AIS时分多址接入协议,为消息报文提供信道接入方法。首先,设计了位置报文的自适应转发策略,使船舶节点根据网络环境自主决策位置报文的转发行为;其次,通过缩小GPSR贪婪转发的选择范围,减少了因节点运动导致的边缘路由失败情况。仿真结果表明,所提方案实现了AIS船舶节点的有效组网。与现有转发策略相比,自适应转发策略降低92.7%的位置报文转发量,并降低了79.6%的时隙冲突率,可有效提高网络资源的利用率。      

无线传感器网络路由协议的设计与实现

针对传统路由协议端到端时延长、丢包率过高的现实问题,提出了一种基于贪婪转发的能量感知多路径路由协议(Greedy Forward Energy-aware Multipath Routing Protocol,GFEMRP)。GFEMRP从传感器起始结点出发,如果遇到网络黑洞则选择周边转发方式,否则将选择吞吐量大、且更接近于目的结点的结点作为下一跳结点。利用了OMNET++5.0和INET框架对包括无线自组网按需平面距离向量路由协议(Ad hoc on-demand distance vector routing protocol,AODV),动态按需无线自组织网络(Dynamic MANET On-demand,DYMO),贪婪周边无状态路由无线网络(Greedy Perimeter Stateless Routing for Wireless Networks,GPSR)和GFEMRP协议在内的四种路由协议进行了仿真和比较,实验结果表明GFEMRP协议具有良好的端到端时延、丢包率等性能。     

一种基于两跳邻居信息的贪婪地理路由算法

 基于地理信息的路由算法由于其高效、低路由开销和良好的可扩展性等特点,在无线传感器网络中得到比较广泛的应用.许多采用贪婪策略作为其基本数据转发机制的地理路由算法都不可避免会遇到路由空洞现象.针对这个问题,本文提出了一种基于掌握两跳邻居节点位置信息的贪婪地理路由算法——Greedy-2算法.该算法能够使节点提前意识到路由空洞的存在,从而尽可能使数据包及时绕开空洞边界节点,减少路由空洞发生的概率,提高分组到达率.对于Greedy-2算法仍然遭遇路由空洞现象的情况,文章提出了一种基于两跳邻居信息的平面化算法PATN,该算法不需要增加额外的平面化开销,即可将网络平面化以采取边缘恢复机制,在UDG网络中保证数据可靠传输.仿真结果表明,与基于一跳邻居节点位置信息的贪婪算法相比,Greedy-2算法可以明显减少路由空洞现象发生的次数,在分组到达率和数据传送的路由跳数方面都有着更好的性能.Greedy-2算法与PATN规则结合后的GPSR-2算法也比GPSR算法有着更优化的路由跳数.     

基于表面自适应的定向贪婪选路

针对无线传感器网络中基于位置的路由算法中存在的重复搜索和冗余计算问题,提出一种基于表面自适应的定向贪婪路由算法（DGAFR）。该算法充分发挥贪婪转发、表面路由转发和定向选路的优势,依据局部区域节点的状态信息进行整个网络的路由选择。理论上分析证明DGAFR算法具备渐近最优性;仿真结果表明,相比于GPSR和GOAFR,该算法降低了大量额外的通信和计算开销,更适于大型的传感器网络。     

基于路段连通性和方向转发策略的机会路由协议

文章针对车载自组织网络中由于道路拓扑的限制以及障碍物的存在导致车辆节点互相隐藏,造成的网络频繁连接中断的问题,综合考虑车辆位置、方向和速度、车辆密度信息,利用十字路口路段连通性和方向转发策略选择下一跳,提出了基于路段连通性和方向转发策略的车载机会路由协议。由仿真结果可知,在城市场景中,尤其当车辆节点比较稀疏时,本协议相比GPSR和GPCR协议具有更高的包投递率和较低的平均端到端传输时延。     

无线传感器网络中基于网络嵌入的弱贪婪路由协议

贪婪路由可以划分为强贪婪和弱贪婪2种路由方式。为了解决目前研究工作中弱贪婪路由协议需要地理位置信息,而强贪婪路由协议需要设计满足贪婪属性的网络嵌入图的问题;同时为了降低操作复杂性,减少能量消耗,提出了一种轻量级的基于树的网络嵌入图(TNEG)构建方法。在基于树的网络嵌入图上,设计了具有局部单调性的贪婪函数,并提出了2个路由规则,然后设计了弱贪婪路由协议TGR和基于双树嵌入的路由协议biTGR。模拟实验表明所提路由协议在路径长度和网络负载等性能上具有明显的优势。     

一种位置信息辅助的Ad Hoc网络按需距离矢量路由协议

 针对Ad Hoc网络中按需距离矢量路由协议路由开销大,以及位置路由中位置信息在获取方式上存在的缺点,提出一种位置信息辅助的按需距离矢量路由协议(LAODV),协议结合AODV以按需的方式获取网络节点的位置信息,并以泛洪、位置信息修正的贪婪转发和局部受限泛洪相结合方式进行路由发现,同时提出了路由维护策略和局部多径备份路由策略。仿真结果表明,LAODV能够获得较好的分组递交率、时延和路由开销性能。     

采用方向性天线的ad hoc网络路由协议研究

为了降低方向性天线扫描路由发现的开销和代价,有效利用方向性天线的高空间复用度和高传输能力,提出一种采用方向性天线的ad hoc网络位置信息辅助的按需距离矢量路由协议DLAODV,协议以按需方式获取网络节点的位置信息,结合泛洪、受限泛洪、路由压缩、位置信息修正的贪婪转发策略以及分区桥接策略,充分利用方向性天线优势,有效提高路由发现效率,路由区分维护策略有效降低了路由维护开销.仿真结果显示,DLAODV能够使得网络获得高吞吐率、低时延和开销性能,相比采用全向天线的AODV协议性能获得了明显提升.     

Geometric spanners for routing in mobile networks

We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: 1) it is planar; 2) between any two graph nodes there exists a path whose length, whether measured in terms of topological or Euclidean distance, is only a constant times the minimum length possible; and 3) the graph can be maintained efficiently in a distributed manner when the nodes move around. Furthermore, each node only needs constant time to make routing decisions. We show by simulation that the RDG outperforms previously proposed routing graphs in the context of the Greedy perimeter stateless routing (GPSR) protocol. Finally, we investigate theoretical bounds on the quality of paths discovered using GPSR.     

Environment-Driven Opportunity Forwarding Cross-Layer Optimization for Ubiquitous Wireless Networks

In this paper, an environment-driven cross-layer optimization scheme is proposed to maximize packet forwarding efficiency. The proposed algorithm is aimed to improve the performance of location-based routing protocol in respect of greedy forwarding and avoid void regions for ubiquitous wireless networks. In greedy forwarding mode, we use a new routing metric IAPS which can estimate the forwarding distance, link quality and the difficulty of channel access during the process of the next hop node selection. When the packet forwarding comes into a local minimum, the proposed scheme uses an opportunistic forwarding method based on competitive advantage to bypass the void regions. NS2 simulation results indicate that the proposed algorithm can improve network resource utilization and the average throughput, and reduce congestion loss rate of wireless multi-hop network comparison with existing GPSR algorithm.     

Routing optimization method based on GPCR for vehicular Ad Hoc network

To improve the performance in sparse networks,local optimum,and routing loop in the greedy perimeter coordinator routing (GPCR) protocol,the weighted-GPCR (W-GPCR) protocol was proposed.The relationship between vehicle node routing and other parameters such as the Euclidean distance between node pairs,moving direction and density was profoundly analyzed,the composite parameter weighted model was established and the calculation method was designed for the existing routing problems,the weighted parameter ratio was selected adaptively in different scenarios,so as to obtain the optimal next-hop relay node.In order to verify the performance of the W-GPCR method,the proposed method was compared with the existing methods such as the traditional geographic perimeter stateless routing (GPSR) protocol,GPCR and so on,and the results show that the proposed method is superior to the package delivery ratio,end-to-end delay,and average hop count.     

Boundary Mapping and Boundary-State Routing (BSR) in Ad Hoc Networks

This paper presents a geographic routing protocol, boundary state routing (BSR), which consists of two components. The first is an improved forwarding strategy, greedy-bounded compass, which can forward packets around concave boundaries, where the packet moves away from the destination without looping. The second component is a boundary mapping protocol (BMP), which is used to maintain link state information for boundaries containing concave vertices. The proposed forwarding strategy greedy-bounded compass is shown to produce a higher rate of path completion than Greedy forwarding and significantly improves the performance of greedy perimeter state routing (GPSR) in sparse networks when used in place of greedy forwarding. The proposed geographic routing protocol BSR is shown to produce significant improvements in performance in comparison to GPSR in sparse networks due to informed decisions regarding the direction of boundary traversal at local minima.     

基于局部梯度场的VANET路由研究

车载自组织网络(VANET,Vehicular Ad hoc Network)近几年受到高度关注,同时多跳安全消息路由成为VANET应用的核心问题之一。试图借助梯度场的方法,研究VANET网络安全消息的定向、受限空间及拓扑动态变化条件的传播机制,以达到快速准确地传播安全消息的目的。提出了一种局部梯度场的路由协议(LGFR,Local Gradient Field Routing),并与城市场景下的贪婪边界无状态路由(GPSR,Greedy Perimeter Stateless Routing)和无线自组网按需平面距离矢量路由(AODV,Ad hoc On-DemandDistance Vector Routing)进行了对比。仿真结果表明,LGFR在数据包丢包率、数据包端到端平均时延和全局数据吞吐量方面具有较好的性能。     

Enhanced GPSR Routing in Multi-Hop Vehicular Communications through Movement Awareness

Providing reliable and efficient routing in presence of relative movement motivates the introduction of movement awareness to improve performance of existing position-based routing schemes in vehicular ad-hoc networks. The proposed algorithm represents a modification of well-known GPSR which exploits information about movement in order to improve the next forwarding node decision. Performance evaluation of the proposed protocol underlines a promising and robust basis for designing a routing strategy suitable for the automotive scenario.     

Trade-off between accuracy,cost, and QoS using a beacon-on-demand strategy and Kalman filtering over a VANET

Vehicular Ad-hoc Networks (VANETs) have been suggested as an active and powerful field of research to mitigate environmental problems and challenges. The main challenge in a VANET is to ensure routing with a good Quality of Service (QoS). The Greedy Perimeter Stateless Routing (GPSR) protocol is one of the most promising position-based routing mechanisms used to overcome this challenge. Its effectiveness depends entirely on the information on a node's mobility and the precision of this information. By broadcasting periodic beaconing within transmission boundary ranges, GPSR can manage neighbors' mobility information and maintain up-to-date lists of neighbours. Nevertheless, information on the position of a neighboring vehicle quickly becomes outdated, which negatively influences the efficiency of the routing. In order to monitor information mobility and to increase the QoS in this challenging area, position estimation needs to be considered.Thus, in this study, we examine the position estimation problem, and propose an improvement to the GPSR protocol, named KF-GPSR, where each vehicle estimates in real time the position of its neighbors using the Kalman filter algorithm. Indeed, by employing this strong estimation technique, it is possible to reduce considerably the frequency of exchanged beacon packets, while maintaining high position accuracy. For greater reliability, we also propose an extension to KF-GPSR, called BOD-KF-GPSR, that uses the “beacon-on-demand” process only if a node needs to rediscover its neighborhood. Simulation experiments using the network simulator NS-2 are presented to demonstrate the ability and usefulness of our two proposals. Here, we compare the proposed protocols against diverse common protocols: GPSR, AODV, DSR, and ZRP. The results show that BOD-KF-GPSR achieves a significant enhancement in terms of its packet delivery ratio, routing cost, normalized routing load, end-to-end delay, and throughput.     

A fuzzy geographical routing approach to support real-time multimedia transmission for vehicular ad hoc networks

Vehicular ad hoc networks known by their greatly active topology have given rise to new challenges related to routing protocols, issues of less concern in infrastructure-based networks or even in mobile ad hoc networks. Indeed, the high revocability of network topology makes the satisfaction of driver’s requirements very arduous, especially with multimedia applications that need strict quality of service (QoS) support. The main purpose of this paper is to promote real time video traffic by maximizing user gratification while keeping a good QoS. Thus, based on the well-known greedy perimeter stateless routing (GPSR) protocol, we propose a new approach called fuzzy geographical routing (FzGR) that incorporates two fuzzy logic usages. The first takes into consideration three input parameters of QoS: the delay, the size of buffer and the throughput, while it outputs a single relevant metric to prioritize the next-hop with lower concern. The other fuzzy system aims at preserving the concept of basic GPSR by considering the distance measure between each next-hop and the final destination. The proposal has been evaluated and compared to the GPSR using a rigorous metrics analysis regarding QoS and quality of experience. Our extensive experimental results using several simulators (e.g., NS-2, VanetMobiSim and Evalvid), show that FzGR has the ability to increase the performance of the network.

     

城市场景下基于速度信息的VANET路由协议的改进

车载自组网络(Vehicular Ad Hoc Networks,VANET)是指道路上由车辆搭载的无线通信装置构成的一种特殊的多跳无线移动自组织网络。VANET在实现多种智能交通方面应用的同时,还能满足用户在乘车时的娱乐等舒适性的需求,近些年来已成为无线自组网络研究的新热点。总结了近些年来出现的主要VANET路由协议的核心路由机制及其优缺点,并分析了各种技术对路由协议性能的影响。其后给出了一种基于速度信息的VANET路由协议改进方法,并通过实验验证了将改进方法与GPSR协议结合可以提高路由路径的稳定性,减少了端到端的平均时延,降低了VANET网络中拓扑的高动态性对路由协议性能的影响。