一种动态传感网络中的新型路由算法

随着无线传感网络技术和其应用领域的不断发展,网络模型趋于动态化,网络节点具有移动性,这给路由算法设计带来新的挑战。该文介绍动态叶子树网络模型,针对没有定位信息的场景提出适合动态网络的DLR路由算法。该算法包含路径相似度计算以及最佳路径选择2个步骤。仿真模拟表明,DLR路由算法能够在动态网络中保证超过90%的通信可靠性。     

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

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

基于流量预测的无线mesh网络负载均衡路由协议

提出了一种基于神经网络预测模型的无线mesh网络负载均衡协议NNP-L2MPM。协议根据网络中泛洪的HELLO包计算路径质量,从而选择出到达目的节点的最优下一跳,并以MAC层接口队列长度作为流量负载的衡量依据,然后利用RBF神经网络预测模型对mesh网路中的节点流量负载进行预测,根据预测的下一时刻的流量负载优化路径质量,提前实现路由更新,避免中间节点发生拥塞,进而提高网络性能。仿真结果表明:与原有路由协议相比,所提协议在数据包投递率上提高了约9%,平均端到端延时降低了约16%。     

无线mesh传感器网络跨层路由算法

针对无线mesh传感器网络的需求,提出一种综合量度的跨层路由协议H工.S。算法H工S利用底层的链路质 量信息、MAC层时隙分配信息,结合跳数对备选路径做出综合判断,避开质量较差的链路和负载较重的节点。路由发 现过程中在中间节点设置链路质量和节点负载阂值,并根据相关信息进行延时转发操作,以减少不必要的路由开销。 在路由维护阶段使用主动和被动相结合的方式全面检测路由路径。NS2的仿真结果表明,HLS协议在吞吐量、端到 端时延以及网络生存时间上有更好的表现。     

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

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

结合距离与队列积压的无线Mesh网络拥塞感知路由协议

针对无线Mesh网络中路由的拥塞问题,提出了一种结合距离与队列积压信息的拥塞感知路由协议(DR-CAR)。首先,结合链路质量源路由(LQSR)协议中的距离度量和E-Backpressure协议中的队列积压度量构建一种新的链路质量度量。然后,每个节点通过探测数据包来计算链路质量,并通过控制数据包和其邻居节点进行交互,以此来更新链路质量。最后,节点根据链路质量来选择下一跳节点,从而构建从源节点到目的节点之间的最佳路径。另外,在MAC层中为控制数据包分配最高的优先级,同时保证控制数据包的安全性。仿真实验表明,在不同的链路负载下,该协议在网络传输时延和网络吞吐量方面都具有优越的性能,具有可行性和有效性。     

基于路径质量的无线传感网路由协议

基于跳数的无线传感器网络路由协议因实现简单、延迟少和易维护等优点,一直以来受到广泛关注。在分析现有基于跳数的路由协议的基础上,对最小跳数路由算法的选路标准进行了改进,提出了一种基于路径质量的无线传感网路由协议,采用跳数、综合链路质量和节点能量作为路径质量的度量指标。使用OMNET++网络仿真软件进行了仿真实验,实验结果表明：改进后的路由协议有效地提高了网络分组的投递率,降低了网络的能耗。     

Reliable and Energy-Efficient Routing for Static Wireless Ad Hoc Networks with Unreliable Links

Energy efficient routing and power control techniques in wireless ad hoc networks have drawn considerable research interests recently. In this paper, we address the problem of energy efficient reliable routing for wireless ad hoc networks in the presence of unreliable communication links or devices or lossy wireless link layers by integrating the power control techniques into the energy efficient routing. We consider both the case when the link layer implements a perfect reliability and the case when the reliability is implemented through the transport layer, e.g., TCP. We study the energy efficient unicast and multicast when the links are unreliable. Subsequently, we study how to perform power control (thus, controlling the reliability of each communication link) such that the unicast routings use the least power when the communication links are unreliable, while the power used by multicast is close to optimum. Extensive simulations have been conducted to study the power consumption, the end-to-end delay, and the network throughput of our proposed protocols compared with existing protocols.     

Joint scheduling and routing algorithm with load balancing in wireless mesh network

Wireless mesh network (WMN) is a promising solution for last mile broadband internet access. Mesh nodes or mesh routers are connected via wireless links to form a multi-hop backbone infrastructure and improving throughput is the primary goal. While previous works mainly focused on either link level protocol design or complex mathematical model, in this paper, we investigate the performance gains from jointly optimizing scheduling and routing in a multi-radio, multi-channel and multi-hop wireless mesh network. Then, two optimization objectives are addressed by considering wireless media contention and spatial multiplexing. The first objective is to maximize throughput by exploiting spatial reuse while the second one is to ensure fairness among different links. We design a cross-layer algorithm by considering both MAC layer and network layer. Simulation results show that our joint optimization algorithm can significantly increase throughput as well as fairness.     

