Hop-by-hop Content Distribution with Network Coding in Multihop Wireless Networks

The predominant use of today's networks is content access and distribution. Network Coding (NC) is an innovative technique that has potential to improve the efficiency of multicast content distribution over multihop Wireless Mesh Networks (WMNs) by allowing intermediate Forwarding Nodes (FNs) to encode and then forward data packets. Practical protocols are needed to realize the benefits of the NC technique. However, the existing NC-based multicast protocols cannot accurately determine the minimum number of coded packets that a FN should send in order to ensure successful data delivery to the destinations, so that many redundant packets are injected into the network, leading to performance degradation. In this paper, we propose HopCaster, a novel reliable multicast protocol that incorporates network coding with hop-by-hop transport. HopCaster completely eliminates the need for estimating the number of coded packets to be transmitted by a FN, and avoids redundant packet transmissions. It also effectively addresses the challenges of heterogeneous multicast receivers. Moreover, a cross-layer multicast rate adaptation mechanism is proposed, which enables HopCaster to optimize multicast throughput by dynamically adjusting wireless transmission rate based on the changes in the receiver population and channel conditions during the course of multicasting a coded data chunk. Our evaluations show that HopCaster significantly outperforms the existing NC-based multicast protocols.     

基于合作分集的新型自动重传协议

研究了一种基于合作分集的新型链路层自动重传协议——合作ARQ协议,传输错误的数据包将由一个中继节点进行重传。根据接收端处理重传数据包的不同方式,探讨了2种协议:1)合作简单ARQ协议,目的节点在收到重传的数据包之后丢弃原始的数据包;2)合作混合ARQ协议,目的节点将重传的数据包和原始数据包进行分集合并。分析了独立慢衰落信道下合作ARQ协议性能,仿真成果证明,合作ARQ协议相比传统ARQ协议能够降低链路层的丢包率,提高了系统的传输性能。     

Practical relay networks: a generalization of hybrid-ARQ

Wireless networks contain an inherent distributed spatial diversity that can be exploited by the use of relaying. Relay networks take advantage of the broadcast-oriented nature of radio and require node-based, rather than link-based protocols. Prior work on relay networks has studied performance limits either with unrealistic assumptions, complicated protocols, or only a single relay. In this paper, a practical approach to networks comprising multiple relays operating over orthogonal time slots is proposed based on a generalization of hybrid-automatic repeat request (ARQ). In contrast with conventional hybrid-ARQ, retransmitted packets do not need to come from the original source radio but could instead be sent by relays that overhear the transmission. An information theoretic framework is exposed that establishes the performance limits of such systems in a block fading environment, and numerical results are presented for some representative topologies and protocols. The results indicate a significant improvement in the energy-latency tradeoff when compared with conventional multihop protocols implemented as a cascade of point-to-point links.     

Delay Models of Single-Source Single-Relay Cooperative ARQ Protocols in Slotted Radio Networks With Poisson Frame Arrivals

In conventional (noncooperative) automatic repeat request (ARQ) protocols for radio networks, the corrupted data frames that cannot be correctly decoded at the destination are retransmitted by the source. In cooperative ARQ protocols, data frame retransmissions may be performed by a neighboring node (the relay) that has successfully overheard the source's frame transmission. One advantage of the latter group of ARQ protocols is the spatial diversity provided by the relay. The first delay model for cooperative ARQ protocols is derived in this paper. The model is analytically derived for a simple set of retransmission rules that make use of both uncoded and coded cooperative communications in slotted radio networks. The model estimates the delay experienced by Poisson arriving frames, whose retransmissions (when required) are performed also by a single relay. Saturation throughput, data frame latency, and buffer occupancy at both the source and relay are quantified and compared against two noncooperative ARQ protocols.     

Robust VB 2D-CELP image transmission over CDMA Rayleigh fading channels

This paper describes a new error resilient analysis-by-synthesis coding scheme and its application for robust still image transmission over CDMA Rayleigh fading channels. For the purpose of providing reliable transmission, a type-I hybrid ARQ protocol is used in a concatenated Reed–Solomon/convolutional coding scheme. However, for delay-constrained applications, the protocol is used with a limited number of retransmissions in addition to limited RS interleaving. Results of coded images are provided for the uplink of a communication system, where a slowly Rayleigh fading channel is considered.     

A spread slotted CDMA/ALOHA system with hybrid ARQ for satellitemultiple access

We propose and investigate a new type of satellite multiple access protocol that combines the characteristics of the spread slotted (SS)-ALOHA protocol, code division multiple access (CDMA), and the hybrid automatic repeat request (ARQ) error controlling and retransmission scheme, in order to increase the throughput by reducing the number of retransmissions and to keep the bit error rate (BER) of the satellite link low when the channel experiences heavy traffic. The main feature of our proposed system is the utilization of two different fields in the analysis of the satellite multiple access problem. Since the hub now possesses the forward error correction (FEC) capability to correct errors that appear after the CDMA despreading of the packets, the satellite does not need to ask so often for the retransmission of erroneous packets and will ask for retransmission only when the FEC error correcting capability is exceeded. This paper also presents the adaptive optimization of the balance between the CDMA processing gain and FEC coding gain in order to obtain a better throughput for the SS-CDMA/ALOHA with hybrid ARQ protocol for satellite multiple access. The optimization is made with the constraint of keeping the bandwidth of the transmitted packets constant during all times. According to this, the effective throughput of the protocol (information bits over total transmitted bits ratio) is improved by adaptively changing the CDMA and FEC codes used in the transmission. This adaptive optimization is done by observing the channel status or load and increasing or decreasing both coding schemes' gains. Computer simulations show the performance of the proposed multiple access scheme     

Ad Hoc网络中一种具有优先控制的自适应协同MAC协议

ARQ(Auto Repeat reQuest)机制通常用来在传输失败后重传数据,但是在深衰落信道下,源节点多次重传有可能导致系统性能持续变坏,作为未来无线通信的重要技术,协同通信能够大大提高链路的可靠性,可以有效解决上述问题。本文针对Ad Hoc网络,提出了一种基于优先控制的自适应协同MAC(Media Access Control)协议。此协议采用ARQ机制,根据瞬时信道情况,自适应地选择信道质量更好的中继节点来重传数据,并且在优化的退避算法和中继选择算法的控制下,赋予中继节点相对源节点更高的优先级,协议中还在传统RTS/CTS分组交互基础上加入了新的握手交互机制,使得协议的性能进一步提升。本文还对经典二维Markov模型进行了改进,加入了协同机制并提出中继节点冲突模型,对所提协议进行了建模并推导出了吞吐量性能表达式。仿真结果表明,本文所提协议相对IEEE 80211 DCF协议和传统采用ARQ机制的协同MAC协议有着更好的性能。
      

Single-User Broadcasting Protocols Over a Two-Hop Relay Fading Channel

A two-hop relay fading channel is considered, where only decoders possess perfect channel state information (CSI). Various relaying protocols and broadcasting strategies are studied. The main focus of this work is on simple relay transmission scheduling schemes. For decode-and-forward (DF) relaying, the simple relay cannot buffer multiple packets, nor can it reschedule retransmissions. This gives rise to consideration of other relaying techniques, such as amplify-and-forward (AF), where a maximal broadcasting achievable rate is analytically derived. A quantize-and-forward (QF) relay, coupled with a single-level code at the source, uses codebooks matched to the received signal power and performs optimal quantization. This is simplified by a hybrid amplify-QF (AQF) relay, which performs scaling, and single codebook quantization on the input. It is shown that the latter is optimal by means of throughput on the relay-destination link, while maintaining a lower coding complexity than the QF setting. A further extension of the AQF allows the relay to perform successive refinement, coupled with a matched multilevel code. Numerical results show that for high signal-to-noise ratios (SNRs), the broadcast approach over AF relay may achieve higher throughput gains than other relaying protocols that are numerically tractable     

Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters]

An efficient policy allocation algorithm for the transmission of embedded bit streams over noisy channels with feedback is proposed. The transmission is based on the type- II hybrid ARQ/FEC protocol and uses a nested sequence C of channel codes to protect the packets. There are also constraints on the total bit budget and on the allowed number of retransmissions per packet. The allocation algorithm assigns different protection policies, each policy being a subset of C, to different packets to maximize the average number of correctly received source bits. We study the performance and the complexity of the proposed scheme through the transmission of images encoded by JPEG2000 over mobile channels with correlated Rayleigh fading. We demonstrate by simulations that the proposed multiplepolicy scheme provides significant improvements over a purely FEC scheme with no feedback and also the existing fixed-policy schemes. Our results show that feedback is particularly helpful for poor channel conditions and that the proposed scheme is very robust against changes in the channel signal-to-noise ratio (SNR) and the mobile speed.     

A hybrid network coding technique for single-hop wireless networks

In this paper, we investigate a hybrid network coding technique to be used at a wireless base station (BS) or access point (AP) to increase the throughput efficiency of single-hop wireless networks. Traditionally, to provide reliability, lost packets from different flows (applications) are retransmitted separately, leading to inefficient use of wireless bandwidth. Using the proposed hybrid network coding approach, the BS encodes these lost packets, possibly from different flows together before broadcasting them to all wireless users. In this way, multiple wireless receivers can recover their lost packets simultaneously with a single transmission from the BS. Furthermore, simulations and theoretical analysis showed that when used in conjunction with an appropriate channel coding technique under typical channel conditions, this approach can increase the throughput efficiency up to 3.5 times over the automatic repeat request (ARQ), and up to 1.5 times over the HARQ techniques.     

