A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
K-clustering in wireless ad hoc networks
2002
Proceedings of the second ACM international workshop on Principles of mobile computing - POMC '02
Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Clustering is commonly used in order to limit the amount of routing information stored and maintained at individual hosts. A k-clustering is a framework in which the wireless network is divided into non-overlapping sub networks, also referred to as clusters, and where every two wireless hosts in a sub network are at most k hops from each other. The algorithmic complexity of
doi:10.1145/584490.584497
dblp:conf/pomc/FernandessM02
fatcat:oma6qvh2krdbhb5bqipfeafygu