Route Maintenance in IEEE 802.11 wireless mesh networks

In this paper, we propose a novel Route Maintenance scheme for IEEE 802.11 wireless mesh networks. Despite lack of mobility and energy constraints, reactive routing protocols such as AODV and DSR suffer from frequent route breakages in 802.11 based infrastructure wireless mesh networks. In these networks, if any intermediate node fails to successfully transmit a packet to the next hop node after a certain number of retransmissions, the link layer reports a transmission problem to the network layer. Reactive routing protocols systematically consider this as a link breakage (and therefore a route breakage). Transmission failures can be caused by a number of factors e.g. interference or noise and can be transient in nature. Frequent route breakages result in significant performance degradation. The proposed mechanism considers multiple factors to differentiate between links with transient transmission problems from those links which have permanent transmission problems and takes a coherent decision on link breakage. The proposed mechanism is implemented in AODV for single-radio single-channel mesh network and an extension is incorporated in multi-radio multi-channel scenarios. Simulation results show substantial performance improvement compared to classical AODV and local route repair schemes.     

A genetic algorithm-based system for wireless mesh networks: analysis of system data considering different routing protocols and architectures

Wireless mesh networks (WMNs) are attracting a lot of attention from wireless network researchers. Node placement problems have been investigated for a long time in the optimization field due to numerous applications in location science. In our previous work, we evaluated WMN-GA system which is based on genetic algorithms (GAs) to find an optimal location assignment for mesh routers. In this paper, we evaluate the performance of four different distributions of mesh clients for two WMN architectures considering throughput, delay and energy metrics. For simulations, we used ns-3, optimized link state routing (OLSR) and hybrid wireless mesh protocols (HWMP). We compare the performance for Normal, Uniform, Exponential and Weibull distributions of mesh clients by sending multiple constant bit rate flows in the network. The simulation results show that for HWM protocol the throughput of Uniform distribution is higher than other distributions. However, for OLSR protocol, the throughput of Exponential distribution is better than other distributions. For both protocols, the delay and remaining energy are better for Weibull distribution.     

End-to-end performance aware association mechanism for wireless municipal mesh networks

In a wireless municipal mesh (muni mesh) network, a client station (STA) needs to associate with a mesh access point (MAP) for network access. Previous association mechanisms assume high-speed backhaul and only the access link being the bottleneck. This assumption holds for most WLANs, but in wireless mesh networks traffic could be bottlenecked either by the access link or by the bandwidth-limited wireless backhaul. In this paper, we propose a new joint MAP association mechanism for wireless muni mesh networks to improve STA’s end-to-end communication performance. A STA makes its association decision by jointly considering the quality of the access link between the STA and the associated MAP as well as the cost of the multi-hop path from the associated MAP to the Internet gateway. In addition, we design two new metrics, Contention Aware Expected Transmission Time (CAETT) and Load Aware Expected Transmission Time (LAETT), to measure the access link quality. The main strength of CAETT is incorporating the impact of 802.11 MAC layer contentions on the bandwidth sharing of multi-rate stations. LAETT further captures the real traffic load on the shared medium. In order to reduce the association delay, we use an analytical model to derive a hybrid measurement/estimation method to enable a station to quickly determine the cost of CAETT and LAETT. We conduct extensive simulations to evaluate the performance of the proposed joint MAP association mechanism. Especially within the joint association framework, we investigate the impact of various combinations of access link metrics (RSSI, PB, CAETT, LAETT) and backhaul routing metrics (hopcount, ETT, RALA) on the system performance. We show that the joint association mechanism can significantly improve the network performance in terms of throughput and delay by up to 100%. In particular, the joint association mechanism with LAETT as the access link metric and RALA as the routing metric outperforms other schemes and metrics.     

基于探测的多信道无线网状网机会路由算法

多信道无线网状网的性能在很大程度上依赖于信道分配和路由选择.现有的多信道无线网状网路由大多没有考虑信道之间的干扰问题,从而导致通信性能下降.针对这一问题,提出一种基于探测的多信道无线网状网机会路由(POR)算法.首先,根据干扰能量,选出最佳通信信道集来降低信道间的传榆干扰.在此基础上,采用探测方式计算路径期望传输时延,确定候选链路集并运用机会路由机制进行数据传输以最小化端到端的传输时延.实验结果表明,POR可以显著地降低平均端到端时延,提高数据包投递率,为数据传输提供实时性和可靠性保证.     

Survivable millimeter-wave mesh networks

