Sciweavers

522 search results - page 8 / 105
» Connected k-Hop Clustering in Ad Hoc Networks
Sort
View
CEE
2011
106views more  CEE 2011»
12 years 11 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
DCOSS
2011
Springer
12 years 7 months ago
Construction of connected dominating sets in large-scale MANETs exploiting self-stabilization
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
Stefan Unterschutz, Volker Turau
ADHOC
2005
122views more  ADHOC 2005»
13 years 7 months ago
Maintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clusterin...
Yuanzhu Peter Chen, Arthur L. Liestman
SEFM
2008
IEEE
14 years 2 months ago
Restricted Broadcast Process Theory
We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. In our algebra we model the essential modeling concepts of ad ho...
Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar
AHSWN
2008
92views more  AHSWN 2008»
13 years 7 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal