NDLI: On the complexity of radio communication

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

Multiparty protocols and logspace-hard pseudorandom sequences

Pseudo-random generation from one-way functions

A hard-core predicate for all one-way functions

Universal one-way hash functions and their cryptographic applications

Limits on the provable consequences of one-way permutations

A zero-one law for Boolean privacy

Verifiable secret sharing and multiparty protocols with honest majority

Designing programs that check their work

Provably fast integer factoring with quasi-uniform small quadratic residues

Functional interpretations of feasibly constructive arithmetic

Expressiveness of restricted recursive queries

On Ω-automata and temporal logic

Quantifier elimination in the theory of an algebraically-closed field

Probabilistic computation and linear time

The ismorphism conjecture fails relative to a random oracle

On the method of approximations

On the extended direct sum conjecture

Circuits and local computation

A general sequential time-space tradeoff for finding unique elements

On the theory of average case complexity

Tradeoffs between communication and space

Work-preserving emulations of fixed-connection networks

An O(logN) deterministic packet routing scheme

Fast computation using faulty hypercubes

Optimal size integer division circuits

On the complexity of radio communication

Local reorientation, global order, and planar topology

Parallel depth-first search in general directed graphs

Highly parallelizable problems

Optimal separations between concurrent-write parallel machines

CREW PRAMS and decision trees

Implicit O(1) probe search

The cell probe complexity of dynamic data structures

On aspects of university and performance for closed hashing

Verifying partial orders

A random polynomial time algorithm for approximating the volume of convex bodies

Lines in space-combinators, algorithms and applications

Polling: a new randomized sampling technique for computational geometry

Coordinate representation of order types requires exponential storage

Inference of finite automata using homing sequences

The minimum consistent DFA problem cannot be approximated within and polynomial

Crytographic limitations on learning Boolean formulae and finite automata

Proof of a conjecture of R. Kannan

Bounded concurrrent time-stamp systems are constructible

On the improbability of reaching Byzantine agreements

Compact distributed data structures for adaptive routing

Randomized distributed shortest paths algorithms

On search decision and the efficiency of polynomial-time algorithms

A new fixed point approach for stable networks stable marriages

Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs

An $O(n^{0.4})-approximation$ algorithm for 3-coloring

Trading space for time in undirected s-t connectivity

Expanding graphs and the average-case analysis of algorithms for matchings and related problems

Lower bounds on the length of universal traversal sequences

The electrical resistance of a graph captures its commute and cover times

On the second eigenvalue of random regular graphs

On the complexity of radio communication

Content Provider	ACM Digital Library
Author	Alon, N. Peleg, D. Linial, N. Bar-Noy, A.
Abstract	A radio network is a synchronous network of processors that communicate by transmitting messages to their neighbors. A processor receives a message in a given step if and only if it is silent then and precisely one of its neighbors transmits. This stringent rule poses serious difficulties in performing even the simplest tasks. This is true even under the overly optimistic assumptions of centralized coordination and complete knowledge of the network topology. This paper is concerned with lower and upper bounds for the complexity of realizing various communication primitives for radio networks.Our first result deals with the broadcast operation. We prove the existence of a family of radius-2 networks on n vertices for which any broadcast schedule requires at least &OHgr;(log2 n) rounds of transmissions. This matches an upper bound of O(log2 n) rounds for networks of radius 2 proved earlier by Bar-Yehuda, Goldreich and Itai [BGI]. It is worth mentioning that this lower bound holds even under optimal centralized coordination, while the (randomized) algorithm of [BGI] is distributed.We then look at the question of simulating two of the standard message-passing models on a radio network. Both models can easily simulate the radio model with no overhead. In the other direction, we propose and study a primitive called the single-round simulation (SRS), enabling the simulation of a single round of an algorithm designed for the standard message models. We give lower bounds for the length of SRS schedules for both models, and supply constructions or existence proofs for schedules of matching (or almost matching) lengths.Finally we give tight bounds for the length of schedules for computing census functions on a radio network.
Starting Page	274
Ending Page	285
Page Count	12
File Format	PDF
ISBN	0897913078
DOI	10.1145/73007.73033
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1989-02-01
Publisher Place	New York
Access Restriction	Subscribed
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