Performance evaluation for on-demand routing protocols based on OPNET modules in wireless mesh networks

In wireless networks, users expect to get access to the network securely and seamlessly to share the data flow of access points anytime and anywhere. However, either point-to-point or point-to-multipoint methods in traditional wireless networks make the network bandwidth decrease rapidly, which cannot meet the requirements of users. Recently, a new wireless broadband access network, wireless mesh networks (WMNs), has emerged. As one of the key technologies in WMNs, wireless routing protocols plays an important role in performance optimization of WMNs. Therefore, in this paper, we address the on-demand routing protocols by focusing on dynamic source routing (DSR) protocol and ad hoc on-demand distance vector (AODV) routing protocol in WMNs. Then, we use the OPNET modules to establish the simulation models of DSR and AODV protocols in WMNs. Simulation and results show that, DSR protocol that is based on the dynamic source routing is not suitable for wireless transmission, while AODV routing protocol that is based on the purpose-driven routing is suitable for wireless transmission with rapid change of network topology.     

基于模糊神经网络的稳定AODV协议改进方案

车载自组网的重要特征之一是节点的高移动性。针对节点的自由移动导致链路频繁断裂这一问题,在路由协议中选择稳定链路进行数据传输尤为重要。提出了一种具有链路稳定性的按需距离矢量路由协议（AODV）改进方案,即GF-AODV（AODV with GASA FNN）。该方案在路由发起和选择阶段,使用模糊神经网络对节点信息进行计算,得到节点稳定度以评估链路质量,并均衡考虑链路稳定性与跳数,选出稳定且跳数较小的路径。在路由维护阶段,针对实际环境使用遗传模拟退火算法对模糊神经网络的参数进行实时优化,以确保计算出的节点稳定度符合实际情况。实验表明,GF-AODV相对于AODV在平均时延、包投递率、路由开销等方面均有所改善。     

基于IEEE 802.11的长距离无线Mesh网络

基于IEEE 802.11的长距离无线Mesh网络(LDmesh)的单跳链路长度在几十到上百公里,具有带宽高、成本低、覆盖广等优点,可广泛应用于偏远乡村或人口分布稀疏地区的无线宽带接入等.LDmesh网络是点到点的链路,链路的干扰特性和传输特性与传统无线Mesh网络有显著不同,原有的基于CSMA的MAC协议不再适用,进而影响到上层协议的设计.分析了LDmesh网络的研究进展,从链路性能、MAC协议、路由协议及网络管理等方面深入论述了LDmesh网络面临的挑战和进一步研究方向.     

基于混合无线网状网协议的改进算法研究*

HWMP提供了两种路由模式,分别是以树状路由(TBR)为基础的先应路由模式和以AODV为基础的按需路由模式.然而这个协议存在着许多问题,如可扩展性较差、效率较低、根是网络故障点,当网络业务繁重时,数据包的碰撞和丢失增加.提出一种混合无线网状网协议的改进算法来解决以上问题.在Mesh网络内部.改进后的协议能够使源节点快速...     

多路径DSR和AODV路由协议性能研究

在支持移动节点和自组织网络的路由协议中,最典型的单径路由协议是DSR和AODV协议,对它们进行扩展分别得到相应的多径路由协议。通过仿真比较分析这2种多径路由协议在混合无线Mesh网络和移动AdHoc网络中的性能。结果显示,混合无线Mesh网络中的这2种多径路由协议具有分组传输率高、端到端的平均延时和路由开销小等优点。以DSR协议为基础扩展得到的多径路由协议,在高度动态的网络环境中,性能得到了改善,能广泛应用于移动性强的环境中。     

Optimal phase searching of PTS using modified genetic algorithm for PAPR reduction in OFDM systems

