17,473 research outputs found
Reliable Download Delivery in a Terrestrial DAB Network
Reliable file transfer is important in broadcast networks. In this paper, we have investigated if it is useful to extend the DAB standard with Fountain codes. To evaluate this, results from measurements in a live Single Frequency Network
(SFN) were used. Our results show that the existing error correction algorithms provide already reliable file delivery, so there is no need to extend the DAB standard
Optimal Coding Schemes for the Three-Receiver AWGN Broadcast Channel with Receiver Message Side Information
This paper investigates the capacity region of the three-receiver AWGN
broadcast channel where the receivers (i) have private-message requests and
(ii) may know some of the messages requested by other receivers as side
information. We first classify all 64 possible side information configurations
into eight groups, each consisting of eight members. We next construct
transmission schemes, and derive new inner and outer bounds for the groups.
This establishes the capacity region for 52 out of 64 possible side information
configurations. For six groups (i.e., groups 1, 2, 3, 5, 6, and 8 in our
terminology), we establish the capacity region for all their members, and show
that it tightens both the best known inner and outer bounds. For group 4, our
inner and outer bounds tighten the best known inner bound and/or outer bound
for all the group members. Moreover, our bounds coincide at certain regions,
which can be characterized by two thresholds. For group 7, our inner and outer
bounds coincide for four members, thereby establishing the capacity region. For
the remaining four members, our bounds tighten both the best known inner and
outer bounds.Comment: Authors' final version (to appear in IEEE Transactions on Information
Theory
Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks
Development of many futuristic technologies, such as MANET, VANET, iThings,
nano-devices, depend on efficient distributed communication protocols in
multi-hop ad hoc networks. A vast majority of research in this area focus on
design heuristic protocols, and analyze their performance by simulations on
networks generated randomly or obtained in practical measurements of some
(usually small-size) wireless networks. %some library. Moreover, they often
assume access to truly random sources, which is often not reasonable in case of
wireless devices. In this work we use a formal framework to study the problem
of broadcasting and its time complexity in any two dimensional Euclidean
wireless network with uniform transmission powers. For the analysis, we
consider two popular models of ad hoc networks based on the
Signal-to-Interference-and-Noise Ratio (SINR): one with opportunistic links,
and the other with randomly disturbed SINR. In the former model, we show that
one of our algorithms accomplishes broadcasting in rounds, where
is the number of nodes and is the diameter of the network. If nodes
know a priori the granularity of the network, i.e., the inverse of the
maximum transmission range over the minimum distance between any two stations,
a modification of this algorithm accomplishes broadcasting in
rounds.
Finally, we modify both algorithms to make them efficient in the latter model
with randomly disturbed SINR, with only logarithmic growth of performance.
Ours are the first provably efficient and well-scalable, under the two
models, distributed deterministic solutions for the broadcast task.Comment: arXiv admin note: substantial text overlap with arXiv:1207.673
- …