Implementation of Social Network Algorithm

Abstract

Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult due to the fact that the network graph is rarely connected. A key challenge is to find a route that can provide good delivery performance and low end-to-end delay in a disconnected network graph where nodes may move freely. In this project we seek to improve our understanding of human mobility in terms of social structures, and to use these structures in the design of forwarding algorithms for Pocket Switched Networks (PSNs). Taking human mobility traces from the real world, we discover that human interaction is heterogeneous both in terms of centrality (popular individuals) and communities. The social network algorithms are used to detect centrality and community in a graph. We also show how these algorithms can be implemented in a distributed way, which demonstrates that it is applicable in the decentralized environment of PSNs.