connected k-hop | Sciweavers

TMC
2008

125views more TMC 2008»

Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks

14 years 13 days ago

Download dclab.cs.nthu.edu.tw

A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...

Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai

claim paper

Read More »

click to vote

ICPP
2005
IEEE

129views Distributed And Parallel Com...» more ICPP 2005»

Connected k-Hop Clustering in Ad Hoc Networks

14 years 6 months ago

Download www.cis.temple.edu

In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...

Shuhui Yang, Jie Wu, Jiannong Cao

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers