一种基于mesh网络的多径路由协议

针对无线mesh网络的特点提出了一种基于源节点建立、目的节点维护的多径路由协议。该协议采用目的节点更新mesh结构的机制,能实时维护最优路径和其余多条路径,当节点移动或其他原因造成链路断开时,不需要路由修复或重建,从而降低了丢包率和端到端时延,且通过基于源节点建立路由的方式有效地减少了控制开销。仿真结果表明,该算法具有良好的性能。     

管道泄漏监测传感器网络的路由路径算法研究

分析管道流量泄漏监测的传感器网络特点,对传感器节点数据流量进行建模分析,如何保障在线监测网络设施的可用性,而链路通信质量随时空变化很大,并且有5%到15%的非对称链路存在。链路层服务不但可以发现邻居传感器节点,测量和预测邻居节点间的链路通信质量,而且还能提供链路数据转发机制减轻单向链路对其他协议的影响。为了提高路由路径的可靠性和减少能量损耗,利用链路层服务和分布式算法,为每个传感器节点建立到汇聚节点的最可靠路由路径,理论分析该算法的性能,在模拟器TOSSIM上进行仿真,实验结果表明基于链路层服务的最可靠路由路径建立算法,可充分利用单向链路建立更可靠的路由路径,有多于17%的节点建立更可靠的路由路径,路由路径的可靠性提高2%到51%。     

无线传感器网络中基于链路层服务的最可靠路由路径建立算法

无线传感器网络中, 链路通信质量随时空变化很大, 并且有5\%到15\%的非对称链路存在. 链路层服务不但可以发现邻居传感器节点, 测量和预测邻居节点间的链路通信质量, 而且还能提供链路数据转发机制减轻单向链路对其他协议的影响. 为了进一步提高路由路径的可靠性和减少能量损耗, 本文利用链路层服务, 采用分布式算法, 为每个传感器节点建立了到汇聚节点的最可靠路由路径, 并理论分析该算法的性能, 最后在无线传感器网络模拟器TOSSIM上进行了模拟. 实验结果表明, 基于链路层服务的最可靠路由路径建立算法, 可充分利用单向链路建立更可靠的路由路径, 有多于17\%的节点建立了更可靠的路由路径, 路由路径的可靠性提高了2\%到51\%.     

基于蚁群算法的Ad hoc多径路由协议

针对无线移动自组织网中网络拓扑结构变化迅速,节点间移动速率快的特点,提出一种采用备份路径修复断裂链路的基于蚁群算法的无线移动自组织网路由协议-antPro协议.和传统的路由协议相比,对同一目的节点,新路由协议在源节点建立多条路由,在路由的中间节点缓存有备份路径.协议具有较好的鲁棒性,在链路断裂时采用备份路径及时恢复数据分组的传送,能很好地适应Ad hoc网络环境.     

无线传感器网络一种不相交路径路由算法

无线传感器网络经常被用来采集物理数据,监测环境变化.由于低功耗无线通信不确定性、链路质量不稳定性以及节点失效等问题,传感器网络很容易导致路由数据包丢失.为了提高网络路由的可靠性,人们提出多路径路由算法.多路径路由中源节点到目的节点的多条路径可能含有公共节点,或者公共边,如果公共节点或者公共链路失效,则这个数据包也丢失,因此又有人提出不相交多路径路由算法.不相交多路径路由算法又分为链路不相交多路径路由算法和节点不相交多路径路由算法.提出了一种不相交路径路由算法,可以将感知节点采集到的数据通过不相交路径传送到汇聚节点,提高路由的可靠性.而且,这个算法还可以很方便地应用到多Sink节点的网络当中.该路由算法用到的路由表大小为|K|,其中|K|表示路径数.算法的运行时间复杂度是O(|L|),其中|L|表示网络中的边数.     

一种基于生存时间的Ad hoc网络不相交多路径路由算法*

针对无线移动Ad hoc网络的节点具有移动性和能量限制等问题,提出了一种根据网络动态拓扑结构和节点能量来进行多路由选择的混合式路由算法PEMP-OLSR。该算法以改进的链路状态路由算法为基础,通过在网络拓扑构造过程中引入链路和节点生存时间等参数来提高所选路径的稳定性,同时通过设定影响链路和节点权重的迭代因子来提高多条路径的不相交性,以提高此并行多路径算法的传输效率。通过大量仿真实验结果表明,该算法能有效地提高所选择的多条路径的稳定性和不相交性。     

基于链路断开概率的自适应信标交换算法

在移动无线传感器网络中,贪婪地理路由协议采用周期性信标交换算法来构建和维护邻居节点表会导致通信暂盲现象.针对该问题,首先从理论上分析节点移动对网络连通性的影响,对节点间的链路状态进行Markov链建模,分析推导出链路断开概率的计算公式.根据链路断开概率与运动时间的一一对应关系,提出一种基于链路断开概率的自适应信标交换算法,提高邻居节点表的构建与维护的准确性与实时性,为贪婪地理转发策略提供可靠的依据,减缓节点移动带来的不利影响.仿真结果表明,该算法不但提高了数据分组传送成功率,而且还降低了控制开销,适用于对传输可靠性和能耗要求高的移动无线传感器网络.     

