基于流间编码的机会路由转发节点集选择算法

针对流间网络编码与机会路由结合时编码机会与转发节点数目之间的矛盾,提出一种基于流间网络编码的机会路由转发节点集选择算法FNSA。采用发送可变长报文探测包的方法获取更加准确的数据包成功发送概率,定量分析链路数据成功传输概率、传输次数和转发节点的个数之间的关系,确立最佳转发节点数目,选取最佳转发节点集。将该算法应用于编码感知机会路由协议CAOR,仿真实验结果表明,采用定长探测包时(α=0),网络吞吐量性能有约5%的提升;采用可变长报文探测包时(α=0.1),网络吞吐量性能有约9%的提升。     

低开销的无线网络编码机会路由协议设计

针对基于无线Mesh网络编码的机会路由协议的节点转发冗余问题,从线性空间的角度对该类协议的信息传输过程进行建模与分析,提出一种基于动态冗余控制的无线Mesh网络编码机会路由协议。该协议利用零空间确认技术估计各节点的更新信息总量,根据更新总量动态调整节点转发冗余,通过引入转发优先级调度机制,避免不同的转发节点重复转发来自于相同线性空间的编码包。仿真实验结果显示,与经典的MORE协议相比,该协议能提高30％-100％的网络吞吐量,同时降低20％-45％的归一化开销。     

应用累积系数确认的网络编码机会路由协议

在无线mesh网络中,机会路由通过高效使用无线传输的广播特性显著地提高了无线网络的吞吐量.引入网络编码,使得机会路由协议可以避免复杂的调度,更加易于实现.然而,网络编码的引入给机会路由协议带来新的问题：转发节点应该发送多少编码包?MORE等协议依据平均链路状况信息来预计节点转发编码包数目的方法,无法准确判定发送的冗余.以CCACK为代表的研究采用逐跳反馈的方式来减少编码包的冗余发送.首先,针对采用正交向量确认的CCACK机制进行分析,说明了CCACK尽管可以减少确认开销,减少误判,但却带来了“信息空间已覆盖而无法正交”的漏判问题.在此基础上,提出了一种基于累积编码系数反馈确认的网络编码机会路由协议CFACK.该确认机制中转发节点通过侦听下游节点的编码系数向量,并与来自上游节点的编码系数向量进行相关性分析,从而获知下游节点信息是否覆盖自身信息.证明了在无差错网络环境下该确认机制不存在误判和漏判的可能,同时,在有差错网络环境下对该确认机制的有效性进行了分析.结果表明：在一般节点分布情况下,利用额外的一次携带确认,可以确保90%以上的准确性.仿真测试结果表明：CFACK相比CCACK,显著提高了网络的吞吐量,平均提高率为72.2%,同时在编码计算、存储和包头开销上都少于CCACK.     

针对大规模无线多跳网络的鱼眼机会路由协议

考虑到无线网络中广播特性、丢包特性、节点移动等对网络性能的影响,提出一种针对大规模无线多跳网络的鱼眼机会路由协议。在机会路由的基础上加入鱼眼技术,减少链路状态更新信息。在鱼眼路由表中加入链路传输概率,得到转发列表,并且简化机会路由协议的报文头结构,从而实现高效的数据传输。NS2仿真结果表明,该协议能降低网络端到端延时,提高网络吞吐量。     

无线链路质量突变性感知的机会路由协议

现有无线链路空间相关性感知的机会路由度量无法感知链路突变性。针对该问题,提出了能够同时感知无线链路空间相关性和突变性的机会路由测度μETX。在此基础之上,提出了基于μETX的机会路由算法ORALB。ORALB充分利用了无线链路空间的相关性,选择相关性较低的节点作为转发节点集;同时又能感知无线链路突变性,避免了选择传输开销较高的无线链路。仿真结果表明,与其他相关机会路由相比,ORALB可以有效减小数据包的传输开销,提高传输可靠性。     

基于节点编码感知的机会转发路由协议

