Energy and Time Efficient Broadcasting in Known Topology Radio Networks

No abstract is available for this paper.

• Publication year

  2007

• Venue

  International Symposium on Distributed Computing

• Publication date

  2007-09-24

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-540-75142-7_21
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Optimal Deterministic Broadcasting in Known Topology Radio Networks

  2006cited by this paper
• Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs

  2006cited by this paper
• Faster Centralized Communication in Radio Networks

  2006cited by this paper
• Energy efficient randomised communication in unknown AdHoc networks

  2006cited by this paper
• An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks

  2005cited by this paper
• Improved schedule for radio broadcast

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

  2005cited by this paper
• Tighter bounds for the minimum energy broadcasting problem

  2005influential reference
• Time Efficient Gossiping in Known Radio Networks

  2004cited by this paper
• Improved Approximation Results for the Minimum Energy Broadcasting Problem

  2004cited by this paper
• Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem

  2004cited by this paper
• Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks

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

  2003cited by this paper
• On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs

  2001cited by this paper
• Minimum-energy broadcast routing in static ad hoc wireless networks

  2001cited by this paper
• Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets

  1998cited by this paper
• Approximation Algorithms for Connected Dominating Sets

  1996cited by this paper
• An efficient parallel algorithm that finds independent sets of guaranteed size

  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 Observing Nondeterminism and Concurrency

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

  year unknowncited by this paper

• The Energy Complexity of Las Vegas Leader Election

  2022cites this paper
• How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks

  2022cites this paper
• Brief Announcement: Resource Competitive Broadcast against Adaptive Adversary in Multi-channel Radio Networks

  2020cites this paper
• The Energy Complexity of BFS in Radio Networks

  2020cites this paper
• Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks

  2020cites this paper
• Contention resolution on a restrained channel

  2020cites this paper
• Fast and Resource Competitive Broadcast in Multi-channel Radio Networks

  2019cites this paper
• The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks

  2018cites this paper
• Power Constrained Parallel Queuing with Contention

  2018cites this paper
• Energy Complexity of Distance Computation in Multi-hop Networks

  2018cites this paper
• The Energy Complexity of Broadcast

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

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

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

  2007cites this paper