In this paper,a novel genetic algorithm assisted partial transmit sequence(NGA-PTS)is proposed to reduce the peak-to-average power ratio(PAPR)of orthogonal frequency division multiplexing(OFDM).However,the search complexity of the optimum PTS(OPTS)scheme is too large for the typical number of sub-blocks.Therefore,some artificial intelligence methods,such as genetic algorithm technique,and particle swarm optimization,are introduced to reduce the complexity.As traditional GA-PTS(TGA-PTS)technique risks finding a suboptimal solution,how to avoid this disadvantage of TGA-PTS is an interest topic.In order to obtain a better suboptimal solution,a phase factor optimal pair technique and an abandon/introduction new chromosome technique are proposed in GA here.Simulation results show that the proposed scheme achieves a significant improvement over the TGA-PTS scheme in PAPR.Furthermore,by use of the inherent diversity of constellation for each OFDM candidate,in the receiver part,the proposed scheme enables data recovery without any side information.Simulation results show the efficiency of the proposed scheme.     

Profile based routing in vehicular ad-hoc networks

One of the main problems in the VANET(vehicular ad-hoc network)routing algorithms is how to establish the stable routes.The link duration in these networks is often very short because of the frequent changes in the network topology.Short link duration reduce the network efficiency.Different speeds of the vehicles and choosing different directions by the vehicles in the junctions are the two reasons that lead to link breakage and a reduction in link duration.Several routing protocols have been proposed for VANET in order to improve the link duration,while none of them avoids the link breakages caused by the second reason.In this paper,a new method for routing algorithms is proposed based on the vehicles trips history.Here,each vehicle has a profile containing its movement patterns extracted from its trips history.The next direction which each vehicle may choose at the next junction is predicted using this profile and is sent to other vehicles.Afterward each vehicle selects a node the future direction of which is the same as its predicted direction.Our case study indicates that applying our proposed method to ROMSGP(receive on most stable group-path)routing protocol reduces the links breakages and increases the link duration time.     

不同Mac接入机制的AODV路由协议性能分析

为了提高网络的综合性能,充分考虑了数据链路层和网络层的影响因素。对比分析了不同Mac接入协议的切换方法,为无线自组网络选择了一个合适的路由和接入协议。通过在NS-2中仿真Mac层的802.11a和802.11Ext路由场景,对AODV协议的归一化路由开销、路由发现频率、端到端平均时延以及数据分组投递率进行了全面的分析比较。结果表明,802.11Ext接入协议具有明显的优势特点,更加稳定、更适合移动网络。     

AODV算法在视频监控系统中的应用与研究

在Linux嵌入式系统平台上,针对按需距离矢量路由协议AODV算法在无线Mesh网络的应用开发问题,本文采用比较有代表性的UU实现方法,提出了基于Netfilter功能框架的AODV协议在Linux平台上实现的具体方法,在真实的无线网络环境下实现AODV路由协议。将AODV应用开发到嵌入式Linux平台上,并在此基础上用IEEE802.11b标准的网卡组建一个无线自组织网络,从而扩展IEEE802.11的组网方式。最后,在Linux操作系统上实现了AODV路由协议,并通过视频监控系统验证了AODV协议实现的功能与相应的协议标准中所定义的基本功能的一致性。     

基于能量和链路状态的AODV路由请求转发机制研究

按需距离矢量路由算法(AODV)为移动无线自组织网络(Manet)提供了高效的、扩展性能良好的路由解决方案.然而AODV在选择路径时仅以最短路径和最快响应作为度量准则,并未考虑节点能量、负栽以及链路状态等因素,导致得到的路径并非为最优且节点能量消耗不均衡,降低了网络生存时间.在传统AODV算法基础上,提出了一个改进的路由算法,该算法在路由选择时充分考虑了节点的能量、负载以及节点间的链路状态,可以有效提高网络性能并延长网络生存时间.在NS2平台上的仿真实验结果也显示,所提算法在路由负荷、时延、分组传递率以及节能方面均优于传统AODV算法.     

Transmission power and data rate aware routing on wireless networks

Wireless networks can vary both the transmission power and modulation of links. Existing routing protocols do not take transmission power control (TPC) and modulation adaptation (also known as rate adaptation – RA) into account at the same time, even though the performance of wireless networks can be significantly improved when routing algorithms use link characteristics to build their routes. This article proposes and evaluates extensions to routing protocols to cope with TPC and RA. The enhancements can be applied to any link state or distance vector routing protocols. An evaluation considering node density, node mobility and link error show that TPC- and RA-aware routing algorithms improve the average latency and the end-to-end throughput, while consuming less energy than traditional protocols.     

