Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On clustering in ad hoc networks
2003 (English)In: Swedish National Computer Networking Workshop - Proceedings: SNCNW 2003, Stockholm, 2003Conference paper, Published 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.
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-39530Local ID: e552ca70-980c-11dc-8ccb-000ea68e967bOAI: oai:DiVA.org:ltu-39530DiVA: diva2:1013044
Conference
Swedish National Computer Networking Workshop : 01/09/2003 - 02/09/2003
Note
Godkänd; 2003; 20071121 (ysko)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2017-11-25Bibliographically approved

Open Access in DiVA

fulltext(112 kB)