Deterministic broadcasting time in radio networks of unknown topology

No abstract is available for this paper.

• Publication year

  2002

• Venue

  The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.

• Publication date

  2002-11-16

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/SFCS.2002.1181883
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Centralized broadcast in multihop radio networks

  2003cited by this paper
• Explicit constructions of selectors and related combinatorial structures, with applications

  2002cited by this paper
• Deterministic broadcasting in ad hoc radio networks

  2002cited by this paper
• Faster broadcasting in unknown radio networks

  2001cited by this paper
• Selective families, superimposed codes, and broadcasting on unknown radio networks

  2001influential reference
• Deterministic broadcasting in unknown radio networks

  2000cited by this paper
• Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors

  2000influential reference
• Fast broadcasting and gossiping in radio networks

  2000cited by this paper
• Deterministic Radio Broadcasting

  2000cited by this paper
• AN Ω(D log(N/D)) LOWER BOUND FOR BROADCAST IN RADIO NETWORKS∗

  1998cited by this paper
• An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks

  1998cited by this paper
• Lower bounds for the broadcast problem in mobile radio networks

  1997cited by this paper
• Broadcast in radio networks

  1995cited by this paper
• The Time Complexity of Deterministic Broadcast Radio Networks

  1995cited by this paper
• Making transmission schedules immune to topology changes in multi-hop packet radio networks

  1993cited by this paper
• A Lower Bound for Radio Broadcast

  1991cited by this paper
• The wave expansion approach to broadcasting in multihop radio networks

  1991cited by this paper
• On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization

  1987influential reference
• On Broadcasting in Radio Networks - Problem Analysis and Protocol Design

  1985cited by this paper
• A New Distributed Depth-First-Search Algorithm

  1985cited by this paper
• Families of finite sets in which no set is covered by the union ofr others

  1985cited by this paper
• Nonrandom binary superimposed codes

  1964cited by this paper
• Proposed running head: The Complexity of Radio Broadcast Mailing address:

  year unknowninfluential reference

• Jamming-Resilient Message Dissemination in Wireless Networks

  2023cites this paper
• Distributed Broadcasting in Dynamic Networks

  2021cites this paper
• Consensus vs Broadcast, with and Without Noise (Extended Abstract)

  2020cites this paper
• Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise

  2018cites this paper
• Project Summary

  2018cites this paper
• Fully Dynamic Broadcasting under SINR

  2018cites this paper
• Distributed deterministic broadcasting algorithms under the SINR model

  2016cites this paper
• An Efficient Cooperative Neighbor Discovery Framework of Cognitive Radio Ad-Hoc Networks for Future Internet of Things

  2015cites this paper
• Broadcasting in Networks of Unknown Topology in the Presence of Swamping

  2014cites this paper
• Approximation Algorithms for Broadcasting in Simple Graphs with Intersecting Cycles

  2014cites this paper
• On the Message Complexity of Wirless Networks with Interference Avoidance

  2013influential citation
• The impact of mobility on the time complexity for deterministic broadcasting in radio networks

  2011cites this paper
• Broadcasting in Sensor Networks of Unknown Topology in the Presence of Swamping

  2010cites this paper
• Towards an Efficient Flooding Scheme Exploiting 2-Hop Backward Information in MANETs

  2009cites this paper
• Consensus and Mutual Exclusion in a Multiple Access Channel

  2009cites this paper
• The wireless synchronization problem

  2009cites this paper
• Interference-Resilient Information Exchange

  2009cites this paper
• Neighbour Discovery in Multi-Receiver Cognitive Radio Networks*

  2009cites this paper
• Efektywne szukanie stacji w sieciach o topologii kraty

  2009cites this paper
• The Abstract Mac Layer Publisher Association for Computing Machinery Accessed Terms of Use Detailed Terms the Abstract Mac Layer

  2009cites this paper
• The abstract MAC layer

  2009cites this paper
• On neighbor discovery in cognitive radio networks

  2009cites this paper
• Randomized Broadcasting in Radio Networks

  2008cites this paper
• Distributed broadcast in unknown radio networks

  2008cites this paper
• Improved lower bound for deterministic broadcasting in radio networks

  2008influential citation
• Neighbor Discovery in Multi-Receiver Cognitive Radio Networks ∗

  2008cites this paper
• Deterministic Models of Communication Faults

  2008cites this paper
• Time of Radio Broadcasting : Adaptiveness vs . Obliviousness and Randomization vs . Determinism

  2008influential citation
• Grid emulation for managing random sensor networks

  2008cites this paper
• Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks

  2008cites this paper
• Some combinatorial optimization problems on radio network communication and machine scheduling

  2008cites this paper
• On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm

  2007cites this paper
• Algorithms and LP-duality based lower bounds in ad-hoc Radio Networks

  2007cites this paper
• Distributed algorithms for resource allocation and routing

  2007cites this paper
• Randomized Broadcasting in Radio Networks , 1992

  2007cites this paper
• Topology and routing in overlay networks

  2007cites this paper
• A Location Aided Flooding Protocol for Wireless Ad Hoc Networks

  2007cites this paper
• Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks

  2007cites this paper
• An improved algorithm for radio broadcast

  2007cites this paper
• A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks

  2007cites this paper
• Energy efficient randomised communication in unknown AdHoc networks

  2006cites this paper
• Resource Discovery in Networks under Bandwidth Limitations

  2006cites this paper
• An Integrated Model of Wireless ad hoc Networks

  2006cites this paper
• Decoding LDPC Codes Over Integer Residue Rings

  2006cites this paper
• Managing Random Sensor Networks by means of Grid Emulation

  2006cites this paper
• Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes

  2006cites this paper
• Deterministic Communication in Radio Networks with Large Labels

  2006influential citation
• Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks

  2006cites this paper
• On selection problem in radio networks

  2005influential citation
• Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem

  2005cites this paper
• Broadcasting with locally bounded Byzantine faults

  2005cites this paper
• Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism

  2005cites this paper
• Node discovery in networks

  2005cites this paper
• On the Wake-Up Problem in Radio Networks

  2005cites this paper
• Efficient broadcasting and gathering in wireless ad-hoc networks

  2005cites this paper
• Improved schedule for radio broadcast

  2005cites this paper
• Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks

  2004cites this paper
• Logarithmic inapproximability of the radio broadcast problem

  2004cites this paper
• Polylogarithmic Inapproximability of the Radio Broadcast Problem

  2004cites this paper
• An Information Theoretic Lower Bound for Broadcasting in Radio Networks

  2004cites this paper
• A Lower Bound for Broadcasting in Mobile Ad Hoc Networks

  2004cites this paper
• A better wake-up in radio networks

  2004cites this paper
• Clustering mobile ad hoc networks using graph domination

  2004cites this paper
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

  2004influential citation
• Asynchronous Broadcast in Radio Networks

  2004cites this paper
• The join problem in dynamic network algorithms

  2004cites this paper
• Minimizing broadcast latency and redundancy in ad hoc networks

  2003cites this paper
• Faster Deterministic Broadcasting in Ad Hoc Radio Networks

  2003cites this paper
• Broadcasting algorithms in radio networks with unknown topology

  2003cites this paper
• Broadcasting in undirected ad hoc radio networks

  2003cites this paper
• Distributed broadcast in radio networks of unknown topology

  2003cites this paper