基于网络编码的无线网络路由协议

基于机会的网络编码方法(COPE)研究网络编码在无线环境中的协议层面上具体实现的问题,但COPE被动地等待编码机会的出现.为了更大限度的提高网络编码的性能,需要将网络编码与无线路由协议相结合来在无线节点上创造出更多的编码机会以减少总的传输次数,以有效的提升网络的吞吐量.当前的编码感知路由算法主要包括基于Markovian路由度量的路由协议、编码感知机会路由协议(CORE)、分布式编码感知路由协议(DCAR)、速率匹配的编码感知多路径路由协议(RCR)、编码感知多路径路由协议(CAMP)等.无线网络内的编码感知路由领域中新型路由度量和跨层设计等问题还需要进一步研究.     

无线mesh网中网络编码感知的按需无线路由协议的研究

提出一个支持无线网络编码技术COPE的按需路由协议OCR,以提高无线mesh网中的网络吞吐量.在路由发现过程中,该协议主动地探测编码机会并灵活地寻求"增加编码机会"、"最短路径"以及"避免拥塞"之间的折衷.仿真结果表明OCR能够有效地发现编码机会,进而使得网络拥有更高的吞吐量.     

基于COPE协议改进的网络编码感知机会路由算法

提出一种网络编码感知机会路由算法,将COPE协议中的机会监听和网络编码技术引入现有的机会路由机制,采用新的路由度量即LQM(链路质量度量)标准来选择备选转发节点集,在确保选择路径的编码机会的同时也在一定程度上保证了链路质量。仿真结果表明,此方法能提高网络的整体吞吐量,增加编码机会,降低平均端到端的时延。     

无线自组织网络中流间网络编码机会发现方法的研究

编码机会对流间网络编码协议的性能具有重要影响,包括AODV在内的大多数距离向量路由协议仅知道针对某个目的节点的一跳邻居信息,无法有效地发现编码机会。针对该问题,从节点需要掌握的网络拓扑信息这一角度,提出了编码机会有效发现的条件并从充分性与必要性两方面进行了分析,然后基于AODV路由协议进行了实现,同时利用真实的网络实验与网络仿真对所提条件进行了验证。实验与仿真结果表明,所提条件是正确的,可以有效地提高无线自组织网络的性能。     

无线Mesh网络可信路由协议THWMP研究

为了使节点在网络中存在恶意节点和自私节点时能够选择安全可靠的路由,降低恶意节点和自私节点对无线Mesh网络带来的影响,文中通过对无线Mesh网络混合路由协议HWMP(Hybrid Wireless Mesh Protocol)和信任模型的研究,提出了基于主观逻辑信任模型的无线Mesh网络可信路由协议THWMP(Trusted HWMP),大大降低了因为信任的传递带来的网络开销,同时保证了路由的可信度。与HWMP路由协议相比较,在网络中存在恶意节点时,THWMP路由协议能够在增加有限的额外开销的情况下保证全网有较高的数据传递成功率和吞吐量。     

基于OPNET的海上无线Mesh网络路由协议的研究与仿真

针对船舶移动和海洋特殊环境本文采用了无线Mesh自组网来实现海上通信.本文首先介绍了Mesh网络的关键技术和OPNET网络仿真平台,然后给出了海上无线Mesh网络架构,最后通过OPNET平台对OLSR协议、DSR协议和AODV协议的时延、投递率和吞吐量进行了仿真分析,得出AODV协议的性能优于其他两种协议,更适合应用于海上通信.     

一种改进无线Mesh网络孤岛效应的路由算法研究

针对无线Mesh网络路由协议自身的缺陷而导致的孤岛效应,分析了其形成原因以及对网络的危害,通过对AODV、DSDV、DSR和TORA等典型路由协议的具体分析,提出动态传输距离算法,整理形成了改进的AODV路由协议,仿真结果表明,改进后的协议能够很好地解决Mesh孤岛效应。     

基于跨层网络编码感知的无线传感器网络节能路由算法研究

编码感知路由可以发现路由中的网络编码机会,减少数据传输次数,提高网络吞吐量,是近年来路由算法研究的一个热点.当前编码感知路由存在编码条件失效、未考虑节点能量的问题,不适合直接应用于无线传感器网络.本文提出基于跨层网络编码感知的无线传感器网络节能路由算法CAER (Cross layer coding Aware Energy efficient Routing).提出并证明了修正后的网络编码条件,以解决编码条件失效问题.基于跨层思想,将网络编码感知机制与拓扑控制、覆盖控制结合,挖掘潜在编码机会.提出综合考虑节点编码机会、节点能量的跨层综合路由度量CCRM (Cross layer Coding aware Routing Metric).仿真结果表明,相比现有编码感知路由,CAER能够提高网络编码感知准确性,增加网络编码机会数量5%~15%,延长网络生存时间8%~12%.     

