487 search results - page 15 / 98 » A Weight Based Distributed Clustering Algorithm for Mobile a... |
ICPP
2005
IEEE
14 years 1 months ago
2005
IEEE
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...
WCNC
2008
IEEE
14 years 2 months ago
2008
IEEE
—We present link-diversity routing, a routing paradigm that achieves high path resilience in mobile ad hoc networks. Link-diversity routing chooses each hop of a packet’s route...
JISE
2008
13 years 6 months ago
2008
TMC
2008
13 years 7 months ago
2008
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 ...
VTC
2007
IEEE
14 years 2 months ago
2007
IEEE
— This paper discusses a joint decentralized clustering and ranging algorithm for wireless ad-hoc sensor networks. Each sensor uses a random waiting timer and local criteria to d...