基于国网规范的无线自组网路由算法改进

微功率无线自组网的研究主要专注于网络层的路由算法,目的是维护传输路径的连通性,保证节点间的高效通信,实现网络的快速组建。提出基于簇的多路径动态路由算法,可改善现国网规范中自组网路由构建缺陷,实现路由开销最小化,适应节点数量大、密度高的网络。     

基于NS2的无线自组织网络路由协议仿真

在无线自组织网络中,由于节点移动,网络拓扑结构变化频繁,所以路由协议的选择一直都是关键问题。该文采用NS2软件对两种主要的协议：动态源路由协议（DSR）和自组网按需距离矢量路由协议（AODV）进行了仿真。并且通过端到端延时、路由开销和分组投递率三种参数在不同条件下的数据对两种协议进行了评估。实验结果表明没有一种协议能够完全适用于自组网,对于特殊环境选择不同协议以满足需要。     

无线传感网络移动分簇路由策略

无线传感网络(WSN)路由协议中,分簇路由具有拓扑管理方便、能量高效和数据融合简单等优点,成为当前重点研究的路由技术。通过研究各种环境下的移动传感器网络,有效地降低能耗则是研究移动无线传感器网络的重要目的之一。针对无线传感网络中移动性问题,基于LEACH协议,利用移动传感器网络中节点距离、速度和剩余能量等因素提出了能量高效的移动分簇路由算法。实验结果表明此算法能够较好地支持节点移动,从而降低网络能耗,延长网络生存时间。     

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

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

EERP:一种能源有效的无线传感器网络路由协议

针对同构无线传感器网络的能源瓶颈问题提出一种能源有效的自适应路由协议,该协议在分布式动态分簇的基础上提出一种班车算法对数据进行逐层汇聚,以减少网络中流动数据包的数量,同时分担簇头节点的计算量。Tossim仿真试验表明该协议能够显著地减少节点的能量开销,提高网络的适应性,有效地延长网络的生命周期。     

基于WiFi的自组织网络路由协议算法研究

以基于WiFi的自组织网络为应用背景,本文利用仿真平台OPNET对四种经典自组网路由协议的性能进行了仿真比较。实验结果表明,反应式路由协议的性能总体优于先应式路由算法,而AODV协议由于其备份路由的特性,性能更优。为满足战场环境下车载自组织网的大规模组网要求,以及火控数据的时延传输要求,结合AODV算法的优势,本文提出了一种新的分层自组网路由算法CRP,其分簇结构的设计减少了网络拓扑变化对寻由过程的影响和路由发现过程中的洪泛开销,加速了路由的查找过程,仿真结果显示该算法的综合性能优于AODV算法及经典分簇路由协议ZRP算法,端到端传输时延明显减小。     

基于IEEE802.11 DCF的链路预先修复AODV路由协议

基于无线自组织网络中普遍使用的底层通信协议IEEE802.11 DCF,针对广泛应用于无线自组织网络中的路由协议(AODV),提出了一种链路预先修复算法。该算法首先推算了DCF协议中的不稳定传输范围,然后通过MAC层与路由层的跨层协作,在下一跳节点移动在不稳定传输范围时就事先采取相应的路由修复措施。相对于AODV中采用节点周期性地发送HELLO消息来监测邻居节点变化的方法,该算法更为高效及时。仿真结果表明,该算法能够有效的减小端到端时延,保障了投递率。     

无线传感器网络簇间节能路由算法

针对基于分簇网络的无线传感器网络簇间路由协议,让簇首和Sink节点直接通信或通过簇首节点转发数据造成能耗不均,节点过早死亡的缺陷。文中提出一种基于网关节点模型的无线传感器网络簇间路由算法,通过簇头与网关节点、网关节点自身建立虚电路,制定存储转发路由,将数据转发给Sink节点。并引入延时等待机制,增强了簇间信息的融合度,此算法适用于大规模无线传感器网络,有良好的可扩展性。仿真表明在能量节省等性能上与传统簇间路由算法相较有较大提高。     

基于跨层的加权自组网路由协议的设计及实现

