A PTAS for minimum d-hop connected dominating set in growth-bounded graphs

A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks

Xiuzhen Cheng, Xiao Huang, Deying Li et al. · Networks · 2003 · 333 citations

Computing, Computer Science, Computer Networks +13

Connectivity based k-hop clustering in wireless networks

Geng Chen, Fabián García Nocetti, Ivan Stojmenović · 2003 · 260 citations

Computing, Computer Science, Computer Networks +13

Connectivity Based k-Hop Clustering in Wireless Networks

Fabián García Nocetti · Telecommunication Systems · 2003 · 176 citations

Computing, Computer Science, Computer Networks +13

Virtual backbone construction in multihop <i>ad hoc</i> wireless networks

Xiuzhen Cheng, Min Ding, David Hongwei Du et al. · Wireless Communications and Mobile Computing · 2006 · 124 citations

Computing, Computer Science, Computer Networks +16

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

Michael Q. Rieck, Sukesh Pai, Subhankar Dhar · Computer Networks · 2004 · 38 citations · Full text

Computing, Computer Science, Computer Networks +12