多跳无线网络中基于网络编码的多路径路由

提出了一种基于网络编码的多路径路由机制CAMP(network coding-aware multi-path routing).该机制能够根据路径的可靠性和编码机会,动态地在多条路径上进行数据包的传输.CAMP的路由发现机制能够向源节点返回多条可能的路径以及各条路径的每条边上的ETX(expected transmission count).与以往的多路径路由机制不同, CAMP可以通过转换它的传输路径来动态地创造而非仅仅等待编码机会.利用这一独特的路由机制,CAMP可以让多条路径分摊网络流量负载,并且最大化路径转换收益,从而改进网络的吞吐量.实验结果表明,在无线网络的数据传输过程中,CAMP能够取得比其他路由机制高得多的网络吞吐量.     

Energy-efficient dynamic resource allocation with opportunistic network coding in OFDMA relay networks

Network coding is significantly able to save system resources for wireless networks, and has been widely studied for the 802.11 wireless local area network and traditional cellular networks. The relay technology was introduced in 802.16j, 802.16m, and Long Term Evolution-Advanced (LTE-A) standards. Recently, the application of network coding to multi-hop wireless relay networks has been taken into consideration. Although the introduction of relay stations (RSs) may bring more energy consumption, it provides opportunities for network coding to save spectrum resources. Nevertheless, the benefits of network coding are diminished by high multiuser diversity based on orthogonal frequency division multiple access (OFDMA). For ensuring the superiority, network coding is performed opportunistically according to the channel state. Hence dynamic resource allocation (DRA) subject to rate constraints is combined with the idea of opportunistic network coding to minimize the total transmission power in a frame. A fixed set of discrete modulation levels in an OFDMA relay system is also considered. By taking the characteristic of a half-duplex decode-and-forward (DF) mode relay, a solution is proposed for the optimal problem of each subframe after separating power-aware relay selection. Simulation results show that DRA with opportunistic network coding can improve system energy efficiency. Further, it is more efficient for saving energy than DRA with static network coding compared solely to DRA.     

无线协作网络中的能量有效性中继选择算法

研究了无线协作网络中的中继选择问题,允许中继具有缓存数据的能力,提出了一种带有buffer的能量有效性中继选择算法,以延长网络生命周期并提高系统吞吐量。该算法综合考虑链路信息,中继的队列状态以及节点的剩余能量信息,通过加权效用公式选择最优接收数据中继与最优发送数据中继。考虑源节点与中继节点间的功率分配,以降低因源节点到中继节点以及中继节点到目的节点间的信道速率不一致所引起的系统丢包率。仿真实验结果表明,该算法有效地延长了网络的生命周期,随着中继个数的增加网络吞吐量有明显的提高,考虑功率分配后,有效降低了系统丢包率。     

Network coding for unicast in a WiFi hotspot: Promises,challenges, and testbed implementation

In offices and residential buildings, WiFi networks have become a primary means for providing Internet access to wireless devices whose dominant traffic pattern is unicast. In the meantime, the emergence of network coding has brought about great promises for multicast in communication networks where intermediate nodes are allowed to process independent incoming information flows. Little is known about network coding for unicast, however. The objective of this paper is thus to depart from multicast scenarios and shed light on several possible unicast scenarios to which network coding may be applied in a WiFi hotspot in order to obtain communication benefits such as throughput gain, fairness, and reduced protocol complexity. We identify five representative scenarios in which network coding may be used to benefit unicasting in a WiFi hotspot. Several open research issues and practical challenges related to each scenario are discussed individually. To illustrate the benefits of network coding for unicast in a WiFi hotspot, we propose and implement iCORE: The interface COoperation Repeater-aided network coding Engine. iCORE is a practical system in which multi-channel multi-radio repeaters are used to relay unicast traffic for those terminals sitting far away from an access point and suffering from weak signals at a WiFi hotspot. It is based on our last scenario which illustrates the synergy among network coding, opportunistic routing, and interface management. Utilizing idle wireless interfaces and listening to traffic opportunistically, iCORE allows packets to move across the interfaces and to be coded across flows whenever it sees more transmission opportunities. We evaluate iCORE on a four-node chain-like topology testbed implemented using IEEE 802.11b/g radios and compare it to MORE – the state-of-art intra-flow network coding implementation based on opportunistic routing. Our experimental results reveal promising gains in terms of throughput over MORE.     

Interference aware resource allocation for hybrid hierarchical wireless networks

This paper addresses the problem of interference aware resource allocation for OFDMA based hybrid hierarchical wireless networks. We develop two resource allocation algorithms considering the impact of wireless interference constraints using a weighted SINR conflict graph to quantify the interference among the various nodes: (1) interference aware routing using maximum concurrent flow optimization; and (2) rate adaptive joint subcarrier and power allocation algorithm under interference and QoS constraints. We exploit spatial reuse to allocate subcarriers in the network and show that an intelligent reuse of resources can improve throughput while mitigating interference. We provide a sub-optimal heuristic to solve the rate adaptive resource allocation problem. We demonstrate that aggressive spatial reuse and fine tuned-interference modeling garner advantages in terms of throughput, end-to-end delay and power distribution.     

一种正交混合空时网络编码的中继通信算法

针对无线通信网络中频谱利用效率较低以及网络吞吐量不足等问题,提出一种正交混合空时网络编码的中继通信算法(QHNR)。该算法通过系统模型分析了在传输周期中的MAC阶段和BC阶段中的中继通信方式以及节点发送数据的出错率,采用分级增益的方法来提高信道利用效率,提升系统性能,并通过中继概率来选择较好的中继节点。通过网络吞吐量和网络功率分配情况来分析QHNR算法的性能。实验仿真结果表明,QHNR算法在提高网络吞吐量,提升信道利用效率上,相比采用TWR通信方案和MWR通信方案具有更好的效果。     

无线Mesh网中编码感知组播路由协议CAMR

网络编码是一种能够提高网络吞吐量的新技术,将网络编码应用于无线Mesh网组播对Mesh网络进一步实用化有重要意义.编码感知路由是一种能够充分识别和利用网络中的编码机会的路由.虽然已有若干个基于网络编码的单播路由协议,但无线网络中编码机会并没有被充分利用,到目前为止还没有无线Mesh网络中的编码感知组播路由协议.提出一个编码感知组播路由协议CAMR(coding-aware multicast routing).CAMR协议利用了一个新奇的编码感知路由度量CAM(coding-awarerouting metric),可以度量无线Mesh网络中节点的实际编码机会和编码能力的大小.基于CAM设计的CAMR协议可以充分利用无线Mesh网络中节点的编码机会,提高了无线Mesh网络组播的吞吐量.模拟实验验证了CAMR协议的优势及其有效性.     

Interworking wireless mesh networks: Problems,performance characterization,and perspectives

Wireless broadband networks based on the IEEE 802.11 technology are being increasingly deployed as mesh networks to provide users with extended coverage for wireless Internet access. These wireless mesh networks, however, may be deployed by different authorities without any coordination a priori, and hence it is possible that they overlap partially or even entirely in service area, resulting in contention of radio resources among them. In this paper, we investigate the artifacts that result from the uncoordinated deployment of wireless mesh networks. We use a network optimization approach to model the problem as resource sharing among nodes belonging to one or different networks. Based on the proposed LP formulation, we then conduct simulations to characterize the performance of overlaying wireless mesh networks, with the goal to provide perspectives for addressing the problems. We find that in a system with multiple overlaying wireless mesh networks, if no form of inter-domain coordination is present, individual mesh networks could suffer from capacity degradation due to increased network contention. One solution toward addressing the performance degradation is to “interwork” these wireless mesh networks by allowing inter-domain traffic relay through provisioning of “bridge” nodes. However, if such bridge nodes are chosen arbitrarily, the problems of throughput sub-optimality and unfairness may arise. We profile the impact of bridge node selection and show the importance in controlling network unfairness for wireless mesh network interworking. We conclude that mesh network interworking is a promising direction to address the artifacts due to uncoordinated deployment of wireless mesh networks if it is supplemented with appropriate mechanisms.     

Routing Internet traffic in heterogeneous mesh networks: Analysis and algorithms

In practical wireless mesh networks (WMNs), gateways are subject to hard capacity limits on the aggregate number of flows (in terms of bit rate) that they can support. Thus, if traffic is routed in the mesh network without considering those constraints, as well as the traffic distribution, some gateways or intermediate mesh routers may rapidly get overloaded, and the network resources can be unevenly utilized. To address this problem, in this paper we firstly develop a multi-class queuing network model to analyze feasible throughput allocations, as well as average end-to-end delay, in heterogeneous WMNs. Guided by our analysis, we design a Capacity-Aware Route Selection algorithm (CARS), which allocates network paths to downstream and upstream Internet flows so as to ensure a more balanced utilization of wireless network resources and gateways’ fixed connections. Through simulations in a number of different network scenarios we show that the CARS scheme significantly outperforms conventional shortest path routing, as well as an alternative routing method that distributes the traffic load on the gateway nodes to minimize its variance.     

OFDMA for wireless multihop networks: From theory to practice

Orthogonal Frequency-Division Multiple Access (OFDMA) enables nodes to exploit spatial diversity in Wireless Mesh Networks (WMNs). As a result, throughput improves significantly. While existing work often considers the physical layer only, using OFDMA in a WMN also affects the link and network layers. In particular, multi-hop forwarding may result in severe bottlenecks since OFDMA resource allocations are typically based on local information only. In this paper, we design a practical system that mitigates such bottlenecks. To this end, we allow for resource allocation based on channel and traffic conditions at the physical layer, per-subcarrier coding at the link layer, and per-subcarrier packet segmentation at the network layer. We implement our approach on software-defined radios and show that it provides significant throughput gains compared to traditional schemes.     

A unified approach of energy and data cooperation in energy harvesting WSNs

Energy harvesting (EH) provisioned wireless sensor nodes are key enablers to increase network life time in modern wireless sensor networks (WSNs). However, the intermittent nature of the EH process necessitates management of nodes’ limited data and energy buffer capacity. In this paper, a unified mathematical model for a cooperative EHWSN with an opportunistic relay is presented. The energy and data causality constraints are expressed in terms of throughput, available energy, delay and transmission time. Considering finite energy buffers, data buffers and discrete transmission rates (as defined in the standard IEEE 802.15.4) at the nodes, different intuitive online power allocation policies at the relay are studied. The results show that a policy achieving high throughput is less fair and vice versa. Therefore, a joint rate and power allocation policy (JRPAP) is proposed in this study which provides a better trade off between fairness, throughput and energy over intuitive policies. Based on the JRPAP results, we propose to use data aggregation (DA) to achieve throughput gain at lower buffer sizes. In addition, the notion of energy aggregation (EA) is introduced to achieve throughput gain at higher buffer sizes. Combining both EA and DA further improves the overall throughput at all buffer sizes.     

一种多中继协作系统中功率优化分配策略的无线网络容量算法研究

针对限制网络容量的主要因素（信道带宽与信道信噪比）,本文提出了一种多中继协作系统中功率优化分配策略的无线网络容量算法。首先,论文提出采用多中继协作的方式,提高网络传输速率,建立网络最大流数学模型。然后,在网络总功率受限的情况下,对中继节点进行功率优化分配,建立最大化网络容量计算数学模型。最后,论文建立网络仿真环境,对比多中继协作且能量优化分配与非中继协作且能量等分两种策略在中断概率、网络容量等方面的表现。得出如下结论：网络容量随节点数量增加呈现先增后减的趋势,多中继协作且能量优化分配策略更加有利于提高无线网络容量。     

A hierarchical architecture for detecting selfish behaviour in community wireless mesh networks

Wireless mesh networks (WMNs) consist of dedicated nodes called mesh routers which relay the traffic generated by mesh clients over multi-hop paths. In a community WMN, all mesh routers may not be managed by an Internet Service Provider (ISP). Limited capacity of wireless channels and lack of a single trusted authority in such networks can motivate mesh routers to behave selfishly by dropping relay traffic in order to provide a higher throughput to their own users. Existing solutions for stimulating cooperation in multi-hop networks use promiscuous monitoring or exchange probe packets to detect selfish nodes and apply virtual currency mechanism to compensate the cooperating nodes. These schemes fail to operate well when applied to WMNs which have a multi-radio environment with a relatively static topology. In this paper we, propose architecture for a community WMN which can detect selfish behaviour in the network and enforce cooperation among mesh routers. The architecture adopts a decentralized detection scheme by dividing the mesh routers into manageable clusters. Monitoring agents hosted on managed mesh routers monitor the behaviour of mesh routers in their cluster by collecting periodic reports and sending them to the sink agents hosted at the mesh gateways. To make the detection more accurate we consider the quality of wireless links. We present experimental results that evaluate the performance of our scheme.     

RBC-OLSR: Reputation-based clustering OLSR protocol for wireless ad hoc networks

We consider the problem of assuring the trustworthiness (i.e. reliability and robustness) and prolonging the lifetime of wireless ad hoc networks, using the OLSR routing protocol, in the presence of selfish nodes. Assuring the trustworthiness of these networks can be achieved by selecting the most trusted paths, while prolonging the lifetime can be achieved by (1) reducing the number of relay nodes (MPR) propagating the topology control (TC) messages and (2) considering the residual energy levels of these relay nodes in the selection process. In this paper, we propose a novel clustering algorithm and a relay node selection algorithm based on the residual energy level and connectivity index of the nodes. This hybrid model is referred to as H-OLSR. The OLSR messages are adapted to handle the cluster heads election and the MPR nodes selection algorithms. These algorithms are designed to cope with selfish nodes that are getting benefits from others without cooperating with them. Hence, we propose an incentive compatible mechanism that motivates nodes to behave truthfully during the selection and election processes. Incentive retributions increase the reputation of the nodes. Since network services are granted according to nodes’ accumulated reputation, the nodes should cooperate. Finally, based on nodes’ reputation, the most trusted forwarding paths are determined. This reputation-based hybrid model is referred to as RH-OLSR. Simulation results show that the novel H-OLSR model based on energy and connectivity can efficiently prolong the network lifetime, while the RH-OLSR model improves the trustworthiness of the network through the selection of the most trusted paths based on nodes’ reputations. These are the two different processes used to define the reputation-based clustering OLSR (RBC-OLSR) routing protocol.     

Fundamental limits on end-to-end throughput of network coding in multi-rate and multicast wireless networks

This paper investigates the interaction between network coding and link-layer transmission rate diversity in multi-hop wireless networks. By appropriately mixing data packets at intermediate nodes, network coding allows a single multicast flow to achieve higher throughput to a set of receivers. Broadcast applications can also exploit link-layer rate diversity, whereby individual nodes can transmit at faster rates at the expense of corresponding smaller coverage area. We first demonstrate how combining rate-diversity with network coding can provide a larger capacity for data dissemination of a single multicast flow, and how consideration of rate diversity is critical for maximizing system throughput. Next we address the following question: given a specific topology of wireless nodes, what is the maximum rate that can be supported by the resultant network exploiting both network coding and multi-rate? We present a linear programming model to compute the maximal throughput that a multicast application can achieve with network coding in a rate-diverse wireless network. We also present analytical results where we observe noticeably better throughput than traditional routing. This suggests there is opportunity for achieving higher throughput by combining network coding and multi-rate diversity.     

Multi-hop multicast path construction in modern wireless relay networks

