Social-tie based content retrieval for delay-tolerant mobile ad-hoc networks

Abstract

Previous studies have shown that social networking can assist delaytolerant routing design in many respects. In this paper, we specifically address content retrieval in delay-tolerant mobile ad-hoc networks. We propose a social-tie based content retrieval scheme to support the delay-tolerant MANET. The social hierarchy is structured using balanced connectivity criteria and a K-mean clustering algorithm. The proposed scheme has been evaluated and validated on a real social network dataset.

Employing Social Cooperation to Improve Data Discovery and Retrieval in Content-Centric Delay-Tolerant Networks

“…Lu et al [19], [23] proposed the social-tie concept as a combination of the concepts of frequency and freshness. Frequency is a metric to evaluate how frequently two nodes meet each other, while freshness is a metric to evaluate how recently two nodes have met each other.…”

“…Unlike Lu et al [19], [23], DIRESC ignores the global relationship in the network (i.e., the nodes centrality) and employs R i (j) only to define the local relationship between neighbor nodes. In other words, the social-tie array of the node i is kept locally.…”

“…Within this scope, there are several DTN/OppNet routing proposals that consider knowledge about the social relationship among network nodes, such as Simbet [15], Sim-BetTS [16], Bubble Rap [17], dLife [18], SCORP [13], and STCR [19] to name a few. Hence, our work aims to improve relay node selection strategies such as [20], [21], and [22] by defining a local relationship between neighbor nodes in CCDTN environment.…”