Millimeter-wave mesh networks have the potential to provide cost-effective high-bandwidth solutions to many current bandwidth-constrained networks including cellular backhaul. However, the availability of such networks is severely limited due to their susceptibility to weather, such as precipitation and humidity. In this paper, we present a rigorous approach to survivable millimeter-wave mesh networks based on experimentation, modeling, and simulation. Individual link performance is characterised using frame error-rate measurements from millimeter-wave transmissions on test links over a period of one year. A geometric model based on radar-reflectivity data is used to characterise rain storms and determine their impact on spatially correlated links of a mesh network. To mitigate the impact of link impairments on network services, we present two cross-layered routing protocols to route around the failures: P-WARP (predictive weather-assisted routing protocol) and XL-OSPF (cross-layered open shortest-path first). We conduct a performance analysis of the proposed mesh network under the presence of actual weather events as recorded by the US National Weather Service. Results show that the proposed approach yields the highest dependability when compared against existing routing methods.     

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

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

多信道无线Mesh网络负载均衡路由算法研究

针对无线网状网的网络容量问题,在多信道无线网状网模型的基础上,利用线性规划公式对无线网状网的路由问题进行描述,在此基础上提出了一个负载均衡的路由算法,在对业务请求的路由跳步数进行约束的前提上,通过减少网络链路上的负载,达到提高网络的吞吐量的目的。仿真结果表明,提出的算法能显著提高网络性能。     

自组网环境下基于模糊控制的自适应动态源路由协议

自组网是由一组带有无线收发装置的移动节点组成的一个能够支持多跳的临时性的计算机通信网络，大多数节点是由有限寿命的电池来提供的，因此能量保护策略成为设计该类网络路由协议的一个重要依据．同时，拓扑的动态变化是该类网络的另一主要特征，它将影响路由的稳定性．通过对节点当前剩余电池能量和邻居节点之间链路稳定性的观察，并使用模糊逻辑控制策略，文中提出了一种基于动态源路由的自适应路由协议，仿真表明该协议有效地延长了网络的生存时间，并提高了报文提交率．     

Lifetime maximizing dynamic energy efficient routing protocol for multi hop wireless networks

Energy efficiency is recognized as a critical problem in wireless networks. Many routing schemes have been proposed for finding energy efficient routing paths with a view to extend lifetime of the networks – however it has been observed that the energy efficient path depletes quickly. Further, an unbalanced distribution of energy among the nodes may cause early death of nodes as well as network. Hence, balancing the energy distribution is a challenging area of research in wireless networks. In this paper we propose an energy efficient scheme that considers the node cost of nodes for relaying the data packets to the sink. The node cost considers both the remaining energy of the node as well as energy efficiency. Using this parameter, an energy efficient routing algorithm is proposed which balances the data traffic among the nodes and also prolongs the network lifetime. Simulation shows that proposed routing scheme improves energy efficiency and network lifetime than widely used methods viz., Shortest Path Tree (SPT) and Minimum Spanning Tree (MST) based PEDAP, Distributed Energy Balanced Routing (DEBR) and Shortest Path Aggregation Tree Based Routing Protocol.     

一种基于方向天线和时间同步机制的多信道无线网状网MAC协议

在城市小区和广阔的农村建立低成本的无线网状网,为无线终端用户提供高速的接入服务,是一项极具现实意义的工作.设计了一种适合于此类网络的MAC层协议称为Mesh-MAC,该协议建立在已有的IEEE 802.11硬件产品基础上,每两个节点之间的通信是由一对方向天线完成,通过一种全新的时间同步方案,可以实现M ESH网内高效的数据转发.仿真结果表明,与IEEE 802.11及2P协议相比,Mesh-MAC协议在吞吐量和端到端传输延时等方面,都有明显的改善.     

无线传感器网络单跳扩展增强树型路由协议研究

增强树型路由协议是最近提出的无线传感器网络路由协议,除了使用父子链路,当前路由决策节点通过和其一跳邻居节点之间建立增强链路形成比树型路由更短的路由捷径。为了尽可能多地发掘出潜在的路由捷径,提出了单跳扩展增强树型路由协议,该协议在增强树型路由协议的基础上把当前路由决策节点的单跳父亲节点和儿子节点及它们的邻居节点也考虑进路由决策过程中,可选路由捷径范围不再局限于当前路由决策节点及其一跳邻居之间的增强链路,而是向上扩展到其父亲节点及其一跳部居以及向下扩展到其儿子节点及其一跳邻居之间所形成的增强链路。该协议选择最短的路由捷径发送数据包。给出了单跳扩展增强树型路由协议的判定过程,并将该协议应用到ZigBee网络中。仿真结果显示,该协议在路由跳数和能量消耗这两项网络性能上比树型路由和增强树型路由均有提高。