Small Worlds: Strong Clustering in Wireless Networks

Details Small Worlds: Strong Clustering in Wireless Networks Small Worlds: Strong Clustering in Wireless Networks

2007-06-07

arxiv.org/abs/0706.1063v2

Computer Science

Networking and Internet Architecture

To appear in: 1st International Workshop on Localized Algorithms and Protocols for Wireless Sensor Networks (LOCALGOS 2007), 2

Scientific paper

Small-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.

Affiliated with

Also associated with

No associations

Rating

Small Worlds: Strong Clustering in Wireless Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Small Worlds: Strong Clustering in Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Small Worlds: Strong Clustering in Wireless Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-442488