Cross‐layer design for MIMO systems over spatially correlated and keyhole Nakagami‐m fading channels

Cross‐layer design is a generic designation for a set of efficient adaptive transmission schemes, across multiple layers of the protocol stack, that are aimed at enhancing the spectral efficiency and increasing the transmission reliability of wireless communication systems. In this paper, one such cross‐layer design scheme that combines physical layer adaptive modulation and coding (AMC) with link layer truncated automatic repeat request (T‐ARQ) is proposed for multiple‐input multiple‐output (MIMO) systems employing orthogonal space‐‐time block coding (OSTBC). The performance of the proposed cross‐layer design is evaluated in terms of achievable average spectral efficiency (ASE), average packet loss rate (PLR) and outage probability, for which analytical expressions are derived, considering transmission over two types of MIMO fading channels, namely, spatially correlated Nakagami‐m fading channels and keyhole Nakagami‐m fading channels. Furthermore, the effects of the maximum number of ARQ retransmissions, numbers of transmit and receive antennas, Nakagami fading parameter and spatial correlation parameters, are studied and discussed based on numerical results and comparisons. Copyright © 2009 John Wiley & Sons, Ltd.     

Erasure coding for reliable adaptive retransmission in wireless broadcast/multicast systems

In this paper, we present new adaptive automatic repeat request (ARQ) schemes for wireless broadcast/multicast combining erasure coding (EC) and packet retransmission. Traditional approaches rely on retransmitting the lost packets in a point-to-point or point-to-multipoint mode. The main idea behind the presented protocols is to retransmit adaptive combinations of the lost packets using EC, which can help several receivers to recover the lost information with fewer retransmission attempts. We propose two versions of EC-based ARQ protocols, and investigate theoretically the corresponding transmission bandwidths in different contexts. We show through simulation results the efficiency of the proposed protocols with respect to conventional ARQ strategies and new published ARQ works for broadcast/multicast. Finally, a new sliding window NACK feedback policy is presented for the case of a high number of receivers to avoid the feedback implosion problem.     

Power control and capacity analysis for a packetized indoormultimedia DS-CDMA network

This paper proposes a packetized indoor wireless system using direct-sequence code-division multiple-access (DS-CDMA) protocol. The indoor radio environment is characterized by slow Rayleigh fading with or without lognormal shadowing. The system supports multimedia services with various transmission rates and quality of service (QoS) requirements and allows for seamless interfacing to asynchronous transfer mode (ATM) broadband networks. All packets are transmitted with forward error correction (FEC) using convolutional code for voice packets and Bose-Chaudhuri-Hocquenghem (BCH) code for data packets with an automatic retransmission request (ARQ) protocol and for video packets without ARQ. A queueing model is used for servicing data transmission requests. A power control algorithm is proposed for the system, which combines closed-loop power control with channel estimation to give the best performance. The cell capacity of each traffic type and various multimedia traffic configurations in both single-cell and multiple-cell networks are evaluated theoretically under the assumption of perfect power control. The effect of power control imperfection on the capacity using the proposed power control algorithm is investigated by computer simulation     

协同分集和截断ARQ在单中继无线网的使用：一种交互层研究

该文着重研究了无编码两跳中继网中考虑各节点的最大传输次数受限时的一种交互层协同设计,提出了两种类型的简单自适应中继协同策略以探索一种合并的空间分集与时间分集.分析与计算机仿真表明:在非对称的多跳无线网和块衰落信道下,尽管基于截断ARQ (Automatic Repeat Request)的重传将带来一定的平均吞吐量下降,但该协同策略在实现有效的天线与能量共享的同时,也显著地改善了系统的帧误码性能.     

Performance Analysis of Cooperative ARQ with Code Combining over Nakagami-m Fading Channels

This paper presents the performance of cooperative ARQ schemes in Nakagami-m fading networks, where coherent equal gain code combining is adopted to combine the retransmitted signals at the destination. Two different retransmission protocols are adopted upon the reception failure of the destination. Once the relay node can decode correctly, the retransmission will be performed by relay in protocol I or the better node between source and relay in protocol II, where the better means having a better channel to the destination. By approximating the product of two independent Nakagami-m random variables to the sum of two independent gamma random variables, the performance of protocol I is derived at high signal-to-noise ratio (SNR). We further develop the approximation for the product of two maximum Nakagami-m random variables, which is employed to obtain the performance of protocol II at high SNR. The reliability of theoretical analysis is validated by simulation results, where the advantages of these two protocols upon the conventional protocols are presented.     

