Sciweavers

969 search results - page 6 / 194
» Distributed Clustering for Ad Hoc Networks
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 4 months ago
Information-theoretic Capacity of Clustered Random Networks
Abstract-We analyze the capacity scaling laws of clustered ad hoc networks in which nodes are distributed according to a doubly stochastic shotnoise Cox process. We identify five d...
Michele Garetto, Alessandro Nordio, Carla-Fabiana ...
ICPP
2005
IEEE
15 years 10 months ago
Connected k-Hop Clustering in Ad Hoc Networks
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
ICC
2007
IEEE
186views Communications» more  ICC 2007»
15 years 10 months ago
An Efficient Cluster-Based Proactive Secret Share Update Scheme for Mobile Ad Hoc Networks
– When implementing public key security ser- easy for an adversary to collect data and attack. To solve this vices in mobile ad hoc networks (MANETs), multiple problem, the distr...
Ying Dong, Ai Fen Sui, Siu-Ming Yiu, Victor O. K. ...
CLUSTER
2004
IEEE
15 years 4 months ago
Resource Management for Ad-Hoc Wireless Networks with Cluster Organization
Boosted by technology advancements, government and commercial interest, ad-hoc wireless networks are emerging as a serious platform for distributed mission-critical applications. G...
Ionut Cardei, Srivatsan Varadarajan, Allalaghatta ...
MOBIHOC
2002
ACM
16 years 3 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman