A dominating-set-based routing scheme in ad hoc wireless networks

DOI10.1023/A:1016783217662zbMath1021.68002OpenAlexW1567009542MaRDI QIDQ5955435

Jie Wu, Hailan Li

Publication date: 13 February 2002

Published in: Telecommunication Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1016783217662

zbMATH Keywords

routingad hoc wireless networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (13)

Bank supervision using the threshold-minimum dominating set ⋮ A survey on position-based routing algorithms in wireless sensor networks ⋮ Statistical mechanics of the minimum dominating set problem ⋮ Linear-time algorithm for paired-domination on distance-hereditary graphs ⋮ Energy-efficient distributed clustering in wireless sensor networks ⋮ Minimal dominating set problem studied by simulated annealing and cavity method: analytics and population dynamics ⋮ On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size ⋮ Local solutions for global problems in wireless networks ⋮ Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph ⋮ AHBP: An efficient broadcast protocol for mobile ad hoc networks ⋮ Enumeration of Minimal Dominating Sets and Variants ⋮ Linear separation of connected dominating sets in graphs ⋮ The incremental subgradient methods on distributed estimations in-network

This page was built for publication: A dominating-set-based routing scheme in ad hoc wireless networks