In recent years, multicast over wireless access networks has become a popular research topic. However, if relay nodes are supported in such a network, forming an efficient multicast topology becomes a challenging task. Since existing works fail to solve this problem satisfyingly, we in this paper propose a multi-hop multicast routing scheme for modern wireless relay networks. First, we formulate this important problem as Multi-Hop Multicast Maximization (MHMM), which involves forming a resource allocation of the base-station and relay stations in order to maximize the number of recipients with the given resource budget and channel conditions. To solve MHMM, we propose a heuristic called Multi-Hop Path Selection (MHPS). We prove that MHMM is NP-complete, and also analyze MHPS’s computational complexity and its worst-case performance. The results of simulations conducted to evaluate the heuristic’s performance demonstrate that, under variant conditions, MHPS utilizes bandwidth resources and relay nodes effectively such that it significantly outperforms all existing approaches. Moreover, its performance difference to the optimum is bounded. To the best of our knowledge, MHPS is the only scheme that focuses on this important issue and achieves such a satisfactory performance.     

Packet scheduling with joint design of MIMO and network coding

In this paper, we propose a joint design of MIMO technique and network coding (MIMO-NC) and apply it to improve the performance of wireless networks. We consider a system in which the packet exchange among multiple wireless users is forwarded by a relay node. In order to enjoy the benefit of MIMO-NC, all the nodes in the network are mounted with two antennas and the relay node possess the coding capability. For the cross traffic flows among any four users, the relay node not only can receive packets simultaneously from two compatible users in the uplink (users-to-relay node), but also can mix up distinct packets for four destined users into two coded packets and concurrently send them out in the same downlink (relay node-to-users), so that the information content is significantly increased in each transmission. We formalize the problem of finding a schedule to forward the buffered data of all the users in minimum number of transmissions in such a system as a problem of finding a maximum matching in a graph. We also provide an analytical model on maximum throughput and optimal energy efficiency, which explicitly measures the performance gain of the MIMO-NC enhancement. Our analytical and simulation results demonstrate that system performance can be greatly improved by the efficient utilization of MIMO and network coding opportunities.     

On the credit evolution of credit-based incentive protocols in wireless mesh networks

In designing wireless mesh networks (WMNs), incentive mechanisms are often needed so to encourage nodes to relay or forward packets for other nodes. However, there is a lack of fundamental understanding on the interactions between the incentive mechanisms and the underlying protocols (e.g., shortest-path routing, ETX routing or back-pressure scheduling), and whether integration of these protocols will lead to a robust network, i.e., networks can sustain a given traffic workload. The objective of this paper is to present a general mathematical framework via stochastic difference equations to model the interaction of incentive mechanisms and various underlying protocols. We first present a credit evolution model to quantify the expected credit variation of each node in WMN, then use the norm of the expected credits variation to quantify the credit disparity. We also propose the use of differentiated pricing and show how it can achieve credit equality among nodes, resulting in a more robust network under different traffic loading. Our analytical framework can help researchers to model other incentive/routing protocols so to analyze the robustness of the underlying networks.     

一种最大化网络吞吐量的认知无线Ad Hoc网络跨层优化算法

认知无线Ad hoc网络(cognitive wireless ad hoc networks)是由一组具有认知决策能力的节点以多跳无线方式组成的智能网络.网络容量的求解与网络吞吐量的优化是该类网络研究的难点.作者首先推导了混叠模式下认知无线Ad hoc网络容量上界的闭合表达式,并指出该上界只与用户空间分布特性相关;然后提出了一种新的基于遗传算法的跨层优化算法,通过联合优化邻居选择与功率分配实现网络吞吐量的最大化;最后仿真验证了该算法的有效性,结果表明网络吞吐量能较好地逼近网络容量上界.     

OFDMA 协同网络中基于QoS 保证的资源分配算法

针对正交频分多址(OFDMA)协作通信系统,为了解决数据传输速率最大化并提供尽力而为业务与实时业务的服务质量(QoS)保证问题,提出新型资源分配算法.通过以总功率受限为约束条件,定义基于数据速率、时延和丢包率的效用函数,并以在协作传输中以最大化效用函数为目标进行中继选择和子载波分配.通过中继和用户上的子载波和功率分配方案的设计,从而最大化网络数据传输速率并最小化时延与丢包率,为多种业务提供服务质量保证.采用最优化理论与方法求解效用函数,得到了资源分配结果.仿真结果验证了算法收敛,并给出功率分配结果,以及网络吞吐量和时延性能指标情况,验证了算法的有效性.