基于网络编码的无线Mesh网络启发式定向调度算法研究

网络编码技术是近年来网络通信研究领域的一项重大突破,允许网络节点在传统的“存储—转发”基础上参与数据处理,已成为提高网络吞吐量、鲁棒性和可靠性的有效方法。文章结合网络编码机制与定向天线技术,研究无线Mesh网络公平性优化问题。基于跨层设计的思想,文章给出基于网络编码与定向天线的线性规划模型,并进一步提出一种具有定向调度特点的链路调度机信道分配算法。实验仿真结果表明,该算法优于已有SP-omni,COPE,DDSR算法,吞吐量更大,公平性更好。     

无线Mesh网路由协议仿真及性能分析

当前对无线网格网络（Mesh网络）主要研究之一是无线路由技术,即针对无线Mesh网络自身的特点进行路由设计。在熟悉基于Linux平台的网络仿真器（NS2）针对Mesh网络路由协议的仿真过程的基础上,利用NS2网络仿真软件分别从端到端平均时延、分组递交率、归一化路由开销三个方面比较了目前三种典型的路由协议——按需平面距离矢量路由（AODV）、动态源路由（DSR）和目的序列距离矢量路由（DSDV）的性能,并详细介绍了整个仿真过程的步骤。最后,通过分析AODV协议的吞吐量,得出网络最佳容纳的节点数,研究成果对协议的实现具有重要的应用价值。     

无线网络中最小延迟代价网络编码的研究

网络编码能极大地提高网络吞吐量和传输可靠性.编码机会易受到数据包数量不公平性的影响,提出一个具有最小延迟代价的网络编码方法（MDCNC）.首先找到一条固定路由并确定该路由所经过的每一节点的编码能力,然后根据数据流在不同节点处以及不同时隙的可编码情况,灵活地应用该延迟发送策略,以牺牲较小的端到端延迟时间换取更多的编码机会.仿真结果表明,MDCNC能够带来更多的编码机会,进而使网络拥有更高的吞吐量.     

Star-Structure Network Coding for Multiple Unicast Sessions in Wireless Mesh Networks

In this paper, first, we propose Star-NC, a new network coding (NC) scheme for multiple unicast sessions in an n-input n-output star structure. Then, we evaluate the network throughput of this coding scheme in wireless mesh network over the traditional non-NC transmission. Our scheme benefits from the proximity of all the nodes around the relay node and employs a more general form of overhearing different from other schemes such as COPE. We found that the gain of our NC scheme depends on both the star size and the routing pattern of the unicast transmissions. Based on this, we identify both the situations which the maximum gain is achievable and a lower bound for the expected value of the gain in the case of random routing pattern. Next, we propose an analytical framework for studying throughput gain of our Star-NC scheme in general wireless network topologies. Our theoretical formulation via linear programming provides a method for finding source-destination routes and utilizing the best choices of our NC scheme to maximize the throughput. Finally, we evaluate our model for various networks, traffic models and routing strategies over coding-oblivious routing. We also compare the throughput gain of our scheme with COPE-type NC scheme. We show that Star-NC exploits new coding opportunities different from COPE-type NC and thus can be used with or without this scheme. The results show that Star-NC has often better performance than COPE for a directional traffic model which is a typical model in wireless mesh networks. Moreover, we found that, joint Star and COPE-type NC has better throughput performance than each of Star or COPE alone.     

XORs in the Air: Practical Wireless Network Coding

This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our design is rooted in the theory of network coding. Prior work on network coding is mainly theoretical and focuses on multicast traffic. This paper aims to bridge theory with practice; it addresses the common case of unicast traffic, dynamic and potentially bursty flows, and practical issues facing the integration of network coding in the current network stack. We evaluate our design on a 20-node wireless network, and discuss the results of the first testbed deployment of wireless network coding. The results show that using COPE at the forwarding layer, without modifying routing and higher layers, increases network throughput. The gains vary from a few percent to several folds depending on the traffic pattern, congestion level, and transport protocol.      

The Optimization of Combination Scheme in Cooperative Spectrum Sensing Based on the Practical Reporting Frame Format

Wireless mesh networks (WMNs) are emerged as prominent solution to provide seamless connection to the internet. WMNs are typically used for providing broadband wireless internet access to a large number of users and networks. Guaranteeing the quality of service to end users with efficient resource utilization is a challenging issue in WMNs. To accomplish this, we propose a hybrid routing protocol for wireless mesh networks. It is a combination of intra cluster routing protocol (ICR) and inter cluster routing protocol for mesh networks (ICMR). Intra cluster routing protocol is intended to facilitate the communication between mesh clients within a same cluster and inter cluster routing protocol (ICMR) intended to facilitate the communication for mesh clients from different clusters. Intra cluster routing protocol is a proactive type of routing protocol and inter cluster routing protocol is a reactive type of routing protocol. The performance of the proposed protocol is analyzed and the results shown superior performance compared to baseline routing protocols in terms of throughput, end to end delay, packet delivery ratio and jitter.     