基于虚拟信道多路径融合认知无线网络路由算法

针对认知无线网络中频谱的动态性、时变性、多样性以及节点移动性, 提出了一种基于虚拟信道的多路径融合认知无线网络路由算法. 在路由建立过程中, 为解决源节点与目的节点信道同步问题, 源节点在公共控制信道上广播添加虚拟信道的路由请求, 在当前所处信道为虚拟信道的节点中转发. 目的节点对多条路径通过信道切换进行融合, 以规避主用户的活动区域, 减少路径跳数, 提高链路的稳定性. 在路由维护阶段, 通过卡尔曼滤波对节点移动速度进行预测, 在链路断裂之前启动路由修复. 最后通过NS2中CRCN Simulator仿真结果表明, 该算法在链路通信的稳定性、分组投递率、吞吐量、端到端时延等方面有明显的改善, 提高了网络的整体性能.     

移动WSN节点不相交多路径路由算法

针对移动无线传感器网络不相交多路径路由中的路径断裂问题,提出基于HSV色彩空间的节点不相交多路径路由算法。采用HSV色彩空间模型为每条链路建立数值化的（h,s,v）三元组,使其属于不同的色彩平面,以寻找从源节点到目标节点的多条节点不相交路径。针对节点移动问题,设计基于可变时间间隔链路接收信号强度指示值探测的不相交多路径维护机制,该机制无需借助地理位置信息。实验结果表明,当使用3条路径传输时,该算法的数据传输成功率可达到80％以上,而对比的经典算法均低于70％。此外,其在网络吞吐量、能量消耗等方面也具有较好的性能。     

基于生命期预测的移动Ad hoc网络多径路由策略

在移动自组网中,由于网络节点的移动性和拓扑结构的多态性,多路径路由在稳定性,均衡负载方面优于单路径路由,非常适合Ad hoc网络。考虑到移动自组网中节点能量的局限性,在DSR协议的基础上提出了一种新型的多径路由算法。该算法结合节点路径的能量消耗率,预测出链路的生命期,以求找到多条有效路径并进行传输。仿真结果表明,该协议比DSR具有更好的吞吐量和端到端延迟。     

基于WSN的AODV路由协议的研究与改进

AODV算法采用最少跳数的路径作为信源节点和信宿节点之间的通信路径,忽略了可能存在的低质量的信道。本文提出一种改进的基于链路质量的L-AODV路由协议,该协议在源节点广播RREQ请求分组并沿途收集链路质量信息,利用目的节点接收到的RREQ分组进行路径性能评估,并选择出链路质量最高的路径。实验结果表明基于链路质量的L-AODV协议可以明显提高分组投递率。     

无线Ad Hoc网络中增强安全性的多路径路由算法

针对无线ad hoc网络的数据安全性问题,提出了一种增强安全性的多路径路由算法．该算法通过目标节点发送检测数据包的机制,动态维护多路径路由信息的有效性．源节点则根据收到检测包的信息自适应地更新当前的最优传输路径,充分利用路由寻找及维护过程中的信息建立多条可用路径,提供最优的路由方案,并增强了无线ad hoc网络数据传输的安全性．仿真结果表明此算法的数据传输安全性达到了合理的水平．     

A cost matrix agent for shortest path routing in ad hoc networks

Wireless ad hoc networks do not rely on an existing infrastructure. They are organized as a network with nodes that act as hosts and routers to treat packets. With their frequent changes in topology, ad hoc networks do not rely on the same routing methods as for pre-established wired networks; they require routing methods for mobile wireless networks. To select a path from a source to a destination in dynamic ad hoc networks, an efficient and reliable routing method is very important. In this paper, we introduce a cost-matrix-based routing algorithm. An agent node creates topology information in the form of the adjacency-cost matrix which shows link costs of the network.Based on the adjacency-cost matrix, the minimum-cost matrix and the next-node matrices can be calculated. Based on the minimum-cost matrix and the next-node matrices, the minimum cost between source and destination nodes and between intermediate nodes on the minimum-cost paths can be calculated.The matrices are periodically distributed by the agent to the other nodes. Based on the minimum-cost matrix and the next-node matrices, each node decides the minimum-cost path to its destination. Because none of the nodes except the agent needs to gather network topology information, the control overhead of the proposed method is small compared with those of the general table-driven routing protocols.     

一种基于部分网络编码的无线网络机会路由算法

结合机会路由和网络编码两项新技术各自的优势,提出了一种新的基于部分网络编码的机会路由算法(Opportunistic Routing Algorithm for Wireless Network Based on Partial Network Coding,ORAPNC)。为了避免数据包分叉传输,同时利于执行转发节点间协调机制,ORAPNC首先以期望传输次数作为路由度量建立一条固定路由,并将候选转发节点集中在这条固定路径附近;为了充分减小网络中的冗余数据包,ORAPNC采用一种新的转发节点间协调机制(Forwarding Nodes Coordination Mechanism,FNCM)来实现每跳的数据包传输。仿真结果表明,与其他相关路由协议相比较,ORAPNC可以有效提高网络吞吐量,减小目的节点解出原始数据包的平均时延。     

Dynamic backup routes routing protocol for mobile ad hoc networks

Mobile Ad Hoc Networks (MANETs), which provide data networking without infrastructure, represent one kind of wireless networks. A MANET is a self-organizating and adaptive wireless network formed by the dynamic gathering of mobile nodes. Due to the mobility of mobile nodes, the topology of a MANET frequently changes and thus results in the disability of originally on-the-fly data transmission routes. The dynamic properties of MANETs are therefore challenging to protocol design. To cope with the intrinsic properties of MANETs, Dynamic Backup Routes Routing Protocol (DBR²P), a backup node mechanism for quick reconnection during link failures, is proposed in this paper. DBR²P is an on-demand routing protocol and it can set up many routes to reach a destination node in a given period. Even when a link fails, those routes from the source node to the destination node can be analyzed to obtain backup routes to sustain quick reconnection. The information of backup routes can be saved in a specific on-the-route node and enables backup routes to be found immediately in situation regarding disconnection. As a result, DBR²P could more thoroughly improve the quality of routing protocol than those proposed in the past.     

无线传感器网络中保证交付的贪心路由算法

针对传感器网络提出了一种高效的点对点的路由方法.通过对每个节点分配坐标,将网络映射到由它的若干生成树构成的度量空间,根据节点坐标使用贪婪算法路由,即总是选择离目的节点最近的邻居转发包.该方法在每个节点的路由表中只需要维护邻居的坐标,包首部开销最多为O(log2n)2比特.与很多基于位置的贪婪路由算法相比较,该方法的特点是贪婪路由算法能够保证网络中任意一对节点之间都是可达的,并且路径长度不超过这对节点在生成树上的距离.仿真表明该方法同时能够在路径拉伸度和负载平衡上取得较好的性能.     

无线 Ad hoc 网络和传感网络中基于位置的、可靠的无信标传输路由方法

Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node should know the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, the neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery.     

基于蚁群的无线传感器网络能量均衡非均匀分簇路由算法

无线传感器网络(WSN)路由中,节点未充分考虑路径剩余能量及链路状况进行的路由会造成网络中部分节点网络寿命减少,严重影响网络的生存时间。为此,将蚁群优化算法与非均匀分簇路由算法相结合,提出一种基于蚁群优化算法的无线传感器非均匀分簇路由算法。该算法首先利用考虑节点能量的优化非均匀分簇方法对节点进行分簇,然后以需要传输数据的节点为源节点,汇聚节点为目标节点,利用蚁群优化算法进行多路径搜索,搜索过程充分考虑了路径传输能耗、路径最小剩余能量、传输距离和跳数、所选链路的时延和带宽等因素,最后选出满足条件的多条最优路径,完成源目的节点间的信息传输。实验表明,该算法充分考虑路径传输能耗和路径最小剩余能量、传输跳数及传输距离,能有效延长无线传感器网络的生存期。     

Implementation of energy efficient circuit design using A* algorithm in embedded network

In wireless sensor network, the routing path plays a prominent role in network resource utilization. Since, the nodes in network are open to physical abuse an effective routing protocol is necessary to improve data reliability in network and to overcome node data link disconnection. In this paper, we propose to implement A*EEDDP (Energy Efficient Distributed Diffusion protocol) to improve data reliability and increase network lifetime. The A* algorithm determines the shortest routing path between source node and destination node. In addition, the routing path determine with respect to parameters such as energy consumed for communication, residual energy of nodes and the time over which the nodes can support the routing path. The combined A*EEDDP implement in testbed and performance evaluate interms of network lifetime, throughput, packet delivery ratio, energy efficiency and end to end delay. The A*EEDDP performs better compared to other algorithm and achieves higher packet delivery ratio of 97%.     

Spray and forward:Efficient routing based on the Markov location prediction model for DTNs

Typical delay tolerant networks(DTNs)often suffer from long and variable delays,frequent connectivity disruptions,and high bit error rates.In DTNs,the design of an efficient routing algorithm is one of the key issues.The existing methods improve the accessibility probability of the data transmission by transmitting many copies of the packet to the network,but they may cause a high network overhead.To address the tradeoff between a successful delivery ratio and the network overhead,we propose a DTN routing algorithm based on the Markov location prediction model,called the spray and forward routing algorithm(SFR).Based on historical information of the nodes,the algorithm uses the second-order Markov forecasting mechanism to predict the location of the destination node,and then forwards the data by greedy routing,which reduces the copies of packets by spraying the packets in a particular direction.In contrast to a fixed mode where a successful-delivery ratio and routing overhead are contradictory,a hybrid strategy with multi-copy forwarding is able to reduce the copies of the packets efficiently and at the same time maintain an acceptable successful-delivery ratio.The simulation results show that the proposed SFR is efficient enough to provide better network performance than the spray and wait routing algorithm,in scenarios with sparse node density and fast mobility of the nodes.