Sciweavers

1600 search results - page 174 / 320
» Clustering for opportunistic communication
Sort
View
JPDC
2007
191views more  JPDC 2007»
15 years 6 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
CCR
2002
98views more  CCR 2002»
15 years 6 months ago
Efficient flooding with Passive Clustering (PC) in ad hoc networks
An ad hoc network is a fast deployable selfconfiguring wireless network characterized by node mobility, dynamic topology structure, unreliable media and limited power supply. Node...
Taek Jin Kwon, Mario Gerla
KI
2010
Springer
15 years 4 months ago
Positions, Regions, and Clusters: Strata of Granularity in Location Modelling
Location models are data structures or knowledge bases used in Ubiquitous Computing for representing and reasoning about spatial relationships between so-called smart objects, i.e....
Hedda Rahel Schmidtke, Michael Beigl
MOBIHOC
2002
ACM
16 years 6 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
SASP
2009
IEEE
170views Hardware» more  SASP 2009»
16 years 1 months ago
Parade: A versatile parallel architecture for accelerating pulse train clustering
— In this paper, we present Parade, a novel and flexible parallel architecture for the deinterleaving of combined pulsetrains. This is a commonly performed task in various areas ...
Amin Ansari, Dan Zhang, Scott A. Mahlke