NDLI: Broadcasting in Noisy Radio Networks

Please wait, while we are loading the content...

Some Sequential Algorithms are Almost Always Parallel

Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks

Analyzing Contention and Backoff in Asynchronous Shared Memory

LCL Problems on Grids

Blockchains and the Future of Distributed Computing

A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities

Recoverable Mutual Exclusion in Sub-logarithmic Time

Effectiveness of Delaying Timestamp Computation

Verifiable Outsourced Computation: A Survey

FruitChains: A Fair Blockchain

Greedy Routing and the Algorithmic Small-World Phenomenon

Towards Efficient Verification of Population Protocols

The Space Requirement of Local Forwarding on Acyclic Networks

A Layered Architecture for Erasure-Coded Consistent Distributed Storage

On the Multiparty Communication Complexity of Testing Triangle-Freeness

Distributed Approximation of Maximum Independent Set and Maximum Matching

Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model

Symmetry Breaking with Noisy Processes

Coordination Without Prior Agreement

Triangle Finding and Listing in CONGEST Networks

Clocked Population Protocols

Communication Primitives in Cognitive Radio Networks

Seeing is Believing: A Client-Centric Specification of Database Isolation

What Can be Sampled Locally?

Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity

Transactional Lock Elision Meets Combining

The Power of Choice in Priority Scheduling

Ignore or Comply?: On Breaking Symmetry in Consensus

Asynchronous Shared Channel

A Distributed Learning Dynamics in Social Groups

Broadcasting in Noisy Radio Networks

Space Complexity of Fault-Tolerant Register Emulations

Distributed MST and Routing in Almost Mixing Time

Optimal Distance Labeling Schemes for Trees

On Using Time Without Clocks via Zigzag Causality

A Template for Implementing Fast Lock-free Trees Using HTM

Life Beyond Set Agreement

Self-organized Segregation on the Grid

Brief Announcement: Population Protocols for Leader Election and Exact Majority with $O(log^{2}$ n) States and $O(log^{2}$ n) Convergence Time

Gossip in a Smartphone Peer-to-Peer Network

Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write

Distributed MIS via All-to-All Communication

Brief Announcement: How Large is your Graph?

Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures

Adding Concurrency to Smart Contracts

Brief Announcement: Hierarchical Consensus

Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks

Brief Announcement: Byzantine-Tolerant Machine Learning

Brief Announcement: Fast Shared Counting using (O(n)) Compare-and-Swap Registers

Brief Announcement: Optimal Address-Oblivious Epidemic Dissemination

Brief Announcement: Distributed Approximation for Tree Augmentation

Brief Announcement: Gossiping with Latencies

Brief Announcement: Statement Voting and Liquid Democracy

Brief Announcement: Secure Self-Stabilizing Computation

Brief Announcement: Certified Multiplicative Weights Update: Verified Learning Without Regret

Brief Announcement: Fence Insertion for Straight-line Programs is in P

Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control

Brief Announcement: A Probabilistic Performance Model and Tuning Framework for Eventually Consistent Distributed Storage Systems

Brief Announcement: Rapid Asynchronous Plurality Consensus

Stateless Computation

Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets

Brief Announcement: Object Oriented Consensus

Broadcasting in Noisy Radio Networks

Content Provider	ACM Digital Library
Author	Censor-Hillel, Keren Zuzic, Goran Hershkowitz, D. Ellis Haeupler, Bernhard
Abstract	The widely-studied radio network model [Chlamtac and Kutten, 1985] is a graph-based description that captures the inherent impact of collisions in wireless communication. In this model, the strong assumption is made that node v receives a message from a neighbor if and only if exactly one of its neighbors broadcasts. We relax this assumption by introducing a new noisy radio network model in which random faults occur at senders or receivers. Specifically, for a constant noise parameter p ∈ [0,1), either every sender has probability p of transmitting noise or every receiver of a single transmission in its neighborhood has probability p of receiving noise. We first study single-message broadcast algorithms in noisy radio networks and show that the Decay algorithm [Bar-Yehuda et al., 1992] remains robust in the noisy model while the diameter-linear algorithm of Gasieniec et al., 2007 does not. We give a modified version of the algorithm of Gasieniec et al., 2007 that is robust to sender and receiver faults, and extend both this modified algorithm and the Decay algorithm to robust multi-message broadcast algorithms, broadcasting Ω(1/log n log log n) and Ω(1/log n) messages per round, respectively. We next investigate the extent to which (network) coding improves throughput in noisy radio networks. In particular, we study the coding cap -- the ratio of the throughput of coding to that of routing -- in noisy radio networks. We address the previously perplexing result of Alon et al. 2014 that worst case coding throughput is no better than worst case routing throughput up to constants: we show that the worst case throughput performance of coding is, in fact, superior to that of routing -- by a Θ(log(n)) gap -- provided receiver faults are introduced. However, we show that sender faults have little effect on throughput. In particular, we show that any coding or routing scheme for the noiseless setting can be transformed to be robust to sender faults with only a constant throughput overhead. These transformations imply that the results of Alon et al., 2014 carry over to noisy radio networks with sender faults as well. As a result, if sender faults are introduced then there exist topologies for which there is a Θ(log log n) gap, but the worst case throughput across all topologies is Θ(1/log n) for both coding and routing.
Starting Page	33
Ending Page	42
Page Count	10
File Format	PDF
ISBN	9781450349925
DOI	10.1145/3087801.3087808
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2017-07-25
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Network coding gaps Robust radio networks Radio networks Random linear network coding Network gossip
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in