针对现有考虑节点编码机会的编码感知路由协议Ex CAR(a coding-aware routing protocol termed extended coding aware routing)在无线链路不稳定的情况下转发节点集内的节点在计算编码机会时可能产生误判,以及在转发节点集内选择最优编码节点时需要交换大量的数据包缓存信息会导致较大的端到端时延和网络开销等问题,提出一种适用于多跳无线网络的节点编码感知机会转发路由协议NAOFP(node network coding aware opportunistic forwarding routing protocol)。NAOFP协议通过引入基于侦听概率的附加ID信息添加机制和转发节点集的最优转发节点选择机制,提高了网络吞吐量和编码包的解码成功率,减小了数据包的平均端到端时延。仿真结果表明,与Ex CAR协议相比,NAOFP协议在网络吞吐量、平均端到端时延、编码包的解码成功率等方面的性能均得到了有效的改善。     

无线Mesh网中网络编码感知的低时延路由

网络编码技术可以显著提高无线Mesh网的传输性能.为此,提出一个在组播通信中基于网络编码的无线Mesh网低时延传输路由.文中引入了关键节点和超关键节点的概念和相应的选取算法.该协议以下一跳的节点是否是超关键节点或关键节点作为路由判据,下一跳的路由节点优先选择超关键节点,其次选关键节点,最后才选普通节点,这样可以增加网络编码机会,实现低时延路由.通过举例、性能分析和仿真实验表明,该协议能更好地支持网络编码,在提高组播吞吐量的前提下,显著减少了传输时延.     

一种基于相交多径网络编码模型的无线传感网多径路由协议

将网络编码技术应用到无线传感器网络中以提高网络的传输效率是近年来国内外研究的一大热点,相交多径网络编码模型是一种具有高可靠性的基于网络编码的多径路由模型,而目前将相交多径网络编码模型应用在无线传感网的多径路由协议中的研究并不多。通过使用基于地理位置划分虚拟网格的方法设计了一种相交多径网络编码模型的路由协议BRGNC(Braided multipath Routing protocol based on Grid with Network Coding)。在路由过程中先根据网格的能量情况、链路质量、节点个数等因素选择下一跳网格,再通过网格内节点状态选择“最优的”转发节点集,从而降低了以往按照相交多径网络编码模型建立无线传感网的多径路由协议的难度。仿真实验结果表明,该协议具备较好的可靠性和能耗均衡性,在网络规模较大、链路状态较差的情况下也能够很好地保证数据的可靠传输。     

无线网络链路质量感知的机会网络编码机制

现有的无线网络编码机制大多没有考虑无线链路质量对于通信性能的影响,导致网络吞吐量降低。针对这一问题,提出一种链路质量感知的机会网络编码机制(LONC)。该机制充分利用无线媒介的共享特性,将网络编码和机会转发技术相结合,通过期望传输次数来计算数据包传输效用值,用于衡量数据包传输效率。在此基础上,根据效用值动态分配数据包调度优先级,使得高优先级的数据包有更高的概率获得转发机会,从而有利于提高网络吞吐量。仿真结果表明,LONC机制能够显著提高网络的吞吐量,在一定程度上保证了数据的可靠传输。     

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

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

Optimal opportunistic routing and network coding for bidirectional wireless flows

There is growing interest in recent years in routing methods for wireless networks that leverage the broadcast nature of the wireless medium and the ability of nodes to overhear their neighbors’ transmissions. Such methods include opportunistic routing (OR), which generally choose the next hop on a routing path only after the outcome of the previous transmission is known; and wireless network coding (NC), which linearly combines packets from different flows coexisting in the network. In this paper, we study the potential benefits of forwarding schemes that combine elements from both the OR and NC approaches, when traffic on a bidirectional unicast connection between two nodes is relayed by multiple common neighbors. We present a theoretically optimal scheme that provides a lower bound on the expected number of transmissions required to communicate a packet in both directions as a function of link error probabilities, and demonstrate that this bound can be up to 20% lower than with either OR or NC employed alone even in a small network. Using simulation, we further explore the control overhead in a direct implementation of the scheme with a simple coordination mechanism and show that the optimal bound can be closely approached for a wide range of link error rates.     

MAC-layer proactive mixing for network coding in multi-hop wireless networks

