Energy efficient randomised communication in unknown AdHoc networks

DOI10.1016/J.TCS.2009.02.002MaRDI QIDQ1029326zbMATH OpenOpenAlexFDO

Authors Petra Berenbrink, Colin Cooper, Zengjian Hu

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

broadcastinggossipingrandomised algorithmsAdHoc networks

Mathematics Subject Classification ID

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

Recommendations

• Energy-efficient broadcasting in ad hoc wireless networks
• Efficient distributed communication in ad-hoc radio networks
• Total energy optimal multicasting in wireless ad hoc networks
• Minimum-energy broadcasting in static ad hoc wireless networks
• Algorithmic Applications in Management
• A robust and energy efficient protocol for random walk in ad hoc networks with IEEE 802.11

Cites work

• scientific article; zbMATH DE number 1796990 (Why is no real title available?)
• scientific article; zbMATH DE number 2089989 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• A lower bound for radio broadcast
• A random graph model for massive graphs
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• Average-Time Complexity of Gossiping in Radio Networks
• Broadcasting algorithms in radio networks with unknown topology
• Broadcasting in undirected ad hoc radio networks
• Fast broadcasting and gossiping in radio networks
• Multiple Communication in Multihop Radio Networks
• Negotiation-based protocols for disseminating information in wireless sensor networks
• On the diameter of a class of random graphs
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Power consumption in packet radio networks (extended abstract)
• Probability and Computing
• Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
• The bin-covering technique for thresholding random geometric graph properties
• The critical behavior of random digraphs
• The diameter of random massive graphs
• The diameter of sparse random graphs
• The phase transition in the evolution of random digraphs
• Time of Deterministic Broadcasting in Radio Networks with Local Knowledge

Cited in

(13)

• A robust and energy efficient protocol for random walk in ad hoc networks with IEEE 802.11
• Efficient and competitive broadcast in multi-channel radio networks
• The energy complexity of diameter and minimum cut computation in bounded-genus networks
• Message and time efficient multi-broadcast schemes
• On Radio Broadcasting in Random Geometric Graphs
• Fast message dissemination in random geometric networks
• Energy-optimal algorithms for computing aggregative functions in random networks
• The energy complexity of diameter and minimum cut computation in bounded-genus networks
• Efficient broadcasting in radio networks with long-range interference
• On Efficient Gossiping in Radio Networks
• Time efficient k-shot broadcasting in known topology radio networks
• Energy-efficient broadcasting in ad hoc wireless networks
• scientific article; zbMATH DE number 7378397 (Why is no real title available?)

Describes a project that uses

Uses Software

• TAG

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029326)