<s>
KHOPCA	B-Algorithm
is	O
an	O
adaptive	O
clustering	B-Algorithm
algorithm	I-Algorithm
originally	O
developed	O
for	O
dynamic	O
networks	O
.	O
</s>
<s>
KHOPCA	B-Algorithm
(	O
-hop	O
clustering	B-Algorithm
algorithm	I-Algorithm
)	O
provides	O
a	O
fully	O
distributed	B-Architecture
and	O
localized	O
approach	O
to	O
group	O
elements	O
such	O
as	O
nodes	O
in	O
a	O
network	O
according	O
to	O
their	O
distance	O
from	O
each	O
other	O
.	O
</s>
<s>
KHOPCA	B-Algorithm
operates	O
proactively	O
through	O
a	O
simple	O
set	O
of	O
rules	O
that	O
defines	O
clusters	O
,	O
which	O
are	O
optimal	O
with	O
respect	O
to	O
the	O
applied	O
distance	O
function	O
.	O
</s>
<s>
KHOPCA	B-Algorithm
's	O
clustering	O
process	O
explicitly	O
supports	O
joining	O
and	O
leaving	O
of	O
nodes	O
,	O
which	O
makes	O
KHOPCA	B-Algorithm
suitable	O
for	O
highly	O
dynamic	O
networks	O
.	O
</s>
<s>
However	O
,	O
it	O
has	O
been	O
demonstrated	O
that	O
KHOPCA	B-Algorithm
also	O
performs	O
in	O
static	O
networks	O
.	O
</s>
<s>
Besides	O
applications	O
in	O
ad	O
hoc	O
and	O
wireless	B-Architecture
sensor	I-Architecture
networks	I-Architecture
,	O
KHOPCA	B-Algorithm
can	O
be	O
used	O
in	O
localization	O
and	O
navigation	O
problems	O
,	O
networked	O
swarming	B-Architecture
,	O
and	O
real-time	O
data	B-Algorithm
clustering	I-Algorithm
and	I-Algorithm
analysis	I-Algorithm
.	O
</s>
<s>
KHOPCA	B-Algorithm
(	O
-hop	O
clustering	B-Algorithm
algorithm	I-Algorithm
)	O
operates	O
proactively	O
through	O
a	O
simple	O
set	O
of	O
rules	O
that	O
defines	O
clusters	O
with	O
variable	O
-hops	O
.	O
</s>
<s>
KHOPCA	B-Algorithm
does	O
not	O
require	O
any	O
predetermined	O
initial	O
configuration	O
.	O
</s>
<s>
KHOPCA	B-Algorithm
acting	O
in	O
a	O
dynamic	O
2-D	O
simulation	O
.	O
</s>
<s>
KHOPCA	B-Algorithm
also	O
works	O
in	O
a	O
dynamic	O
3-D	O
environment	O
.	O
</s>
<s>
It	O
has	O
been	O
demonstrated	O
that	O
KHOPCA	B-Algorithm
terminates	O
after	O
a	O
finite	O
number	O
of	O
state	O
transitions	O
in	O
static	O
networks	O
.	O
</s>
