Distributed routing algorithms for multi-hop ad hoc networks using \(d\)-hop connected \(d\)-dominating sets

DOI10.1016/J.COMNET.2004.09.005zbMath1075.68540OpenAlexW2093007861MaRDI QIDQ1775042

Michael Q. Rieck, Subhankar Dhar, Sukesh Pai

Publication date: 4 May 2005

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2004.09.005

zbMATH Keywords

Routing algorithmAd hoc wireless networks\(D\)-closure\(D\)-dominating set

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs ⋮ TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET

This page was built for publication: Distributed routing algorithms for multi-hop ad hoc networks using \(d\)-hop connected \(d\)-dominating sets