Distributed fault-tolerant channel allocation for cellular networks

A channel allocation algorithm includes channel acquisition and channel selection algorithms. Most of the previous work concentrates on the channel selection algorithm since early channel acquisition algorithms are centralized and rely on a mobile switching center (MSC) to accomplish channel acquisition. Distributed channel acquisition algorithms have received considerable attention due to their high reliability and scalability. However, in these algorithms, a borrower needs to consult with its interference neighbors in order to borrow a channel. Thus, the borrower fails to borrow channels when it cannot communicate with any interference neighbor. In real-life networks, under heavy traffic load, a cell has a large probability to experience an intermittent network congestion or even a communication link failure. In existing distributed algorithms, since a cell has to consult with a large number of interference neighbors to borrow a channel, the failure rate will be much higher under heavy traffic load. Therefore, previous distributed channel allocation algorithms are not suitable for real-life networks. We first propose a fault-tolerant channel acquisition algorithm which tolerates communication link failures and node (MH or MSS) failures. Then, we present a channel selection algorithm and integrate it into the distributed acquisition algorithm. Detailed simulation experiments are carried out in order to evaluate our proposed methodology. Simulation results show that our algorithm significantly reduces the failure rate under network congestion, communication link failures, and node failures compared to nonfault-tolerant channel allocation algorithms. Moreover, our algorithm has low message overhead compared to known distributed channel allocation algorithms, and outperforms them in terms of failure rate under uniform as well as nonuniform traffic distribution     

直升机卫星通信系统信道模拟与通信实现

针对直升机卫星通信系统中直升机旋翼对通信信道造成的周期性衰落问题,采用射频收发器AD9361模拟了信道周期性衰落模型,基于此模型在现场可编程门阵列(Field Programmable Gate Array,FPGA)上优化并实现了缝隙检测算法。根据信道衰落模型和缝隙检测算法及数据链路速率和带宽的要求,提出了一套直升机卫星通信系统可靠通信方案,即前向链路采用重发和分集接收及短码LDPC编码技术,返向链路根据前向链路缝隙检测的结果在无遮挡缝隙采用突发通信和长码低密度奇偶校验(Low Density Parity Check,LDPC)编码技术,实现可靠通信。系统测试结果表明,该方案不受直升机机型限制,系统可在40%遮挡率下实现前向链路25.6 kb/s和返向链路4 Mb/s速率下的可靠通信。     

Improved video streaming using MSVC and nonoverlapping zone routing multipath propagation over MANETs

Providing real‐time video streaming in mobile ad hoc networks is difficult because of the time‐dependent channel status and stringent service requirements. The currently existing route request‐reply–based multihop overlay networks cause considerable control overheads in video transmission resulting in loss of data and communication breakdown. Such networks are more suitable to nonstreaming video applications rather than to time‐sensitive video streaming applications. Therefore, a powerful mechanism needs to be adopted to handle the channel failures amicably and reduce latency effectively in time critical video streaming applications over mobile ad hoc networks. In order to be resilient to the channel failures and reduce latency in such applications, 2 strategies, namely, multistate video coding and 2‐tier–based nonoverlapping zone routing multipath propagation through directional antennas have respectively been incorporated. The performance of the proposed nonoverlapping zone routing multipath propagation system is compared with those of the existing multicast zone routing and zone‐based hierarchical link state routing protocols with parameters average end‐to‐end delay, routing overhead and packet delivery ratio using NS 2.34. The simulation results show that latency and resilience get considerably improved. Finally, the video quality of the proposed work has been verified by subjective and objective video testing methods.     

Reliable flow with failures in a network

In communication networks, there is a growing need for ensuring that networks maintain service despite failures. To meet this need, the concept of a δ-reliable channel is introduced; it is a set of communication channels along a set of paths. The δ-reliable channel meets the requirement that if a link or node fails, failure is limited to a maximum of δ·c (c≡total capacity of the channels, and 0<δ⩽1). A δ-reliable flow is such that the maximum number of flow failures is δ·f (f≡value of the flow) if an edge or vertex of a network fails. The max-flow min-cut theorem of δ-reliable flow is demonstrated for the single-commodity case     

Analog diversity coding to provide transparent self-healingcommunication networks