CLEAR: A Cross-Layer Enhanced and Adaptive Routing Framework for Wireless Mesh Networks

Wireless Mesh Networks (WMNs) provide a new and promising solution for broadband Internet services. The distinguishing features and the wide range of WMNs’ applications have attracted both academic and industrial communities. Routing protocols play a crucial role in the functionality and the performance of WMNs due to their direct effect on network throughput, connectivity, supported Quality of Service (QoS) levels, etc. In this paper, a cross-layer based routing framework for multi-interface/multi-channel WMNs, called Cross-Layer Enhanced and Adaptive Routing (CLEAR), is proposed. This framework embodies optimal as well as heuristic solutions. The major component of CLEAR is a new bio-inspired routing protocol called Birds’ Migration Routing protocol (BMR). BMR adopts a newly developed routing metric called Multi-Level Routing metric (MLR) to efficiently utilize the advantages of both multi-radio/multi-channel WMNs and cross-layer design. We also provide an exact solution based on dynamic programming to solve the optimal routing problem in WMNs. Simulation results show that our framework outperforms other routing schemes in terms of network throughput, end-to-end delay, and interference reduction, in addition to being the closest one to the optimal solution.     

基于MAODV无线Mesh网多播路由协议的优化

针对无线Mesh网(WMNs)现有的路由协议不能很好地解决多播视频业务对时延的要求,以Ad hoc网络中多播路由协议MAODV为基础,结合无线网络拓扑的动态变化,在WMN下提出一种基于路径优化的ROMAODV(Routing Optimization-MAODV)路由算法.此算法以很小的优化开销获得延时的大幅度减小,仿...     

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.     

无线网络编码增益感知的低时延路由协议

降低无线网络数据包传递时延对实时应用有重要的意义.该文提出了一种编码增益的计算方法和编码图的简化方法,并基于此提出了编码增益感知的路由协议CGAR(Coding Gain Aware Routing).CGAR利用网络编码增益和无线链路的期望传输次数ETX(Expected Transmission Count)计算传递一个来自新流的数据包所需要的时间,并以此为选路度量,旨在降低数据传递时延.仿真试验表明,CGAR的时延优于COPE和DCAR协议.     

Stable‐path multi‐channel routing with extended level channel assignment

Wireless mesh networks (WMNs) have gained considerable popularity in recent times thanks to their self‐healing, self‐organizing, and self‐configuring nature. Because of their ability to provide high throughput and minimum packet delay, WMNs are considered to be favorable for broadband applications. For such applications, WMNs employ multiple channels, which give rise to issues like channel assignment, load balancing, and interference avoidance. Most of these issues fall into two broad categories, namely routing and channel assignment. For routing, we propose a novel proactive protocol, the stable‐path multi‐channel routing protocol (SMRP). Our proposed solution, to address channel assignment, is the extended level‐based channel assignment (ELCA) scheme. SMRP is designed to work in combination with ELCA in order to minimize interference and balance the load among the underlying nodes. Simulation results show enhanced throughput and minimal packet delay as compared with the contemporary schemes. Copyright © 2011 John Wiley & Sons, Ltd.     

Unified routing protocol based on passive bandwidth measurement in heterogeneous WMNs

The past few years have witnessed a surge of wireless mesh networks (WMNs)‐based applications and heterogeneous WMNs are taking advantage of multiple radio interfaces to improve network performance. Although many routing protocols have been proposed for heterogeneous WMNs, most of them mainly relied on hierarchical or cluster techniques, which result in high routing overhead and performance degradation due to low utilization of wireless links. This is because only gateway nodes are aware of all the network resources. In contrast, a unified routing protocol (e.g., optimal link state routing (OLSR)), which treats the nodes and links equally, can avoid the performance bottleneck incurred by gateway nodes. However, OLSR has to pay the price for unification, that is, OLSR introduces a great amount of routing overhead for broadcasting routing message on every interface. In this paper, we propose unified routing protocol (URP), which is based on passive bandwidth measurement for heterogeneous WMNs. Firstly, we use the available bandwidth as a metric of the unification and propose a low‐cost passive available bandwidth estimation method to calculate expected transmission time that can capture the dynamics of wireless link more accurately. Secondly, based on the estimated available bandwidth, we propose a multipoint relays selection algorithm to achieve higher transmission ability and to help accelerate the routing message diffusion. Finally, instead of broadcasting routing message on all channels, nodes running URP transmit routing message on a set of selected high bandwidth channels. Results from extensive simulations show that URP helps improve the network throughput and to reduce the routing overhead compared with OLSR and hierarchical routing. Copyright © 2016 John Wiley & Sons, Ltd.