Small Worlds: Strong Clustering in Wireless Networks

Simple item page
dc.creatorBrust, Matthias R.
dc.creatorRothkugel, Steffen
dc.date2007-06-07
dc.date2007-06-11
dc.date.accessioned2026-07-07T08:04:34Z
dc.date.available2026-07-07T08:04:34Z
dc.descriptionSmall-worlds represent efficient communication networks that obey two distinguishing characteristics: a high clustering coefficient together with a small characteristic path length. This paper focuses on an interesting paradox, that removing links in a network can increase the overall clustering coefficient. Reckful Roaming, as introduced in this paper, is a 2-localized algorithm that takes advantage of this paradox in order to selectively remove superfluous links, this way optimizing the clustering coefficient while still retaining a sufficiently small characteristic path length.
dc.descriptionTo appear in: 1st International Workshop on Localized Algorithms and Protocols for Wireless Sensor Networks (LOCALGOS 2007), 2007, IEEE Compuster Society Press
dc.identifierhttps://arxiv.org/abs/0706.1063
dc.identifierhttp://arxiv.org/abs/0706.1063
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130012
dc.subjectNetworking and Internet Architecture
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectData Structures and Algorithms
dc.titleSmall Worlds: Strong Clustering in Wireless Networks
dc.typetext

Files

Collections

arXiv