Loading...
Please wait, while we are loading the content...
Similar Documents
Small-Worlds: Strong Clustering in Wireless Networks
| Content Provider | CiteSeerX |
|---|---|
| Author | Brust, Matthias R. Rothkugel, Steffen |
| Abstract | Abstract. 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. Key words: Topology Control, Small-Worlds, Wireless Network. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Wireless Network Strong Clustering Small Characteristic Path Length 2-localized Algorithm Reckful Roaming Small-worlds Represent Efficient Communication Network Overall Clustering Coefficient Topology Control Superfluous Link High Clustering Coefficient Interesting Paradox |
| Content Type | Text |
| Resource Type | Article |
