703 research outputs found
Dynamic algorithms for multicast with intra-session network coding
The problem of multiple multicast sessions with
intra-session network coding in time-varying networks is considered.
The network-layer capacity region of input rates that can be
stably supported is established. Dynamic algorithms for multicast
routing, network coding, power allocation, session scheduling, and
rate allocation across correlated sources, which achieve stability
for rates within the capacity region, are presented. This work
builds on the back-pressure approach introduced by Tassiulas
et al., extending it to network coding and correlated sources. In
the proposed algorithms, decisions on routing, network coding,
and scheduling between different sessions at a node are made
locally at each node based on virtual queues for different sinks.
For correlated sources, the sinks locally determine and control
transmission rates across the sources. The proposed approach
yields a completely distributed algorithm for wired networks.
In the wireless case, power control among different transmitters
is centralized while routing, network coding, and scheduling
between different sessions at a given node are distributed
V2X Content Distribution Based on Batched Network Coding with Distributed Scheduling
Content distribution is an application in intelligent transportation system
to assist vehicles in acquiring information such as digital maps and
entertainment materials. In this paper, we consider content distribution from a
single roadside infrastructure unit to a group of vehicles passing by it. To
combat the short connection time and the lossy channel quality, the downloaded
contents need to be further shared among vehicles after the initial
broadcasting phase. To this end, we propose a joint infrastructure-to-vehicle
(I2V) and vehicle-to-vehicle (V2V) communication scheme based on batched sparse
(BATS) coding to minimize the traffic overhead and reduce the total
transmission delay. In the I2V phase, the roadside unit (RSU) encodes the
original large-size file into a number of batches in a rateless manner, each
containing a fixed number of coded packets, and sequentially broadcasts them
during the I2V connection time. In the V2V phase, vehicles perform the network
coded cooperative sharing by re-encoding the received packets. We propose a
utility-based distributed algorithm to efficiently schedule the V2V cooperative
transmissions, hence reducing the transmission delay. A closed-form expression
for the expected rank distribution of the proposed content distribution scheme
is derived, which is used to design the optimal BATS code. The performance of
the proposed content distribution scheme is evaluated by extensive simulations
that consider multi-lane road and realistic vehicular traffic settings, and
shown to significantly outperform the existing content distribution protocols.Comment: 12 pages and 9 figure
Tiny Codes for Guaranteeable Delay
Future 5G systems will need to support ultra-reliable low-latency
communications scenarios. From a latency-reliability viewpoint, it is
inefficient to rely on average utility-based system design. Therefore, we
introduce the notion of guaranteeable delay which is the average delay plus
three standard deviations of the mean. We investigate the trade-off between
guaranteeable delay and throughput for point-to-point wireless erasure links
with unreliable and delayed feedback, by bringing together signal flow
techniques to the area of coding. We use tiny codes, i.e. sliding window by
coding with just 2 packets, and design three variations of selective-repeat ARQ
protocols, by building on the baseline scheme, i.e. uncoded ARQ, developed by
Ausavapattanakun and Nosratinia: (i) Hybrid ARQ with soft combining at the
receiver; (ii) cumulative feedback-based ARQ without rate adaptation; and (iii)
Coded ARQ with rate adaptation based on the cumulative feedback. Contrasting
the performance of these protocols with uncoded ARQ, we demonstrate that HARQ
performs only slightly better, cumulative feedback-based ARQ does not provide
significant throughput while it has better average delay, and Coded ARQ can
provide gains up to about 40% in terms of throughput. Coded ARQ also provides
delay guarantees, and is robust to various challenges such as imperfect and
delayed feedback, burst erasures, and round-trip time fluctuations. This
feature may be preferable for meeting the strict end-to-end latency and
reliability requirements of future use cases of ultra-reliable low-latency
communications in 5G, such as mission-critical communications and industrial
control for critical control messaging.Comment: to appear in IEEE JSAC Special Issue on URLLC in Wireless Network
On playback delay in streaming communication
We consider the problem of minimizing playback delay in streaming over a packet erasure channel with fixed bandwidth. When packets have to be played in order, the expected delay inherently grows with time. We analyze two cases, namely no feedback and instantaneous feedback. We find that in both cases the delay grows logarithmically with the time elapsed since the start of transmission, and we evaluate the growth constant, i.e. the pre-log term, as a function of the transmission bandwidth (relative to the source bandwidth). The growth constant with feedback is strictly better that the one without, but they have the same asymptotic value in the limit of infinite bandwidth.Lincoln LaboratoryUnited States. Air Force Office of Scientific Research (Grant FA9550-11-1-0183)Hewlett-Packard Compan
On feedback-based rateless codes for data collection in vehicular networks
The ability to transfer data reliably and with low delay over an unreliable service is intrinsic to a number of emerging technologies, including digital video broadcasting, over-the-air software updates, public/private cloud storage, and, recently, wireless vehicular networks. In particular, modern vehicles incorporate tens of sensors to provide vital sensor information to electronic control units (ECUs). In the current architecture, vehicle sensors are connected to ECUs via physical wires, which increase the cost, weight and maintenance effort of the car, especially as the number of electronic components keeps increasing. To mitigate the issues with physical wires, wireless sensor networks (WSN) have been contemplated for replacing the current wires with wireless links, making modern cars cheaper, lighter, and more efficient. However, the ability to reliably communicate with the ECUs is complicated by the dynamic channel properties that the car experiences as it travels through areas with different radio interference patterns, such as urban versus highway driving, or even different road quality, which may physically perturb the wireless sensors.
This thesis develops a suite of reliable and efficient communication schemes built upon feedback-based rateless codes, and with a target application of vehicular networks. In particular, we first investigate the feasibility of multi-hop networking for intra-car WSN, and illustrate the potential gains of using the Collection Tree Protocol (CTP), the current state of the art in multi-hop data aggregation. Our results demonstrate, for example, that the packet delivery rate of a node using a single-hop topology protocol can be below 80% in practical scenarios, whereas CTP improves reliability performance beyond 95% across all nodes while simultaneously reducing radio energy consumption. Next, in order to migrate from a wired intra-car network to a wireless system, we consider an intermediate step to deploy a hybrid communication structure, wherein wired and wireless networks coexist. Towards this goal, we design a hybrid link scheduling algorithm that guarantees reliability and robustness under harsh vehicular environments. We further enhance the hybrid link scheduler with the rateless codes such that information leakage to an eavesdropper is almost zero for finite block lengths.
In addition to reliability, one key requirement for coded communication schemes is to achieve a fast decoding rate. This feature is vital in a wide spectrum of communication systems, including multimedia and streaming applications (possibly inside vehicles) with real-time playback requirements, and delay-sensitive services, where the receiver needs to recover some data symbols before the recovery of entire frame. To address this issue, we develop feedback-based rateless codes with dynamically-adjusted nonuniform symbol selection distributions. Our simulation results, backed by analysis, show that feedback information paired with a nonuniform distribution significantly improves the decoding rate compared with the state of the art algorithms. We further demonstrate that amount of feedback sent can be tuned to the specific transmission properties of a given feedback channel
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
Analysis and simulation of feedback in network coded transmission
In questa tesi si propongono due protocolli di trasmissione multi-interfaccia, entrambi basati sul Network Coding, e studiamo un schema di feedback compatibile con questi e che permetta di sfruttare le proprietĂ di questo schema di codifica. Inoltre questi protocolli vengono implementati in un simulatore in linguaggio Python, e i risultati vengono ricavati tramite un'estensiva campagna di simulazioni, specialmente riguardo a overhead e feedbacks
Network coding for transport protocols
With the proliferation of smart devices that require Internet connectivity anytime, anywhere, and the recent technological
advances that make it possible, current networked systems will have to provide a various range of services, such as content
distribution, in a wide range of settings, including wireless environments. Wireless links may experience temporary losses,
however, TCP, the de facto protocol for robust unicast communications, reacts by reducing the congestion window drastically
and injecting less traffic in the network. Consequently the wireless links are underutilized and the overall performance of the
TCP protocol in wireless environments is poor. As content delivery (i.e. multicasting) services, such as BBC iPlayer, become
popular, the network needs to support the reliable transport of the data at high rates, and with specific delay constraints. A
typical approach to deliver content in a scalable way is to rely on peer-to-peer technology (used by BitTorrent, Spotify and
PPLive), where users share their resources, including bandwidth, storage space, and processing power. Still, these systems
suffer from the lack of incentives for resource sharing and cooperation, and this problem is exacerbated in the presence of
heterogenous users, where a tit-for-tat scheme is difficult to implement.
Due to the issues highlighted above, current network architectures need to be changed in order to accommodate the usersÂż
demands for reliable and quality communications. In other words, the emergent need for advanced modes of information
transport requires revisiting and improving network components at various levels of the network stack.
The innovative paradigm of network coding has been shown as a promising technique to change the design of networked
systems, by providing a shift from how data flows traditionally move through the network. This shift implies that data flows are
no longer kept separate, according to the Âżstore-and-forwardÂż model, but they are also processed and mixed in the network. By
appropriately combining data by means of network coding, it is expected to obtain significant benefits in several areas of
network design and architecture.
In this thesis, we set out to show the benefits of including network coding into three communication paradigms, namely point-topoint
communications (e.g. unicast), point-to-multipoint communications (e.g. multicast), and multipoint-to-multipoint
communications (e.g. peer-to-peer networks). For the first direction, we propose a network coding-based multipath scheme and
show that TCP unicast sessions are feasible in highly volatile wireless environments. For point-to-multipoint communications,
we give an algorithm to optimally achieve all the rate pairs from the rate region in the case of degraded multicast over the
combination network. We also propose a system for live streaming that ensures reliability and quality of service to heterogenous
users, even if data transmissions occur over lossy wireless links. Finally, for multipoint-to-multipoint communications, we design
a system to provide incentives for live streaming in a peer-to-peer setting, where users have subscribed to different levels of
quality.
Our work shows that network coding enables a reliable transport of data, even in highly volatile environments, or in delay
sensitive scenarios such as live streaming, and facilitates the implementation of an efficient incentive system, even in the
presence of heterogenous users. Thus, network coding can solve the challenges faced by next generation networks
in order to support advanced information transport.Postprint (published version
- …