12,353 research outputs found
Reliable Broadcast to A User Group with Limited Source Transmissions
In order to reduce the number of retransmissions and save power for the
source node, we propose a two-phase coded scheme to achieve reliable broadcast
from the source to a group of users with minimal source transmissions. In the
first phase, the information packets are encoded with batched sparse (BATS)
code, which are then broadcasted by the source node until the file can be
cooperatively decoded by the user group. In the second phase, each user
broadcasts the re-encoded packets to its peers based on their respective
received packets from the first phase, so that the file can be decoded by each
individual user. The performance of the proposed scheme is analyzed and the
rank distribution at the moment of decoding is derived, which is used as input
for designing the optimal BATS code. Simulation results show that the proposed
scheme can reduce the total number of retransmissions compared with the
traditional single-phase broadcast with optimal erasure codes. Furthermore,
since a large number of transmissions are shifted from the source node to the
users, power consumptions at the source node is significantly reduced.Comment: ICC 2015. arXiv admin note: substantial text overlap with
arXiv:1504.0446
Reliable multicast transport by satellite: a hybrid satellite/terrestrial solution with erasure codes
Geostationary satellites are an efficient way to provide a large scale multipoint communication service. In the context of reliable multicast communications, a new hybrid satellite/terrestrial approach is proposed. It aims at reducing the overall communication cost using satellite broadcasting only when enough receivers are present, and terrestrial transmissions otherwise. This approach has been statistically evaluated for a particular cost function and seems interesting. Then since the hybrid approach relies on Forward Error Correction, several practical aspects of MDS codes and LDPC codes are investigated in order to select a code
Random Linear Network Coding for 5G Mobile Video Delivery
An exponential increase in mobile video delivery will continue with the
demand for higher resolution, multi-view and large-scale multicast video
services. Novel fifth generation (5G) 3GPP New Radio (NR) standard will bring a
number of new opportunities for optimizing video delivery across both 5G core
and radio access networks. One of the promising approaches for video quality
adaptation, throughput enhancement and erasure protection is the use of
packet-level random linear network coding (RLNC). In this review paper, we
discuss the integration of RLNC into the 5G NR standard, building upon the
ideas and opportunities identified in 4G LTE. We explicitly identify and
discuss in detail novel 5G NR features that provide support for RLNC-based
video delivery in 5G, thus pointing out to the promising avenues for future
research.Comment: Invited paper for Special Issue "Network and Rateless Coding for
Video Streaming" - MDPI Informatio
A Survey on Wireless Security: Technical Challenges, Recent Advances and Future Trends
This paper examines the security vulnerabilities and threats imposed by the
inherent open nature of wireless communications and to devise efficient defense
mechanisms for improving the wireless network security. We first summarize the
security requirements of wireless networks, including their authenticity,
confidentiality, integrity and availability issues. Next, a comprehensive
overview of security attacks encountered in wireless networks is presented in
view of the network protocol architecture, where the potential security threats
are discussed at each protocol layer. We also provide a survey of the existing
security protocols and algorithms that are adopted in the existing wireless
network standards, such as the Bluetooth, Wi-Fi, WiMAX, and the long-term
evolution (LTE) systems. Then, we discuss the state-of-the-art in
physical-layer security, which is an emerging technique of securing the open
communications environment against eavesdropping attacks at the physical layer.
We also introduce the family of various jamming attacks and their
counter-measures, including the constant jammer, intermittent jammer, reactive
jammer, adaptive jammer and intelligent jammer. Additionally, we discuss the
integration of physical-layer security into existing authentication and
cryptography mechanisms for further securing wireless networks. Finally, some
technical challenges which remain unresolved at the time of writing are
summarized and the future trends in wireless security are discussed.Comment: 36 pages. Accepted to Appear in Proceedings of the IEEE, 201
Centralized and Cooperative Transmission of Secure Multiple Unicasts using Network Coding
We introduce a method for securely delivering a set of messages to a group of
clients over a broadcast erasure channel where each client is interested in a
distinct message. Each client is able to obtain its own message but not the
others'. In the proposed method the messages are combined together using a
special variant of random linear network coding. Each client is provided with a
private set of decoding coefficients to decode its own message. Our method
provides security for the transmission sessions against computational
brute-force attacks and also weakly security in information theoretic sense. As
the broadcast channel is assumed to be erroneous, the missing coded packets
should be recovered in some way. We consider two different scenarios. In the
first scenario the missing packets are retransmitted by the base station
(centralized). In the second scenario the clients cooperate with each other by
exchanging packets (decentralized). In both scenarios, network coding
techniques are exploited to increase the total throughput. For the case of
centralized retransmissions we provide an analytical approximation for the
throughput performance of instantly decodable network coded (IDNC)
retransmissions as well as numerical experiments. For the decentralized
scenario, we propose a new IDNC based retransmission method where its
performance is evaluated via simulations and analytical approximation.
Application of this method is not limited to our special problem and can be
generalized to a new class of problems introduced in this paper as the
cooperative index coding problem
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
- …