基于EWMA的无线传感器网络路由度量性研究

选择有效的路由量度方法对于提高无线传感器网络的路由性能而言至关重要.本文首先通过实验研究,发现了无线传感器网络的通信链路存在着高丢失率、非对称性等特点,并分析了LQI、RSSI与收包率关系;由此提出了基于EWMA的LETX路由度量算法.最后,将此度量算法应用于AODV协议中,仿真结果表明本文提出的LETX路由量度方法是一种保证可靠性的前提下节省网络能量的量度方法,能够为无线传感器网络高效路由协议的设计提供有价值的参考.     

基于信任感知的无线传感器网络安全路由协议

为提高无线传感器网络的安全性和节能性,提出一种基于信任的安全路由协议TSRP。根据新的直接信任值、间接信任值、挥发因子和剩余能量来计算邻居节点的综合信任值,以评估节点的安全指标,并快速地识别和排除发起黑洞攻击、选择性转发攻击、Hello洪泛攻击和槽洞攻击的恶意节点。sink针对难以发现的虫洞攻击,根据多条链路的链路质量、传输距离和跳数计算出最优路径以保证所选路由的安全性和节能性。仿真结果表明,与AODV和TBSRP相比,TSRP选择的最优路由有效地减少了每个节点的负载,降低了网络的延迟和丢包率。     

OPNET-based modeling and simulation of mobile Zigbee sensor networks

Modeling and simulation can help to validate and evaluate the performance of wireless sensor networks (WSNs) within specific applications. In order to resolve the issue of the restriction on node mobility in existing Zigbee WSN simulation models, this paper proposes a Zigbee compliant new simulation model using the OPNET simulator. Based on the Zigbee MAC layer model in OPNET Modeler, we develop a network layer model and propose an improved AODV routing algorithm to support node mobility, both of which are compatible with Zigbee protocols. We further present in details the structure of the network layer process model and the implementation procedures of its kernel functions. Comprehensive performance comparisons are performed between the proposed model and the Zigbee model in OPNET standard libraries. In order to evaluate the effectiveness of the proposed model in the aspect of node mobility support, time intervals between route failure occurrence and route recovery are measured as well. The experimental results show that the proposed simulation model achieves better performance, compared to the original one. In addition, when node mobility causes routing failures, alternative routes can be established quickly by the proposed model.     

A power efficiency routing and maintenance protocol in wireless multi-hop networks

In wireless multi-hop networks, selecting a path that has a high transmission bandwidth or a high delivery rate of packets can reduce power consumption and shorten transmission delay during data transmission. There are two factors that influence the transmission bandwidth: the signal strength of the received packets and contentions in the contention-based MAC layer. These two factors may cause more power to be consumed during data transmission. We analyze these two factors and propose a power-aware routing protocol called MTPCR. MTPCR discovers the desired routing path that has reduced power consumption during data transmission. In addition to finding a desired path to reduce power consumption, MTPCR also takes into account the situations in which the transmission bandwidth of the routing path may decrease, resulting in much power consumption during data transmission because of the mobility of nodes in a network. MTPCR is thus useful in a network: it analyzes power consumption during data transmission with the help of neighboring nodes, and it uses a path maintenance mechanism to maintain good path bandwidth. The density of nodes in a network is used to determine when to activate the path maintenance mechanism in order to reduce the overhead of this mechanism. With the proposed path maintenance mechanism, power consumption during data transmission can be efficiently reduced, as well as the number of path breakages. In our simulation, we compared our proposed routing protocol, MTPCR, with the following protocols: two classical routing protocols, AODV and DSR; two power-aware routing protocols, MMBCR and xMBCR; and one multiple path routing protocol, PAMP. The comparisons are made in terms of throughput of the routing path, power consumption in path discovery, power consumption in data transmission, and network lifetime.     

基于改进萤火虫群优化的无线自组网路由算法