Hierarchical constellation for multi-resolution data transmission over block fading channels

We propose a new technique for multi-resolution video/image data transmission over block fading channels. The proposed scheme uses an adaptive scheduling protocol employing a retransmission strategy in conjunction with a hierarchical signal constellation (known also as nonuniform, asymmetric, multi-resolution constellation) to give different transmission priorities to different resolution levels. Transmission priorities are given in terms of average packet loss rate as well as average throughput. Basically, according to the transmission scheduling and channel state (acknowledgment signal) of the previous transmission, it dynamically selects packets from different resolution levels to transmit for the current transmission. The bits from the selected packets are assigned to different hierarchies of a hierarchical 4/16-quadrature amplitude modulation to transmit them with different error protections. The selection of packets for transmission and the assignment of these selected packets to different hierarchies of the hierarchical constellation are referred to as the scheduling protocol in our proposed scheme. We model this protocol by a finite state first order Markov chain and obtain the packet loss rate and the packet transmission rate over Nakagami-m block fading channel in closed-form. Some selected numerical results show that the proposed scheme can control the relative packet loss rate and the packet transmission rate of different resolution levels by varying the priority parameter (or equivalently, the asymmetry) of the hierarchical constellation and the maximum number of allowed retransmissions.     

中继协作多播网络中基于最小集合覆盖的编码重传方案

为提高单中继协作多播传输效率,本文提出一种基于最小集合覆盖的分类网络编码重传方案.该方案充分利用中继节点协作传输的优势,将接收端的丢包按中继节点的接收状态分为两类,并按类先后进行编码重传.在各类丢包内部,根据对应的状态反馈矩阵寻找编码机会生成编码包,并将编码包的选择过程抽象为集合覆盖问题,通过求最小集合覆盖使重传次数逼近最小值.此外,在不增加所得前类编码包数的前提下,利用两类丢包之间的编码机会进一步生成新编码包,以减少重传编码包数,从而提高重传效率.分析与仿真结果表明了该方案的有效性.     

An efficient MAC protocol for cooperative diversity in mobile ad hoc networks

Cooperative diversity is proposed to combat the detrimental effects of channel fading. In this paper, we investigate the effectiveness of cooperative diversity in interference limited ad hoc networks. The negative effects due to relay blocking on the network throughput are investigated. We show that the relay blocking problem is mainly dependent on the relay selection criterion. To overcome this problem, we propose a new cooperative diversity technique based on a modified IEEE 802.11 Medium Access Control (MAC) protocol. The throughput performance of the proposed MAC protocol is analyzed using a random structured network where nodes are assumed to be equipped with multiple antennas. In our simulations, we consider both single‐ and multiple‐relay scenarios over fading channels. Copyright © 2007 John Wiley & Sons, Ltd.     

An end-to-end multipath smooth handoff scheme for stream media

Supporting transmission of stream media over wireless mobile networks is often difficult because packets may be lost due to the rerouting of packets during handoff, and also because bursts of packet loss may occur during handoff due to the disparity in the amount of available bandwidth among different cells. In this paper, we propose an end-to-end multipath handoff scheme that provides smooth handoff for stream media in wireless networks with different amounts of available bandwidth from cell to cell. In the proposed scheme, multiple paths are established during handoff to reach a mobile destination node. The stream media sources are equipped with an adaptive multilayer encoder, and important layers in the encoded video stream are duplicated and transmitted over multiple paths during handoff. The effectiveness of the proposed multipath handoff scheme is verified and compared with existing schemes through extensive simulations. The simulation results show that the proposed scheme provides higher throughput and better quality for stream media.     

衰落信道下基于非合作博弈的Ad hoc协作并行传输方案

该文针对Ad hoc网络中同时存在的快、慢衰落情况,提出一种依据节点信号干扰噪声比(Signal to Interference plus Noise Ratio,SINR)计算并行传输门限的方法。该方法在获知节点信道质量的分布情况后,采用贝叶斯非合作博弈理论对不同源目的节点对之间的并行传输进行建模。考虑到该模型会使信道质量长时间低于并行传输门限的节点处于发送饥饿状态,该文引入协作通信机制来解决饥饿节点的并行传输问题,且与已存在的源目的节点通信对并存。仿真结果显示,该文提出的CTCG (Concurrent Transmission based on Channel quality with Game theory aid)模型能较大程度增加Ad hoc网络的并行传输机会,提高系统吞吐量,且能够较好的解决饥饿节点的发送抑制问题。