Stability of Scheduled Message Communication over Degraded Broadcast Channels

We consider scheduled message communication over a discrete memoryless degraded broadcast channel. The framework we consider here models both the random message arrivals and the subsequent reliable communication by suitably combining techniques from queueing theory and information theory. The channel from the transmitter to each of the receivers is quasi-static, flat, and with independent fades across the receivers. Requests for message transmissions are assumed to arrive according to an i.i.d. arrival process. Then, (i) we derive an outer bound to the region of message arrival vectors achievable by the class of stationary scheduling policies, (ii) we show for any message arrival vector that satisfies the outerbound, that there exists a stationary ``state-independent'' policy that results in a stable system for the corresponding message arrival process, and (iii) under two asymptotic regimes, we show that the stability region of nat arrival rate vectors has information-theoretic capacity region interpretation.Comment: 5 pages, Submitted to 2006 International Symposium on Information Theor

Scheduling for Stable and Reliable Communication over Multiaccess Channels and Degraded Broadcast Channels

Information-theoretic arguments focus on modeling the reliability of information transmission, assuming availability of infinite data at sources, thus ignoring randomness in message generation times at the respective sources. However, in information transport networks, not only is reliable transmission important, but also stability, i.e., finiteness of mean delay incurred by messages from the time of generation to the time of successful reception. Usually, delay analysis is done separately using queueing-theoretic arguments, whereas reliable information transmission is studied using information theory. In this thesis, we investigate these two important aspects of data communication jointly by suitably combining models from these two fields. In particular, we model scheduled communication of messages, that arrive in a random process, (i) over multiaccess channels, with either independent decoding or joint decoding, and (ii) over degraded broadcast channels. The scheduling policies proposed permit up to a certain maximum number of messages for simultaneous transmission. In the first part of the thesis, we develop a multi-class discrete-time processor-sharing queueing model, and then investigate the stability of this queue. In particular, we model the queue by a discrete-time Markov chain defined on a countable state space, and then establish (i) a sufficient condition for $c$-regularity of the chain, and hence positive recurrence and finiteness of stationary mean of the function $c$ of the state, and (ii) a sufficient condition for transience of the chain. These stability results form the basis for the conclusions drawn in the thesis.Comment: Ph.D. Thesis submitted to Department of Electrical Communication Engineering at Indian Institute of Science, Bangalore, Indi

Design and analysis of adaptive hierarchical low-power long-range networks

A new phase of evolution of Machine-to-Machine (M2M) communication has started where vertical Internet of Things (IoT) deployments dedicated to a single application domain gradually change to multi-purpose IoT infrastructures that service different applications across multiple industries. New networking technologies are being deployed operating over sub-GHz frequency bands that enable multi-tenant connectivity over long distances and increase network capacity by enforcing low transmission rates to increase network capacity. Such networking technologies allow cloud-based platforms to be connected with large numbers of IoT devices deployed several kilometres from the edges of the network. Despite the rapid uptake of Long-power Wide-area Networks (LPWANs), it remains unclear how to organize the wireless sensor network in a scaleable and adaptive way. This paper introduces a hierarchical communication scheme that utilizes the new capabilities of Long-Range Wireless Sensor Networking technologies by combining them with broadly used 802.11.4-based low-range low-power technologies. The design of the hierarchical scheme is presented in detail along with the technical details on the implementation in real-world hardware platforms. A platform-agnostic software firmware is produced that is evaluated in real-world large-scale testbeds. The performance of the networking scheme is evaluated through a series of experimental scenarios that generate environments with varying channel quality, failing nodes, and mobile nodes. The performance is evaluated in terms of the overall time required to organize the network and setup a hierarchy, the energy consumption and the overall lifetime of the network, as well as the ability to adapt to channel failures. The experimental analysis indicate that the combination of long-range and short-range networking technologies can lead to scalable solutions that can service concurrently multiple applications

Development and analysis of the Software Implemented Fault-Tolerance (SIFT) computer

SIFT (Software Implemented Fault Tolerance) is an experimental, fault-tolerant computer system designed to meet the extreme reliability requirements for safety-critical functions in advanced aircraft. Errors are masked by performing a majority voting operation over the results of identical computations, and faulty processors are removed from service by reassigning computations to the nonfaulty processors. This scheme has been implemented in a special architecture using a set of standard Bendix BDX930 processors, augmented by a special asynchronous-broadcast communication interface that provides direct, processor to processor communication among all processors. Fault isolation is accomplished in hardware; all other fault-tolerance functions, together with scheduling and synchronization are implemented exclusively by executive system software. The system reliability is predicted by a Markov model. Mathematical consistency of the system software with respect to the reliability model has been partially verified, using recently developed tools for machine-aided proof of program correctness

Two-path succesive relaying schemes in the presence of inter-relay interference

Relaying is a promising technique to improve wireless network performance. A conventional relay transmits and receives signals in two orthogonal channels due to half duplex constraint of wireless network. This results in inefficient use of spectral resources. Two-Path Successive Relaying (TPSR) has been proposed to recover loss in spectral efficiency. However, the performance of TPSR is degraded by Inter-Relay Interference (IRI). This thesis investigates the performance of TPSR affected by IRI and proposes several schemes to improve relaying reliability, throughput and secrecy. Simulations revealed that the existing TPSR could perform worse than the conventional Half Duplex Relaying (HDR) scheme. Opportunistic TPSR schemes are proposed to improve the capacity performance. Several relay pair selection criteria are developed to ensure the selection of the best performing relay pair. Adaptive schemes which dynamically switch between TPSR and conventional HDR are proposed to further improve the performance. Simulation and analytical results show that the proposed schemes can achieve up to 45% ergodic capacity improvement and lower outage probability compared to baseline schemes, while achieving the maximum diversity and multiplexing tradeoff of the multi-input single-output channel. In addition, this thesis proposes secrecy TPSR schemes to protect secrecy of wireless transmission from eavesdropper. The use of two relays in the proposed schemes deliver more robust secrecy transmission while the use of scheduled jamming signals improves secrecy rate. Simulation and analytical results reveal that the proposed schemes can achieve up to 62% ergodic secrecy capacity improvement and quadratically lower intercept and secrecy outage probabilities if compared to existing schemes. Overall, this thesis demonstrates that the proposed TPSR schemes are able to deliver performance improvement in terms of throughput, reliability and secrecy in the presence of IRI

Improved Delay Estimates for a Queueing Model for Random Linear Coding for Unicast

Consider a lossy communication channel for unicast with zero-delay feedback. For this communication scenario, a simple retransmission scheme is optimum with respect to delay. An alternative approach is to use random linear coding in automatic repeat-request (ARQ) mode. We extend the work of Shrader and Ephremides, by deriving an expression for the delay of random linear coding over field of infinite size. Simulation results for various field sizes are also provided.Comment: 5 pages, 3 figures, accepted at the 2009 IEEE International Symposium on Information Theor