以优化的链路状态路由（Optimized Link State Routing,OLSR）协议为原型,为无线移动自组织网络（Mobile Ad Hoc Networks,MANETs）设计了基于跨层的速率自适应的加权路由协议。该协议充分考察无线信道的时变性质,在路由计算过程中通过跨层信息共享节点的邻居关系及获取节点的当前发送速率,削减了协议的开销。将无线链路的速率与跳数相结合,设计了一种新的路由度量规则。仿真结果表明,提出的加权路由协议能够显著降低网络层的路由开销,提升网络吞吐量,降低端到端时延。     

Ad hoc网络路由协议的仿真及研究

Adhoc网络是一种由节点任意移动、拓扑结构动态、随机且快速变化的自组网。由于其复杂性和多样性,常规路由无法传输信息。所以自组网路由协议一直是无线网络研究中的热点之一。本文对Adhoc网络目前常用的路由协议在OPNET平台上进行了仿真,通过比较和研究网络吞吐量,延时和路由开销等性能参数分析出各路由协议适应的网络环境。     

基于移动Agent和WSN的突发事件场景数据收集算法研究

该文针对无线传感器网络应用于突发事件监测场景的能量消耗和网络延迟问题,提出了基于移动Agent的无线传感器网络簇式数据收集算法.动态成簇过程基于事件严重程度,并由其决定簇的生命周期和覆盖范围.Sink和簇头之间形成以Sink节点为簇头的虚拟簇.移动Agent迁移路径规划过程中下一跳节点的选取基于节点剩余能量、路径损耗及受刺激强度.移动Agent通过节点遍历的方式完成对所有簇内成员节点信息的收集.仿真结果表明,相对于C/S数据收集模型,基于移动Agent的模型具有更好的节能效果,并能一定程度地减少网络延迟,尤其适用于大规模无线传感器网络应用.     

WSN中动态自适应蚁群路由算法

路由问题是无线传感器网络的核心问题,采用动态自适应调整信息素的蚁群算法,克服了基本蚁群算法的搜索时间过长、易于陷于局部最优解等缺点;同时对无线传感器网络存在的节点能量、传输延时、网络生命周期等问题有明显的改善与提高;最后通过实验仿真证实了该算法的有效性.     

一种用于混合通信网机会式路由选择算法

传统的路由协议都是针对特定的有线或无线网络,仅仅考虑路由的建立过程、路由建立过程中的收敛速度、路由维护的网络开销及路由动态更新时环路的避免等性能。将其用于有线无线混合传输网络会导致较低系统性能。机会式路由选择算法综合分析了无线链路状态和网络时延的影响,得出了各路径优先级的计算表达式,在路由选择时根据各条路径的优先级来选择路由。仿真结果表明,与传统路由算法相比较,该算法能够提高系统吞吐量和减少系统传输时延。     

传感器网络中一种基于估计代价的数据聚合树生成算法

无线传感器网络是一种全新的技术,能够广泛应用于恶劣环境和军事领域.传感器网络在数据收集中,为减少冗余数据的传输耗能,降低延迟,需要采用数据聚合技术.本文采用定向传输方式,在消息路由机制基础上提出了一种基于估计代价的数据聚合树生成算法.该算法主要思想在于将节点能耗、传输距离与聚合收益三方面作为估计代价,优化聚合路径,实现数据聚合在能量与时延上的折中.     

基于LEACH的能量节省路由协议的研究

无线传感器网络由于节点能量的限制,在组网中必须要充分考虑到节点能量的情况,以避免由于节点的能量耗尽,造成网络分割。针对经典无线传感器网络协议LEACH没有考虑节点能量的情况,提出了一种基于LEACH的改进协议。该协议实现了对簇头选择的优化,以及对簇头和基站通信路径的优化。OPNET仿真实验结果表明,该协议能有效地延长网络的生命周期,推迟网络分割的出现。     

无线传感器网络体系结构和关键技术研究

文章介绍了无线传感器网络的体系结构,提出了一种基于跨层设计的管理控制机制;在对无线传感器网络的关键技术,如媒体接入控制(MAC)技术和无线路由协议,分别进行阐述和比较的基础上,提出了一种把简单的IEEE 802 MAC协议应用于无线传感器网络的思想;为了提高系统容量,提出了多信道策略,可以用来有效减少系统碰撞阻塞率,减少接入时延;认为虽然无线传感器网络的应用前景非常广阔,但是仍存在很多问题,除了要尽量减少功耗外,必须提高系统容量,减少碰撞阻塞率,以加快无线传感器网络实用化的进程.     

