Transmission of Still Images Using Low-Complexity Analog Joint Source-Channel Coding

[Abstract] An analog joint source-channel coding (JSCC) system designed for the transmission of still images is proposed and its performance is compared to that of two digital alternatives which differ in the source encoding operation: Joint Photographic Experts Group (JPEG) and JPEG without entropy coding (JPEGw/oEC), respectively, both relying on an optimized channel encoder–modulator tandem. Apart from a visual comparison, the figures of merit considered in the assessment are the structural similarity (SSIM) index and the time required to transmit an image through additive white Gaussian noise (AWGN) and Rayleigh channels. This work shows that the proposed analog system exhibits a performance similar to that of the digital scheme based on JPEG compression with a noticeable better visual degradation to the human eye, a lower computational complexity, and a negligible delay. These results confirm the suitability of analog JSCC for the transmission of still images in scenarios with severe constraints on power consumption, computational capabilities, and for real-time applications. For these reasons the proposed system is a good candidate for surveillance systems, low-constrained devices, Internet of things (IoT) applications, etc.Xunta de Galicia; ED431C 2016-045Xunta de Galicia; ED431G/01Agencia Estatal de Investigación de España; TEC2016-75067-C4-1-

Performance Modelling and Optimisation of Multi-hop Networks

A major challenge in the design of large-scale networks is to predict and optimise the total time and energy consumption required to deliver a packet from a source node to a destination node. Examples of such complex networks include wireless ad hoc and sensor networks which need to deal with the effects of node mobility, routing inaccuracies, higher packet loss rates, limited or time-varying effective bandwidth, energy constraints, and the computational limitations of the nodes. They also include more reliable communication environments, such as wired networks, that are susceptible to random failures, security threats and malicious behaviours which compromise their quality of service (QoS) guarantees. In such networks, packets traverse a number of hops that cannot be determined in advance and encounter non-homogeneous network conditions that have been largely ignored in the literature. This thesis examines analytical properties of packet travel in large networks and investigates the implications of some packet coding techniques on both QoS and resource utilisation. Specifically, we use a mixed jump and diffusion model to represent packet traversal through large networks. The model accounts for network non-homogeneity regarding routing and the loss rate that a packet experiences as it passes successive segments of a source to destination route. A mixed analytical-numerical method is developed to compute the average packet travel time and the energy it consumes. The model is able to capture the effects of increased loss rate in areas remote from the source and destination, variable rate of advancement towards destination over the route, as well as of defending against malicious packets within a certain distance from the destination. We then consider sending multiple coded packets that follow independent paths to the destination node so as to mitigate the effects of losses and routing inaccuracies. We study a homogeneous medium and obtain the time-dependent properties of the packet’s travel process, allowing us to compare the merits and limitations of coding, both in terms of delivery times and energy efficiency. Finally, we propose models that can assist in the analysis and optimisation of the performance of inter-flow network coding (NC). We analyse two queueing models for a router that carries out NC, in addition to its standard packet routing function. The approach is extended to the study of multiple hops, which leads to an optimisation problem that characterises the optimal time that packets should be held back in a router, waiting for coding opportunities to arise, so that the total packet end-to-end delay is minimised

Network coding in wireless queueing networks: tandem network case

Abstract — In this paper, we compare the effects of the saturated and possibly emptying packet queues on wireless network coding (or plain routing as a special case) in a simple tandem network. We consider scheduled or random access with omnidirectional transmissions and assume the classical collision channel model without simultaneous transmission and reception by any node. For the case of multiple source nodes, we evaluate the multicast throughput rates jointly achievable by different sourcedestination pairs under the separate assumptions of network coding and plain routing only. Particularly, we specify the throughput region for saturated queues and stability region for possibly emptying queues. We also evaluate the fundamental trade-offs among the performance objectives of throughput and transmission and processing energy costs. Finally, we extend the analysis to non-cooperative network operation with selfish nodes competing for limited network resources. We point at the inefficiency of competitive medium access control and network coding (or plain routing) decisions at individual nodes, and introduce a pricing-based cooperation stimulation mechanism to improve the throughput and energy efficiency performance. I