On clustering in ad hoc networks
2003 (English)In: Swedish National Computer Networking Workshop - Proceedings: SNCNW 2003, Stockholm, 2003Conference paper (Other academic)
This paper presents the reasons for clustering algorithms in ad hoc networks, as well as a short survey of the basic ideas and priorities of existing clustering algorithms. A new algorithm is presented. It makes it possible to define a limit for the maximum size of the clusters as well as the maximum number of hops between a node and its clusterhead.
Place, publisher, year, edition, pages
Research subject Dependable Communication and Computation Systems
IdentifiersURN: urn:nbn:se:ltu:diva-39530Local ID: e552ca70-980c-11dc-8ccb-000ea68e967bOAI: oai:DiVA.org:ltu-39530DiVA: diva2:1013044
Swedish National Computer Networking Workshop : 01/09/2003 - 02/09/2003
Godkänd; 2003; 20071121 (ysko)2016-10-032016-10-03Bibliographically approved