3,479 research outputs found
Data Dissemination in Wireless Networks with Network Coding
We investigate the use of network coding for information dissemination over a
wireless network. Using network coding allows for a simple, distributed and
robust algorithm where nodes do not need any information from their neighbors.
In this paper, we analyze the time needed to diffuse information throughout a
network when network coding is implemented at all nodes. We then provide an
upper bound for the dissemination time for ad-hoc networks with general
topology. Moreover, we derive a relation between dissemination time and the
size of the wireless network. It is shown that for a wireless network with N
nodes, the dissemination latency is between O(N) and O(N^2), depending on the
reception probabilities of the nodes. These observations are validated by the
simulation results
Channel Coding at Low Capacity
Low-capacity scenarios have become increasingly important in the technology
of the Internet of Things (IoT) and the next generation of mobile networks.
Such scenarios require efficient and reliable transmission of information over
channels with an extremely small capacity. Within these constraints, the
performance of state-of-the-art coding techniques is far from optimal in terms
of either rate or complexity. Moreover, the current non-asymptotic laws of
optimal channel coding provide inaccurate predictions for coding in the
low-capacity regime. In this paper, we provide the first comprehensive study of
channel coding in the low-capacity regime. We will investigate the fundamental
non-asymptotic limits for channel coding as well as challenges that must be
overcome for efficient code design in low-capacity scenarios.Comment: 39 pages, 5 figure
Recommended from our members
Individual Load Model Parameter Estimation in Distribution Systems Using Load Switching Events
- …