Broadcasting in UDG radio networks with unknown topology

No abstract is available for this paper.

• Publication year

  2007

• Venue

  ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

• Publication date

  2007-08-12

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/s00446-008-0075-z
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Distributed broadcast in unknown radio networks

  2008cited by this paper
• On the effect of the deployment setting on broadcasting in Euclidean radio networks

  2008cited by this paper
• Broadcasting in geometric radio networks

  2007cited by this paper
• Optimal Deterministic Broadcasting in Known Topology Radio Networks

  2006cited by this paper
• The bin-covering technique for thresholding random geometric graph properties

  2005cited by this paper
• Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks

  2005cited by this paper
• Improved schedule for radio broadcast

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

  2005cited by this paper
• On the Cover Time of Random Geometric Graphs

  2005cited by this paper
• Coloring unstructured radio networks

  2005cited by this paper
• Faster communication in known topology radio networks

  2005cited by this paper
• Maximal independent sets in radio networks

  2005cited by this paper
• The wake-up problem in multi-hop radio networks

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

  2004cited by this paper
• Time of Deterministic Broadcasting in Radio Networks with Local Knowledge

  2004cited by this paper
• Ad hoc networks beyond unit disk graphs

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

  2003cited by this paper
• Broadcasting in undirected ad hoc radio networks

  2003cited by this paper
• Centralized broadcast in multihop radio networks

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

  2002cited by this paper
• The impact of information on broadcasting time in linear radio networks

  2002cited by this paper
• Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks

  2002cited by this paper
• Fault-Tolerant Broadcasting in Radio Networks

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

  2001cited by this paper
• Fast broadcasting and gossiping in radio networks

  2000cited by this paper
• Deterministic Radio Broadcasting

  2000cited by this paper
• Deterministic broadcasting in unknown radio networks

  2000cited by this paper
• The Wakeup Problem in Synchronous Broadcast Systems

  2000cited by this paper
• The Impact of Knowledge on Broadcasting Time in Radio Networks

  1999cited 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
• A new model for scheduling packet radio networks

  1996cited by this paper
• Broadcasting on [0, L]

  1994cited by this paper
• An Ω(D log(N/D)) lower bound for broadcast in 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

  1987cited by this paper
• On Broadcasting in Radio Networks - Problem Analysis and Protocol Design

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

  year unknowncited by this paper

• Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization

  2023cites this paper
• Token traversal in ad hoc wireless networks via implicit carrier sensing

  2020cites this paper
• Universal stability in multi-hop radio networks

  2020cites this paper
• Achieving Dilution without Knowledge of Coordinates in the SINR Model

  2017cites this paper
• Deterministic Digital Clustering of Wireless Ad Hoc Networks

  2017cites this paper
• Deterministic Backbone Creation in an SINR Network without Knowledge of Location

  2017cites this paper
• Deterministic Protocols in the SINR Model without Knowledge of Coordinates

  2017cites this paper
• Token Traversal in Ad Hoc Wireless Networks via Implicit Carrier Sensing

  2017cites this paper
• Universal Routing in Multi-hop Radio Networks

  2016cites this paper
• Brief Announcement: Multi-Broadcasting under the SINR Model

  2016cites this paper
• On the complexity of neighbourhood learning in radio networks

  2015cites this paper
• Multi-Broadcasting under the SINR Model

  2015influential citation
• Broadcasting in Networks of Unknown Topology in the Presence of Swamping

  2014cites this paper
• Deterministic Neighbourhood Learning in Ad Hoc Wireless Radio Networks

  2014cites this paper
• Universal routing in multi hop radio network

  2014cites this paper
• Message and time efficient multi-broadcast schemes

  2013cites this paper
• Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks

  2013cites this paper
• Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)

  2013cites this paper
• Distributed Broadcasting in Wireless Networks under the SINR Model

  2012cites this paper
• Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks

  2012cites this paper
• Distributed Deterministic Broadcasting in Wireless Networks under the SINR Model

  2012cites this paper
• Gossiping in one-dimensional synchronous ad hoc wireless radio networks

  2012cites this paper
• Distributed backbone structure for deterministic algorithms in the SINR model of wireless networks

  2012cites this paper
• Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems

  2012cites this paper
• Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices

  2012cites this paper
• Fast message dissemination in random geometric networks

  2011cites this paper
• Synchronous Rendezvous for Location-Aware Agents

  2011cites this paper
• Communication algorithms with advice

  2010cites this paper
• Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids

  2010cites this paper
• Tell Me Where I Am So I Can Meet You Sooner

  2010cites this paper
• Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony

  2010cites this paper
• Time-Efficient Broadcast in Radio Networks

  2010influential citation
• Optimal Memory-aware Sensor Network Gossiping ⋆

  2009cites this paper
• On Radio Broadcasting in Random Geometric Graphs

  2008cites this paper
• Acknowledged broadcasting in ad hoc radio networks

  2008cites this paper
• Interference-Aware Broadcast Scheduling in Wireless Networks

  2008cites this paper
• Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges

  2008cites this paper
• Impact of Information on the Complexity of Asynchronous Radio Broadcasting

  2008cites this paper
• Fast radio broadcasting with advice

  2008cites this paper
• On the effect of the deployment setting on broadcasting in Euclidean radio networks

  2008cites this paper
• Broadcasting in UDG radio networks with missing and inaccurate information

  2008cites this paper
• Time-Efficient Broadcasting in Radio Networks: A Review

  2007influential citation
• A tight upper bound on the probabilistic embedding of series-parallel graphs

  2006cites this paper