Sciweavers

Share
37 search results - page 1 / 8
» Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
Sort
View
INFOCOM
2000
IEEE
11 years 9 months ago
Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
Alan D. Amis, Ravi Prakash, Dung Huynh, Thai Vuong
MOBIHOC
2005
ACM
12 years 5 months ago
Distributed low-cost backbone formation for wireless ad hoc networks
Yu Wang 0003, Weizhao Wang, Xiang-Yang Li
BROADNETS
2004
IEEE
11 years 9 months ago
A Distributed Mobile Backbone Formation Algorithm for Wireless Ad Hoc Networks
In this paper, we present a novel fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backbone...
Laura Huei-jiun Ju, Izhak Rubin, Kevin Ni, Christo...
CEE
2011
106views more  CEE 2011»
10 years 9 months ago
LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks
  Performance  of  ad  hoc  networks  dramatically  declines  as  network  grows.  Cluster  formation  in  which  the  network  hosts  are  hierarchically  part...
Javad Akbari Torkestani, Mohammad Reza Meybodi
ADHOC
2007
139views more  ADHOC 2007»
11 years 5 months ago
Bounded-distance multi-clusterhead formation in wireless ad hoc networks
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
Marco Aurélio Spohn, J. J. Garcia-Luna-Acev...
books