Theoretical Analysis of Geographic Routing in Social Networks
نویسندگان
چکیده
We introduce a formal model for geographic social networks, and introduce the notion of rank-based friendship, in which the probability that a person v is a friend of a person u is inversely proportional to the number of people w who live closer to u than v does. We then prove our main theorem, showing that rank-based friendship is a sufficient explanation of the navigability of any geographic social network that adheres to it. 1 A Model of Population Networks There are two key features that we wish to incorporate into our social-network model: geography and population density. We will first describe a very general abstract model; in later sections we examine a concrete grid-based instantiation of it. Definition 1.1 (Population network) A population network is a 5-tuple 〈L, d, P, loc, E〉 where • L is a finite set of locations ( , s, t, x, y, z, . . .); • d : L× L −→ R+ is an arbitrary distance function on the locations; • P is a finite ordered set of people (u, v, w, . . .); • loc : P −→ L is the location function, which maps people to the location in which they live; and • E ⊆ P × P is the set of friendships between people in the network. The ordering on people is required only to break ties when comparing distances between two people. Let P(L) denote the power set of L. Let pop : L −→ Z+ denote the population of each point on L, where pop( ) := |{u ∈ P : loc(u) = }|. We overload notation, and let pop : P(L) −→ Z+ denote the population of a subset of the locations, so that pop(L′) := ∑ ∈L′ pop( ). We will write n := pop(L) = |P | to denote the total population, and m := |L| to denote the total number of locations in the network. ∗IBM Almaden Research Center, 650 Harry Road, San Jose, CA 95120. ravi,jnovak,[email protected]. †MIT Computer Science and Artificial Intelligence Laboratory (CSAIL), 32 Vassar Street, Cambridge, MA 02139. [email protected]. The majority of this work was performed while the author was visiting the IBM Almaden Research Center. ‡Verity, Inc., 892 Ross Drive, Sunnyvale, CA 94089. [email protected]
منابع مشابه
EEQR: An Energy Efficient Query-Based Routing Protocol for Wireless Sensor Networks
Routing in Wireless Sensor Networks (WSNs) is a very challenging task due to the large number of nodes, their mobility and lack of proper infrastructure. Since the sensors are battery powered devices, energy efficiency is considered as one of the main factors in designing routing protocols in WSNs. Most of energy-aware routing protocols are mere energy savers that attempt to decrease the energy...
متن کاملEEQR: An Energy Efficient Query-Based Routing Protocol for Wireless Sensor Networks
Routing in Wireless Sensor Networks (WSNs) is a very challenging task due to the large number of nodes, their mobility and lack of proper infrastructure. Since the sensors are battery powered devices, energy efficiency is considered as one of the main factors in designing routing protocols in WSNs. Most of energy-aware routing protocols are mere energy savers that attempt to decrease the energy...
متن کاملRouting Hole Handling Techniques for Wireless Sensor Networks: A Review
A Wireless Sensor Network consists of several tiny devices which have the capability to sense and compute the environmental phenomenon. These sensor nodes are deployed in remote areas without any physical protections. A Wireless Sensor Network can have various types of anomalies due to some random deployment of nodes, obstruction and physical destructions. These anomalies can diminish the sensi...
متن کاملEnergy Efficiency and Reliability in Underwater Wireless Sensor Networks Using Cuckoo Optimizer Algorithm
Energy efficiency and reliability are widely understood to be one of the dominant considerations for Underwater Wireless Sensor Networks (UWSNs). In this paper, in order to maintain energy efficiency and reliability in a UWSN, Cuckoo Optimization Algorithm (COA) is adopted that is a combination of three techniques of geo-routing, multi-path routing, and Duty-Cycle mechanism. In the proposed alg...
متن کاملPerformance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...
متن کاملGreedy Geographic Routing is Good Enough in Sensing Covered Networks
This paper presents a theoretical analysis of greedy geographic routing protocols on a common class of wireless sensor networks that must provide sensing coverage over a geographic area. Contrary to well known results on random networks, we prove that the Greedy Geographic Forwarding and our new greedy protocol always succeed in any sensing covered network when the communication range is at lea...
متن کامل