pg 100 diversity coding, as introduced in Ayanoglu et al. (1990), is a method of protection against failures in a communication network or a storage system, which is based on introducing a digital error-correcting code across independent links. This technique makes efficient use of the extra network capacity needed for coding and has the additional advantages of being nearly instantaneous, not requiring a feedback channel, rerouting, or resynchronization. In high-speed (multi Gbps) networks, digital coding will be difficult to implement, and the purpose of the present paper is to demonstrate how diversity coding may be implemented in the analog domain using the discrete fourier transform (DFT). In particular, the authors show that the DFT is a continuous-amplitude maximum-distance separable code over the field of complex numbers when the transform kernel is a prime root of unity. This code can be used to generate self-healing or fault-tolerant communication networks for continuous- or discrete-amplitude signals, as long as continuous-amplitude parity channels are available. The authors describe electrical and optoelectronic implementations, and a signal estimation approach to combat channel noise and thereby improve the performance of the analog diversity coding system. The most important advantage of this technique is in greatly simplifying the encoders and decoders of diversity coding systems for high-speed networks, such as fiber-optic wavelength division multiplexed networks. Application of analog diversity coding to systems with analog sources, such as telemetry systems is also possible     

Reliable and Secure Cooperative Communication for Wireless Sensor Networks Making Use of Cooperative Jamming with Physical Layer Security

Interference is generally considered as the redundant and unwanted occurrence in wireless communication. This research work proposes a novel cooperative jamming mechanism for scalable networks like wireless sensor networks which makes use of friendly interference to confuse the eavesdropper and increase its uncertainty about the source message. The communication link is built with the help of Information theoretic source and channel coding mechanisms. The whole idea is to make use of normally inactive relay nodes in the selective Decode and Forward cooperative communication and let them work as cooperative jamming sources to increase the equivocation of the eavesdropper. In this work, eavesdropper’s equivocation is compared with the main channel in terms of mutual information and secrecy capacity.     

Channel estimation and physical layer adaptation techniques for satellite networks exploiting adaptive coding and modulation

The exploitation of adaptive coding and modulation techniques for broadband multi‐beam satellite communication networks operating at Ka‐band and above has been shown to theoretically provide large system capacity gains. In this paper, the problem of how to accurately estimate the time‐variant channel and how to adapt the physical layer taking into account the effects of estimator errors and (large) satellite propagation delays is analyzed, and practical solutions for both the forward and the reverse link are proposed. A novel pragmatic solution to the reverse link physical layer channel estimation in the presence of time‐variant bursty interference has been devised. Physical layer adaptation algorithms jointly with design rules for hysteresis thresholds have been analytically derived. The imperfect physical layer channel estimation impact on the overall system capacity has been finally derived by means of an original semi‐analytical approach. Through comprehensive system simulations for a realistic system study case, it is showed that the devised adaptation algorithms are able to successfully track critical Ka‐band fading time series with a limited impact on the system capacity while satisfying the link outage probability requirement. Copyright © 2008 John Wiley & Sons, Ltd.     

Distributed coding for cooperative wireless networks: an overview and recent advances - [Topics in ad hoc and sensor networks]

Cooperative communication has been shown to be an effective technique enabling singleantenna users to share their antennas to create a virtual MIMO system, thus providing extra spatial diversity in wireless networks. Distributed coding is a type of channel coding strategy developed for cooperative wireless networks. As opposed to conventional channel coding schemes, distributed coding constructs the whole codeword in a distributed manner among the cooperative users. Properly designed distributed coding can effectively approach the capacity of cooperative wireless networks. The aim of this article is to present an overview of recent development in distributed coding design in cooperative wireless networks.     

An algebraic approach to network coding

We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al.(see Proc. 2001 IEEE Int. Symp. Information Theory, p.102), who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary networks and robust networking. For networks which are restricted to using linear network codes, we find necessary and sufficient conditions for the feasibility of any given set of connections over a given network. We also consider the problem of network recovery for nonergodic link failures. For the multicast setup we prove that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question. The results are derived for both delay-free networks and networks with delays.     

Robust adaptive transmission of images and video over multiple channels

Reliable transmission of images and video over wireless networks must address both potentially limited bandwidths and the possibilities of loss. When bandwidth sufficient to transmit the bit stream is unavailable on a single channel, the data can be partitioned over multiple channels with possibly unequal bandwidths and error characteristics at the expense of more complex channel coding (i.e., error correction). This paper addresses the problem of efficiently channel coding and partitioning pre-encoded image and video bit streams into substreams for transmission over multiple channels with unequal and time-varying characteristics. Within channels, error protection is unequally applied based on both data decoding priority and channel packet loss rates, while cross-channel coding addresses channel failures. In comparison with conventional product codes, the resulting product code does not restrict the total encoded data to a rectangular structure; rather, the data in each channel is adaptively coded according to the channel's varying conditions. The coding and partitioning are optimized to achieve two performance criteria: maximum bandwidth efficiency and minimum delay. Simulation results demonstrate that this approach is effective under a variety of channel conditions and for a broad range of source material.     

Channel Capacity Statistics of an Interfered Broadband Satellite Link

Satellite communication networks play an important role in the “digital divide” problem, by offering broadband services everywhere in the world. The ever increasing demand for multimedia services has led to the use of Ku, Ka and V band in modern satellite communication networks. In these frequency bands, rain attenuation is the most dominant propagation fading mechanism. Moreover, interference due to propagation phenomena deteriorates the performance of the satellite links and should be taken into account for the reliable design of satellite communication networks. In this paper, an analytical physical mathematical propagation model is presented for the prediction of channel capacity statistics of a dual-polarized interfered broadband satellite link. Rain attenuation spatial inhomogeneity is incorporated in the analysis with the employment of correlated slant paths. The obtained numerical results show the significance of these effects to channel capacity estimation. Finally, the proposed model may be used towards the optimum utilization of the satellite channel capacity by means of adaptive fade mitigation schemes.     

Dynamic uplink frame optimization with adaptive coding and modulation in DVB‐RCS2 satellite networks

In the current generation of satellite networks, modulation and coding schemes can be dynamically changed in real‐time to face different link conditions. Therefore, the link budget is not anymore required to be computed under the worst case, with relevant advantages in terms of efficiency. The new digital video broadcasting‐return channel via satellite 2 standard extends the dynamic modulation and coding to the return link: by using different modulation and coding schemes within the uplink frame, the terminals experiencing good link conditions transmit at very high bitrates, whereas the terminals experiencing fade events transmit at lower bitrates. This paper addresses the problem of optimizing the uplink frame modulation and coding schemes based on the current link conditions experienced by the terminals and on their transmission capacity requirements. The problem is formulated as an Integer Program and an efficient Linear Program approximation is proposed. Simulation results validate the proposed approach. Copyright © 2013 John Wiley & Sons, Ltd.     

Duality between source coding and channel coding and its extension to the side information case

We explore the information-theoretic duality between source coding with side information at the decoder and channel coding with side information at the encoder. We begin with a mathematical characterization of the functional duality between classical source and channel coding, formulating the precise conditions under which the optimal encoder for one problem is functionally identical to the optimal decoder for the other problem. We then extend this functional duality to the case of coding with side information. By invoking this duality, we are able to generalize the result of Wyner and Ziv (1976) relating to no rate loss for source coding with side information from Gaussian to more arbitrary distributions. We consider several examples corresponding to both discrete- and continuous-valued cases to illustrate our formulation. For the Gaussian cases of coding with side information, we invoke geometric arguments to provide further insights into their duality. Our geometric treatment inspires the construction and dual use of practical coset codes for a large class of emerging applications for coding with side information, such as distributed sensor networks, watermarking, and information-hiding communication systems.     

MIMO wireless communication channel phenomenology

Wireless communication using multiple-input multiple-output (MIMO) systems enables increased spectral efficiency and link reliability for a given total transmit power. Increased capacity is achieved by introducing additional spatial channels which are exploited using space-time coding. The spatial diversity improves the link reliability by reducing the adverse effects of link fading and shadowing. The choice of coding and the resulting performance improvement are dependent upon the channel phenomenology. In this paper, experimental channel-probing estimates are reported for outdoor environments near the personal communication services frequency allocation (1790 MHz). A simple channel parameterization is introduced. Channel distance metrics are introduced. Because the bandwidth of the channel-probing signal (1.3 MHz) is sufficient to resolve some delays in outdoor environments, frequency-selective fading is also investigated. Channel complexity and channel stationarity are investigated. Complexity is associated with channel-matrix singular value distributions. Stationarity is associated with the stability of channel singular value and singular vector structure over time.     

