BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING

DOI10.1142/S0129054103001686zbMath1075.68543OpenAlexW2096170321WikidataQ111519479 ScholiaQ111519479MaRDI QIDQ5696902

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

pruningad hoc networksbroadcastinglocalized algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (3)

A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets ⋮ Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks ⋮ Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set

Uses Software

• AHBP

Cites Work

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

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