针对无线自组网络拓扑结构多变、网络生存时间受限及数据包分组传输效率低下等问题,借鉴萤火虫群优化算法,提出了一种改进萤火虫群优化的无线自组网络路由算法.路由算法将萤火虫优化算法中的荧光素强度更新与无线自组网络中的节点移动速度、拥塞程度、节点剩余能量、节点间距离等因素进行相互映射,同时改进萤火虫群优化算法中的搜索萤火虫、驻留萤火虫及回溯萤火虫用于完成无线自组网络中路由协议的路由发现、路由选择及路由维护等过程,整个协议无须传送大量的控制分组,即可实现无线自组网络的稳定传输.仿真实验结果表明,与AODV及基于蚁群优化的路由算法AntRouting协议相比,本文所提出的路由算法在端到端延时、分组数据传输率及网络生存时间上均有良好的性能.     

Modelling and verifying the AODV routing protocol

This paper presents a formal specification of the Ad hoc On-demand Distance Vector (AODV) routing protocol using AWN (Algebra for Wireless Networks), a recent process algebra which has been tailored for the modelling of mobile ad hoc networks and wireless mesh network protocols. Our formalisation models the exact details of the core functionality of AODV, such as route discovery, route maintenance and error handling. We demonstrate how AWN can be used to reason about critical protocol properties by providing detailed proofs of loop freedom and route correctness.     

Scalability of routing methods in ad hoc networks

In an ad hoc network each host (node) participates in routing packets. Ad hoc networks based on 802.11 WLAN technology have been the focus of several prior studies. These investigations were mainly based on simulations of scenarios involving up to 100 nodes (usually 50 nodes) and relaxed (too unrealistic) data traffic conditions. Many routing protocols in such setting offer the same performance, and many potential problems stay undetected. At the same time, an ad hoc network may not want (or be able) to limit the number of hosts involved in the network. As more nodes join an ad hoc network or the data traffic grows, the potential for collisions and contention increases, and protocols face the challenging task to route data packets without creating high administrative load. The investigation of protocol behavior in large scenarios exposes many hidden problems. The understanding of these problems helps not only in improving protocol scalability to large scenarios but also in increasing the throughput and other QoS metrics in small ones. This paper studies on the example of AODV and DSR protocols the influence of the network size (up to 550 nodes), nodes mobility, nodes density, suggested data traffic on protocols performance. In this paper we identify and analyze the reasons for poor absolute performance that both protocols demonstrate in the majority of studied scenarios. We also propose and evaluate restructured protocol stack that helps to improve the performance and scalability of any routing protocol in wireless ad hoc networks.     

基于链路状态加权的无线Mesh网络路由协议

由于无线Mesh网络还没有统一标准,ad hoc中的路由算法并不能完全适合无线Mesh网络.在分析ad hoc中经典路由协议AODV的基础上,结合无线Mesh网络的特点,提出了一种新颖的、基于链路状态加权的路由协议.该协议利用节点的可用带宽、吞吐性能和缓冲队列的饱和度等计算路由每一跳的代价(即权重),选择从信源到信宿累计权重最小的路径作为路由.仿真结果表明,提出的路由协议在数据包转发率、平均端到端延迟和标准化路由负栽等性能上均优于AODV,是一种适合无线Mesh网络的路由协议.     

Dynamic cluster head for lifetime efficiency in WSN

Saving energy and increasing network lifetime are significant challenges in wireless sensor networks （WSNs）. In this paper, we propose a mechanism to distribute the responsibility of cluster-heads among the wireless sensor nodes in the same cluster based on the ZigBee standard, which is the latest WSN standard. ZigBee supports ad hoc on-demand vector （AODV） and cluster-tree routing protocols in its routing layer. However, none of these protocols considers the energy level of the nodes in the network establishing process or in the data routing process. The cluster-tree routing protocol supports single or multi-cluster networks. However, each single cluster in the multi-cluster network has only one node acting as a cluster head. These cluster-heads are fixed in each cluster during the network lifetime. Consequently, using these cluster-heads will cause them to die quickly, and the entire linked nodes to these cluster-heads will be disconnected from the main network. Therefore, the proposed technique to distribute the role of the cluster head among the wireless sensor nodes in the same cluster is vital to increase the lifetime of the network. Our proposed technique is better in terms of performance than the original structure of these protocols. It has increased the lifetime of the wireless sensor nodes, and increased the lifetime of the WSN by around 50% of the original network lifetime.