Energy efficient randomised communication in unknown AdHoc networks

DOI10.1016/j.tcs.2009.02.002zbMath1172.68002OpenAlexW2088334991MaRDI QIDQ1029326

Colin Cooper, Zengjian Hu, Petra Berenbrink

Publication date: 10 July 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.002

zbMATH Keywords

gossipingbroadcastingrandomised algorithmsAdHoc networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Randomized algorithms (68W20)

Related Items (11)

Efficient broadcasting in radio networks with long-range interference ⋮ Fast message dissemination in random geometric networks ⋮ Time efficient \(k\)-shot broadcasting in known topology radio networks ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ Unnamed Item ⋮ On Radio Broadcasting in Random Geometric Graphs ⋮ Energy-efficient broadcasting in ad hoc wireless networks ⋮ Message and time efficient multi-broadcast schemes ⋮ On Efficient Gossiping in Radio Networks ⋮ Efficient and competitive broadcast in multi-channel radio networks

Uses Software

• TAG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for radio broadcast
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• Negotiation-based protocols for disseminating information in wireless sensor networks
• The critical behavior of random digraphs
• Multiple Communication in Multihop Radio Networks
• Fast broadcasting and gossiping in radio networks
• A random graph model for massive graphs
• On the diameter of a class of random graphs
• The phase transition in the evolution of random digraphs
• Average-Time Complexity of Gossiping in Radio Networks
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
• Power consumption in packet radio networks
• Probability and Computing
• Broadcasting algorithms in radio networks with unknown topology
• Broadcasting in undirected ad hoc radio networks
• The diameter of sparse random graphs

This page was built for publication: Energy efficient randomised communication in unknown AdHoc networks