空天地通信网络中物理层安全技术综述

空天地一体化通信网络是未来无线通信的发展趋势,其固有的广播特性和广阔的覆盖区域,将导致网络通信系统面临严重的安全威胁。如何保证空天地通信网络的安全性是一个亟待解决的问题。物理层安全技术作为一种有效的安全手段,在无线通信领域受到越来越多的关注。介绍了物理层安全的基础以及空天地通信信道模型,并对物理层安全中常见的窃听编码、波束成形、人工噪声、中继协作干扰和物理层密钥加密等技术进行了介绍和总结,最后提出了空天地通信网络中物理层安全面临的挑战和未来的发展趋势。     

Fast power transients in concatenated Pr3+-dopedfluoride fiber amplifiers

Amplified multiwavelength optical communication networks are prone to substantial saturation induced power fluctuations when a channel is turned on or rerouted. This perturbs amplifier gains at other wavelengths. The effects of addition and/or dropping of wavelength channels due to network reconfigurations or line failures in a multiwavelength network comprising eight concatenated Pr³⁺-doped fluoride fiber amplifiers (PDFFAs) have been studied theoretically. A large-signal numerical model which incorporates time variation effects and the downstream and upstream propagation of signal, pump and amplified spontaneous emission has been used. In an eight channel WDM network the loss of channels will cause very fast power excursions of the surviving channels. The necessary speed of the link control circuit for surviving channel protection has been investigated     

非对称双向中继信道中协作分集和网络编码的联合应用

本文应用非对称信道编码和网络编码技术实现了双向中继信道中非对称速率的传输。现实中无线通信环境具有差异性,通信链路状况也不相同。利用非对称编码方式,在较差链路引入更多的冗余信息来保证传输的可靠性,也在较优链路采取较高的传输速率,充分利用较优链路传输更多的信息。同时,通过协作分集技术,在接收端得到传输信息的多个副本,可以实现无线通信系统的分集增益。在中继链路加入网络编码,增加了系统的通信效率和编码增益。仿真结果表明,通过非对称编码方式,在较差链路端使用冗余更多的信道编码方式,不但可以实现可靠性传输,也比对称编码方式传输更多的信息。同时,利用协作分集技术,提供多个译码信息副本,增加了译码的可靠性,降低了系统误比特率。      

A Network Coding Scheme to Improve Throughput for IEEE 802.11 WLAN

In IEEE 802.11 infrastructure wireless local area network (WLAN), the communication between any two nodes is relayed by an access point (AP), which becomes the bottleneck of WLAN and severely restricts the overall throughput. It is well known that network coding technique is able to greatly improve the throughput of wireless networks. But, the available coding schemes do not make full advantage of channel capacity due to the fact that they pick at most one packet from each data flow for coding and the picked packets may have a great difference in packet size, wasting some channel capacity. To remedy the problem, in this paper, we propose the coding scheme that combines multiple buffered packets in one flow into a larger packet for coding so that the packets participating in coding have close sizes. We formulate an integer programming problem to find the optimal packet coding, which is solved by an optimal algorithm with relative high time complexity together with a heuristic algorithm with relative low time complexity. Simulation results show that the proposed coding scheme is able to greatly improve the throughput of WLAN and the throughput gain increases with the growth of the number of coding flows.     

A Random Linear Network Coding Approach to Multicast

We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. We show that this achieves capacity with probability exponentially approaching 1 with the code length. We also demonstrate that random linear coding performs compression when necessary in a network, generalizing error exponents for linear Slepian-Wolf coding in a natural way. Benefits of this approach are decentralized operation and robustness to network changes or link failures. We show that this approach can take advantage of redundant network capacity for improved success probability and robustness. We illustrate some potential advantages of random linear network coding over routing in two examples of practical scenarios: distributed network operation and networks with dynamically varying connections. Our derivation of these results also yields a new bound on required field size for centralized network coding on general multicast networks