Energy efficient randomised communication in unknown AdHoc networks

DOI10.1016/J.TCS.2009.02.002zbMATH Open1172.68002OpenAlexW2088334991MaRDI QIDQ1029326FDOQ1029326

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

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

zbMATH Keywords

broadcastinggossipingrandomised algorithmsAdHoc networks

Mathematics Subject Classification ID

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

Cites Work

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

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
• The energy complexity of diameter and minimum cut computation in bounded-genus networks
• Energy-optimal algorithms for computing aggregative functions in random 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
• Title not available (Why is that?)
• Energy-efficient broadcasting in ad hoc wireless networks

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)