The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Random Structures & Algorithms
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Analyzing Kleinberg's (and other) small-world Models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On a conjecture related to geometric routing
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Could any graph be turned into a small-world?
Theoretical Computer Science - Complex networks
A Distributed Geometric Routing Algorithm for Ad HocWireless Networks
ITNG '07 Proceedings of the International Conference on Information Technology
Succinct Greedy Geometric Routing in the Euclidean Plane
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Some Results on Greedy Embeddings in Metric Spaces
Discrete & Computational Geometry
Hi-index | 5.23 |
A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as ''he is a prominent lawyer in Boston'' or ''she is a Freshman sociology major at Harvard''). That is, these networks have very short paths between pairs of nodes (the so-called small-world phenomenon); moreover, participants are able to route messages along these paths even though each person is only aware of a small part of the network topology. Some sociologists conjecture that participants in such scenarios use a greedy routing strategy in which they forward messages to acquaintances that have more categories in common with the recipient than they do, and similar strategies have recently been proposed for routing messages in dynamic ad hoc networks of mobile devices. In this paper, we introduce a network property called membership dimension, which characterizes the cognitive load required to maintain relationships between participants and categories in a social network. We show that any connected network has a system of categories that will support greedy routing, but that these categories can be made to have small membership dimension if and only if the underlying network exhibits the small-world phenomenon.