Information Propagation through Opportunistic Communication in Mobile Social Networks

Wu, Yongjia; Deng, Shuiguang; Huang, Hong

doi:10.1007/s11036-012-0401-3

Cited by 34 publications

(36 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The epidemic dynamic model has been widely used to analyze information propagation in social networks. For instance, some studies developed a model for rumor propagation in social networks [9], and some use epidemic dynamic routing in mobile social networks [10]. In this paper, we also assume information propagation in social networks in an epidemic dynamic way.…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, many studies have shown that individuals can form different communities based on social ties (similar interests, occupation, age, etc.) [10]. Individuals are densely connected in the same community and are sparsely connected in different communities.…”

Section: Introductionmentioning

confidence: 99%

“…However, most studies on overlapping communities focus on epidemic difusion and only consider the topology of the network and do not study information transmitting in social networks based on individual social behaviors. Many studies have shown that users exhibit selfish behavior [10,25]. In particular, selfish behaviors can be divided into two classes, individual selfishness and social selfishness.…”

Section: Introductionmentioning

confidence: 99%

“…In particular, selfish behaviors can be divided into two classes, individual selfishness and social selfishness. Individual selfishness means that users may not be willing to forward information to other users when they receive information, while social selfishness means users are more willing to forward information to users in the same community than users in different communities [10]. Research [25] explored the impact of selfish behaviors on epidemic routing in mobile social networks with overlapping communities.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Information Propagation in Social Networks with Overlapping Community Structure

Zhao¹,

Liu²

2017

KSII TIIS

View full text Add to dashboard Cite

Many real networks exhibit overlapping community structures. Recent studies have been performed that analyze the impact of overlapping community structure on information propagation, but few of them concerned with individual behaviors. From this point of view, we propose a Markov process model to evaluate the performance of information propagation in social networks with overlapping community structures. In addition, many individual social behaviors are combined in the model. For example, individuals may exhibit selfish behaviors, such as individual and social selfishness, and people may discard the information after they have used it. The accuracy of the model is verified by simulation. Furthermore, the numerical results show that both overlapping community structure of the network and individual behaviors have a significant impact on the outbreak size and propagation speed of the information. Additionally, the overlapping community structure of the social network can reduce the impact of selfishness on information propagation.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Information Propagation in Social Networks with Overlapping Community Structure

Zhao¹,

Liu²

2017

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…At present, the concept of delay-tolerant networks (DTNs) is proposed to support those wireless applications [1]. In particular, DTNs have been used in many cases such as deep space exploration [2], mobile social networks [3], and communication in disaster environment [4]. Routing algorithms in traditional ad hoc networks, which rely on the end-to-end path, cannot work in DTNs efficiently.…”

Section: Introductionmentioning

confidence: 99%

Optimal Beaconing Control in Delay-Tolerant Networks With Multiple Destinations

Deng

Huang

2015

IEEE Systems Journal

Self Cite

View full text Add to dashboard Cite

The opportunistic contacts between nodes have important impact on the routing process in delay-tolerant networks, and they are related to the beaconing rate. In this paper, we study the optimal beaconing rates for the relay nodes and destinations at the same time. First, a theoretical framework, which can be used to evaluate the performance under different beaconing policies, is presented. Then based on the framework, we formulate an optimization problem. Through Pontryagin's maximum principle, we obtain the optimal beaconing policies for the relay nodes and destinations, respectively. In addition, we prove that both optimal policies conform to the threshold form. The optimal policy of the relay nodes changes its value from the maximal beaconing rate to the minimal one, but it is opposite for the destinations. The simulations show the accuracy of our theoretical model. Extensive numerical results show that the optimal policies are really better.

show abstract

Optimal incentive policy in delay tolerant networks with limited cost

Deng

Huang

2013

Security Comm. Networks

Self Cite

View full text Add to dashboard Cite

Routing algorithms in delay tolerant networks often need nodes serving as relays for the source to carry and forward message. In particular, nodes should relay the source's packets to others. However, because of the selfish nature, nodes may not relay others' packets to save energy after obtaining message. To make these nodes be cooperative, the source has to pay certain fees to them. Moreover, such fees may be varying with time. On the other hand, if the payment is too much, it may not be cost-effective for the source. Therefore, the total cost may be limited. The main objective of this paper is to explore efficient incentive policies for the source to use its limited cost (maximal fees that the source can afford is limited) to maximize the probability that the destination obtains the message before the deadline of the message. First, we present a theoretical framework, which can be used to evaluate the performance of different incentive policies. Then, we explore the optimal incentive policy through Pontryagin's maximal principle and prove that the optimal policy conforms to threshold form in certain cases. Simulation results show the accuracy of our theoretical framework. Extensive numerical results show that the optimal policy obtained in this paper is better than other policies.

show abstract

Information Propagation through Opportunistic Communication in Mobile Social Networks

Cited by 34 publications

References 36 publications

Information Propagation in Social Networks with Overlapping Community Structure

Information Propagation in Social Networks with Overlapping Community Structure

Optimal Beaconing Control in Delay-Tolerant Networks With Multiple Destinations

Optimal incentive policy in delay tolerant networks with limited cost

Contact Info

Product

Resources

About