Social-Aware Multicast in Disruption-Tolerant Networks

Abstract

Abstract-Node mobility and end-to-end disconnections in disruption-tolerant networks (DTNs) greatly impair the effectiveness of data forwarding. Although social-based approaches can address the problem, most existing solutions only focus on forwarding data to a single destination. In this paper, we study multicast with single and multiple data items in DTNs from a social network perspective, develop analytical models for multicast relay selection, and furthermore investigate the essential difference between multicast and unicast in DTNs. The proposed approach selects relays according to their capabilities, measured by social-based metrics, for forwarding data to the destinations. The design of social-based metrics exploits social network concepts such as node centrality and social community, and the selected relays ensure achieving the required data delivery ratio within the given time constraint. Extensive trace-driven simulations show that the proposed approach has similar data delivery ratio and delay to that of Epidemic routing, but significantly reduces data forwarding cost, measured by the number of relays used.

Selfish Mules: Social Profit Maximization in Sparse Sensornets using Rationally-Selfish Human Relays

“…Social network metrics, centrality and community structure, have been used for many opportunistic routing schemes [5]- [7], [20], [21] in Delay Tolerant Networks (DTNs) [22]. However, all of them focus on individual packet routing rather than routing and control for streams of packets as for our OBSEA.…”

“…We do not assume any special distribution for ICT x,y , x, y ∈ R (e.g. power-law [41], exponential [21], or power-law head and exponential tail [42]). In addition, we generalize the concept of inter-contact time from each pair of pure mobile relays in R to that of all nodes in N .…”

An Overlapping Communities Detection Algorithm via Maxing Modularity in Opportunistic Networks

“…Community detection can help us to uncover and understand local community structure in both offline mobile trace analysis and online applications, and it is helpful in decreasing forwarding time as well as the storage capacity of nodes. Since the relationships between nodes usually seem to be stable and less volatile than node mobility, forwarding schemes based on community [2][3][4][5][6]outperform traditional approaches [7,8]. Overlapping community detection, one of the most interesting research of community detection, is the primary focus of this paper.…”

Delay Analysis of Social Group Multicast-Aided Content Dissemination in Cellular System

“…There are substantial contributions to the performance 32 analysis of epidemic forwarding [2] in mobile ad hoc networks 33 (MANETs). In the context of MANETs, a two-dimensional 34 continuous time Markov chain (CTMC) was proposed in [3] for 35 evaluating the performance of a heterogeneous MANETs. To a 36 further advance, the authors of [4] derived a tight upper bound 37 of the flooding time, which is defined as the number of time- 38 steps required for broadcasting a message from a source node to all nodes.…”

“…When we compute the exact result of E[T D |q = 0.5], which is 638 represented by the first line of (34), and its lower bound, which 639 is quantified by the second line of (34), then for a large social 640 group size N , such as N = 50∼200, using a set of other related 641 parameters in line with those of Fig. 6, the root-mean-square-642 deviation (RMSD) of these two sets of results can be shown 643 to be 0.094 TS.…”