Network coding is a recent research topic in wireless networking. By combining multiple packets in a single broadcast transmission, network coding can greatly improve the capacity of multi-hop wireless networks. Packet mixing, when applied with traditional routing, can only be performed at the junctions of the paths determined by the routing module. This limits significantly the coding opportunities in the network. This paper presents a novel MAC-layer mixing method, named BEND, which proactively seizes opportunities for coding. Without relying on fixed forwarders, BEND allows each node in the neighborhood to be a potential coder and forwarder and coordinates their packet transmissions for higher coding gain. By taking advantage of redundant copies of a packet in the neighborhood coding repository, the number of mixing points, and thus the coding opportunities, can be significantly increased. This high coding gain is verified by our simulation studies.     

Heuristic routing with bandwidth and energy constraints in sensor networks

Most of the routing algorithms devised for sensor networks considered either energy constraints or bandwidth constraints to maximize the network lifetime. In the real scenario, both energy and bandwidth are the scarcest resource for sensor networks. The energy constraints affect only sensor routing, whereas the link bandwidth affects both routing topology and data rate on each link. Therefore, a heuristic technique that combines both energy and bandwidth constraints for better routing in the wireless sensor networks is proposed. The link bandwidth is allocated based on the remaining energy making the routing solution feasible under bandwidth constraints. This scheme uses an energy efficient algorithm called nearest neighbor tree (NNT) for routing. The data gathered from the neighboring nodes are also aggregated based on averaging technique in order to reduce the number of data transmissions. Experimental results show that this technique yields good solutions to increase the sensor network lifetime. The proposed work is also tested for wildfire application.     

网络编码下不可靠自组织网络高效路由算法

无线自组织网络(wireless ad hoc network)中链路的不可靠性与高丢包率是影响网络性能和应用的主要缺陷.为了优化多跳的不可靠无线网络中完成数据传输所需的数据分组发送次数,提出了融合路径切换思想的基于网络编码的路由协议(network coding routing with path switching,简称NCPS).为了发现潜在的适合网络编码的路径,首先分析并提出了网络中路径可编码与可解码条件;其次对比于传统的最优路径,分析得出了在网络编码下路径切换所能获取的编码收益;最后以优化网络中数据分组发送次数为目标,设计了网络编码下结合路径切换的路由协议.实验结果表明,在不同的网络环境参数下,NCPS能够有效减少网络中的数据发送次数,获取稳定的编码收益.     

A Light-Weight Opportunistic Forwarding Protocol with Optimized Preamble Length for Low-Duty-Cycle Wireless Sensor Networks

In wireless sensor networks, sensed information is expected to be reliably and timely delivered to a sink in an ad-hoc way. However, it is challenging to achieve this goal because of the highly dynamic topology induced from asynchronous duty cycles and temporally and spatially varying link quality among nodes. Currently some opportunistic forwarding protocols have been proposed to address the challenge. However, they involve complicated mechanisms to determine the best forwarder at each hop, which incurs heavy overheads for the resource-constrained nodes. In this paper, we propose a light-weight opportunistic forwarding (LWOF) scheme. Different from other recently proposed opportunistic forwarding schemes, LWOF employs neither historical network information nor a contention process to select a forwarder prior to data transmissions. It confines forwarding candidates to an optimized area, and takes advantage of the preamble in low-power-listening (LPL) MAC protocols and dual-channel communication to forward a packet to a unique downstream node towards the sink with a high probability, without making a forwarding decision prior to data transmission. Under LWOF, we optimize LPL MAC protocol to have a shortened preamble (LWMAC), based on a theoretical analysis on the relationship among preamble length, delivery probability at each hop, node density and sleep duration. Simulation results show that LWOF, along with LWMAC, can achieve relatively good performance in terms of delivery reliability and latency, as a receiver-based opportunistic forwarding protocol, while reducing energy consumption per packet by at least twice.     

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

机会路由和网络编码是近几年出现的两项新技术,它们能使有损网络达到较高的吞吐量.然而,已有的研究两者大多是分离的,这样不能同时发挥两者的优势.提出了一种基于网络编码的无线网络机会路由算法- MinACK( Minimum ACKnowledgement),它结合了机会路由和网络编码各自的优势,能够在网络中同时传输多个段的...