Selfishness, Altruism and Message Spreading in Mobile Social Networks

Hui, Pan; Xu, Kuang; Li, Victor O. K.; Crowcroft, Jon; Latora, Vito; Lió, Píetro

doi:10.1109/infcomw.2009.5072186

Cited by 81 publications

(56 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The success of k-copy flooding suggests a possible explanation for this result. Similarly, [28] finds that the delivery ratio achieved by a given time is largely independent of the propensity of nodes to carry other people's data. They suggest the existence of multiple paths as an explanation.…”

Section: Related Workmentioning

confidence: 96%

Data Delivery Properties of Human Contact Networks

Sastry

Manjunath

Sollins

et al. 2011

IEEE Trans. on Mobile Comput.

Self Cite

View full text Add to dashboard Cite

Abstract-Pocket Switched Networks take advantage of social contacts to opportunistically create data paths over time. This work employs empirical traces to examine the effect of the human contact process on data delivery in such networks. The contact occurrence distribution is found to be highly uneven: contacts between a few node pairs occur too frequently, leading to inadequate mixing in the network, while the majority of contacts occur rarely, but are essential for global connectivity. This distribution of contacts leads to a significant variation in the fraction of node pairs that can be connected over time windows of similar duration. Good time windows tend to have a large clique of nodes that can all reach each other. It is shown that the clustering co-efficient of the contact graph over a time window is a good predictor of achievable connectivity. We then examine all successful paths found by flooding and show that though delivery times vary widely, randomly sampling a small number of paths between each source and destination is sufficient to yield a delivery time distribution close to that of flooding over all paths. This result suggests that the rate at which the network can deliver data is remarkably robust to path failures.Index Terms-Pocket Switched Networks, human mobility networks, flooding, statistical properties, path failure toleranceproposes to ferry data using human social contacts. At each contact opportunity, mobile devices carried by the humans exchange data using short-range protocols such as bluetooth or Wi-Fi. By chaining such contacts, the PSN opportunistically creates data paths that connect a source and destination over time. Intermediate nodes in the path store data on behalf of the sender and carry it to the next contact opportunity where it is forwarded further.Although this store-carry-forward network can incur long and highly variable delays, it has the advantage of not requiring infrastructure setup or maintenance. It is therefore useful when infrastructure is damaged (e.g. after disasters), or does not exist (e.g. in remote areas). Also, mobility increases network capacity at the expense of delays, providing multi-user diversity gains [2]. A PSN can be effective as a multi-hop "sneakernet" for high-bandwidth applications that can tolerate delays.A central question for the success of this approach is to understand how human contact occurrences shape data delivery. In this paper, we explore this issue using empirical traces of human contacts. Our simulations discover the quickest paths by flooding data at every contact opportunity. We then study the achievable performance of the contact network in terms of the fraction of data delivered (delivery ratio), as well as the time to delivery.The delivery ratio at the end of a time window is indicative of the fraction of node pairs connected during the window and is therefore a measure of the connectivity achieved by the network. The empirically observed cumulative distribution of delivery times can also be interpreted as the evolution ...

show abstract

Section: Related Workmentioning

confidence: 96%

Data Delivery Properties of Human Contact Networks

Sastry

Manjunath

Sollins

et al. 2011

IEEE Trans. on Mobile Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The success of k-copy flooding suggests a possible explanation for this result. Similarly, [21] finds that the delivery ratio achieved by a given time is largely independent of the propensity of nodes to carry other people's data. They suggest the existence of multiple paths as an explanation.…”

Section: Related Workmentioning

confidence: 96%

Path Formation in Human Contact Networks

Sastry

Hui

2011

Handbook of Optimization in Complex Networks

Self Cite

View full text Add to dashboard Cite

The Pocket Switched Network (PSN) is a radical proposal to take advantage of short-range connectivity afforded by human face-to-face contacts, and create longer paths by having intermediate nodes ferry data on behalf of the sender. The Pocket Switched Network creates paths over time using transient social contacts. This chapter explores the achievable connectivity properties of this dynamically changing mileu, and gives a community-based heuristic to find efficient routes.We first employ empirical traces to examine the effect of the human contact process on data delivery. Contacts between a few node pairs are found to occur too frequently, leading to inadequate mixing of data, while the majority of contacts occur rarely, but are essential for global connectivity. We then examine all successful paths found by flooding and show that though delivery times vary widely, randomly sampling a small number of paths between each source and destination is sufficient to yield a delivery time distribution close to that of flooding over all paths. Thus, despite the apparent fragility implied by the reliance on rare edges, the rate at which the network can deliver data is remarkably robust to path failures.We then give a natural heuristic that finds routes by exploiting the latent social structure. Previous methods relied on building and updating routing tables to cope with dynamic network conditions. This has been shown to be cost ineffective due to the partial capture of transient network behavior. A more promising approach would be to capture the intrinsic characteristics of such networks and utilize them for routing decsions. We design and evaluate BUBBLE, a novel social-based forwarding algorithm, that utilizes the centrality and community metrics to enhance delivery performance. We empirically show that BUBBLE can efficiently identify good paths using several real mobility datasets.

show abstract

“…However, nodes may not be willing to help others due to the constraint of buffer space or power resources [10]. This behavior can be seen as individual selfish [11]. Hui et al studied the its impact in mobile social network, and they found that mobile social network is robust to the individual selfish due to the multiple paths [11].…”

Section: Performance Analysis Of Epidemic Routing In Dtn With Overlapmentioning

confidence: 99%

“…This behavior can be seen as individual selfish [11]. Hui et al studied the its impact in mobile social network, and they found that mobile social network is robust to the individual selfish due to the multiple paths [11]. Then, it was studied further in [12].…”

Section: Performance Analysis Of Epidemic Routing In Dtn With Overlapmentioning

confidence: 99%

Performance Analysis of Epidemic Routing in Delay Tolerant Networks with Overlapping Communities and Selfish Nodes

Deng

Huang

et al. 2013

INT J COMPUT COMMUN

View full text Add to dashboard Cite

Routing algorithms in delay tolerant networks (DTN) adopt the storecarry-forward way, and this needs the nodes to work in a cooperative way. However, nodes may not be willing to help others in many applications and this behavior can be seen as individual selfish. On the other hand, nodes often can be divided into different communities, and nodes in the same community often have some social ties. Due to these social ties, nodes are more willing to help the one in the same community. This behavior can be seen as social selfish. Note that some nodes may belong to more than one community in the real world, and this phenomenon makes the network have overlapping communities. This paper proposed a theoretical model to describe the performance of epidemic routing (ER) in such network. Simulation results show the accuracy of our model. Numerical results show that the selfish nature can make the performance of the routing policy be worse, but those nodes belonging to multi-communities can decrease the impact of the selfish nature in certain degree.

show abstract

Selfishness, Altruism and Message Spreading in Mobile Social Networks

Cited by 81 publications

References 17 publications

Data Delivery Properties of Human Contact Networks

Data Delivery Properties of Human Contact Networks

Path Formation in Human Contact Networks

Performance Analysis of Epidemic Routing in Delay Tolerant Networks with Overlapping Communities and Selfish Nodes

Contact Info

Product

Resources

About