BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING

DOI10.1142/S0129054103001686MaRDI QIDQ5696902zbMATH OpenOpenAlexWikidataFDO

Authors Jie Wu, Fei Dai

Publication date 19 October 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054103001686

zbMATH Keywords

ad hoc networksbroadcastinglocalized algorithmspruning

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 2040806
• The broadcast storm problem in a mobile ad hoc network
• Distributed deterministic broadcasting in uniform-power ad hoc wireless networks
• Deterministic broadcasting in ad hoc radio networks
• Network information broadcasting in narrow band self-organizing networks

Cites work

• Approximation algorithms for connected dominating sets
• The broadcast storm problem in a mobile ad hoc network

Cited in

(6)

• An efficient network-wide broadcasting based on hop-limited shortest-path trees
• Improving Inter-cluster Broadcasting in Ad Hoc Networks by Delayed Flooding
• Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
• Efficient local search based on dynamic connectivity maintenance for minimum connected dominating set
• Network information broadcasting in narrow band self-organizing networks
• A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets

Describes a project that uses

Uses Software

• AHBP

This page was built for publication: BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING

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