scientific article; zbMATH DE number 6907966

DOI10.3969/J.ISSN.1001-0548.2017.06.004MaRDI QIDQ3175799zbMATH OpenFDO

Authors Qingdong Huang, Qiaoqiao Yan, Qing Sun

Publication date 18 July 2018

zbMATH Keywords

topologydominating setsroutingundirected graphad hoc wireless networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication theory (94A05) Communication networks in operations research (90B18)

Recommendations

• An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
• A dominating-set-based routing scheme in ad hoc wireless networks
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks
• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
• Clustering wireless ad hoc networks with weakly connected dominating set

Cited in

(1)

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

This page was built for publication:

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