On-demand coding-aware routing in wireless Mesh networks

Network coding,which exploits the broadcast nature of wireless medium,is an effective way to improve network performance in wireless multi-hop networks,but the first practical wireless network coding system COPE cannot actively detect a route with more coding opportunities and limit the coding structure within two-hop regions.An on-demand coding-aware routing scheme(OCAR)for wireless Mesh networks is proposed to overcome the limitations specified above by actively detecting a route with more coding opportunities along the entire route rather than within two-hop regions.Utilizing more coding opportunities tends to route multiple flows 'close to each other' while avoiding interference requires routing multiple flows 'away from each other'.OCAR achieves a tradeoff by adopting RCAIA as routing metric in route discovery,which is not only coding-aware but also considers both inter and intra flow interference.Simulation results show that,compared with Ad-hoc on-demand distance vecfor routing(AODV)and AODV+COPE,OCAR can find more coding opportunities,thus effectively increase network throughput,reduce end to end delay and alleviate network congestion.     

Performance Analysis of Adaptive Routing Structure for Wireless Sensor Network Based on Load Balancing

Wireless sensor network consists of sensor nodes with battery operated device. The key challenges in the wireless sensor network are energy consumption and routing optimization. This work presents the cluster based load balancing (CBLB) routing protocol. The proposed routing protocol is used to minimize the energy consumption and increase the routing performance. It avoids the routing robustness, delay and increases the delivery rate and network performance. In existing techniques, different routing protocols such as LEACH, HEED and MESTER were used to increase the network performance and to decrease the energy consumption. But these existing techniques did not satisfy the performance requirements of wireless sensor networks. Hence, there is a requirement to develop a technique that meets the QoS requirements and needs of wireless sensor network. The proposed CBLB routing protocol creates a cluster head in the decentralized network and the cluster head will be used to distribute the workload evenly to the cluster members for reducing the energy consumption in wireless sensor network. Experimental results analyze the performance of the proposed protocol with the different existing protocols. The proposed protocol achieves high throughput, delivery rate and reduces the energy consumption, delay and routing overhead.     

A Cross Layer Metric for Discovering Reliable Routes in Mobile Ad Hoc Networks

Host mobility in mobile ad hoc networks causes failure of wireless links between nodes and breaks all the routes that use these links. Consequently, route reconstructions are needed, which is one of the most critical problems for this type of wireless networks. The number of route reconstructions can be reduced if more reliable wireless links are used. Also by these links, stable clusters can be constructed as is needed in cluster based protocols. Reliable routing protocols for mobile ad hoc networks use many link reliability metrics for finding these links; four of the most commonly used are ??Link Expiration Time??, ??Probabilistic Link Reliable Time??, ??Link Packet Error Rate?? and ??Link Received Signal Strength??. It is shown that these metrics enhance the reliability and reduce the number of route reconstructions, but to the best of our knowledge there is no report that compare their efficiencies. In this paper, we make this comparison in different network conditions and discuss their optimal applications. Then, a new cross layer metric is proposed that combines the aforementioned metrics according to their efficiency by means of a unit weight function. Simulation results show that by using all these metrics, the number of route reconstructions is reduced, and for the proposed one the result is better than the others.     

An Analysis of Energy Efficiency Improvement Through Wireless Energy Transfer in Wireless Sensor Network

In a wireless sensor network, wireless Energy transfer is a demanding technology for the energy difficulties in recent times. The foremost disadvantage of presentation is limited duration because WSN contains only restricted battery energy at a node. Therefore, we anticipated cluster-related wireless energy transfer in this document. The foremost intention of the method is to augment the duration of the sensor network through charging by the help of this wireless power transfer technology. So that, mobile charging vehicle (MCV) is established to move within the network and charge the sensor node battery wireless. The sensor nodes in the network are collected as a cluster for energy efficiency. Here, the cluster head is chosen for each one cluster in the network which is based on the rank metric value. Suppose, if one node in the network is reducing its energy, then the CH will send charge request and route ID to the MCV. Afterward, the MCV recognize the node by means of the exacting route and establish to charge the node. The reproduction consequences illustrate that the network lifetime of our anticipated method is enhanced than obtainable method.