A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper, we consider the problem of recognizing groups of similar nodes within a mobile network. Nodes belonging to the same group have the same preferences, e.g., in terms of friendship with other nodes. However, due to limited communication range, each node has a partial view of the network and is aware only of its friendship relationships with the immediate neighbors. Depending on how large the communication range actually is, the problem can be in principle solved by clustering nodes,doi:10.1109/glocomw.2015.7414209 dblp:conf/globecom/GuglielmiB15 fatcat:voy2oardezf63oq4gyhth3jdaa