Change search
ReferencesLink to record
Permanent link

Direct link
On clustering in ad hoc networks
2003 (English)In: Swedish National Computer Networking Workshop - Proceedings: SNCNW 2003, Stockholm, 2003Conference paper (Other academic)
Abstract [en]

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
Stockholm, 2003.
Research subject
Dependable Communication and Computation Systems
URN: urn:nbn:se:ltu:diva-39530Local ID: e552ca70-980c-11dc-8ccb-000ea68e967bOAI: diva2:1013044
Swedish National Computer Networking Workshop : 01/09/2003 - 02/09/2003
Godkänd; 2003; 20071121 (ysko)Available from: 2016-10-03 Created: 2016-10-03Bibliographically approved

Open Access in DiVA

fulltext(112 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 112 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Carr-Motyckova, LenkaJohansson, Tomas

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link