RNG RELAY SUBSET FLOODING PROTOCOLS IN MOBILE AD-HOC NETWORKS

DOI10.1142/S0129054103001716zbMATH Open1075.68549OpenAlexW2061415565MaRDI QIDQ5696907FDOQ5696907

Authors: Julien Cartigny, François Ingelrest, David Simplot 

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/s0129054103001716

Recommendations

• scientific article; zbMATH DE number 2088547
• scientific article; zbMATH DE number 2006659
• ON THE LONGEST RNG EDGE OF WIRELESS AD HOC NETWORKS
• AHBP: An efficient broadcast protocol for mobile ad hoc networks
• The broadcast storm problem in a mobile ad hoc network

zbMATH Keywords

broadcastwireless networksad-hoc networkslocalized algorithmsneighbor elimination scheme

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Cites Work

• The relative neighbourhood graph of a finite planar set
• The broadcast storm problem in a mobile ad hoc network

Cited In (1)

• ON THE LONGEST RNG EDGE OF WIRELESS AD HOC NETWORKS

This page was built for publication: RNG RELAY SUBSET FLOODING PROTOCOLS IN MOBILE AD-HOC NETWORKS

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