Recent progress in routing protocols of mobile opportunistic networks: A clear taxonomy, analysis and evaluation

Yuan, Peiyan; Fan, Lilin; Liu, Ping; Tang, Shaojie

doi:10.1016/j.jnca.2016.01.006

Cited by 43 publications

(18 citation statements)

References 61 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that none of these researchers considered the influence of the sociality of a node on the collaborative behavior (Many routing algorithms such as Bubble and Hotent [16] employ the social property of nodes; however, to the best of our knowledge, currently incentive works do not evaluate the influence of social importance on the incentive process. ), i.e., in each updating round, nodes select strategies randomly from their neighbors to use in the game.…”

Section: Related Workmentioning

confidence: 99%

FollowMe: One Social Importance-Based Collaborative Scheme in MONs

et al. 2019

Self Cite

View full text Add to dashboard Cite

The performance of mobile opportunistic networks mainly relies on collaboration among nodes. Thus far, researchers have ignored the influence of node sociality on the incentive process, leading to poor network performance. Considering the fact that followers always imitate the behavior of superstars, this paper proposes FollowMe, which integrates the social importance of nodes with evolutionary game theory to improve the collaborative behavior of nodes. First, we use the prisoner’s dilemma model to establish the matrix of game gains between nodes. Second, we introduce the signal reference as a game rule between nodes. The number of nodes choosing different strategies in a game round is used to calculate the cumulative income of the node in combination with the probability formula. Finally, the Fermi function is used to determine whether the node updates the strategy. The simulation results show that, compared with the random update rule, the proposed strategy is more capable of promoting cooperative behavior between nodes to improve the delivery rate of data packets.

show abstract

Section: Related Workmentioning

confidence: 99%

FollowMe: One Social Importance-Based Collaborative Scheme in MONs

et al. 2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…The core of routing protocols in MONs is how to select the next node to store and forward packets [12]. From the point of view of whether additional information is needed to assist routing forwarding, the current routing protocol can be divided into two categories: zero information and auxiliary information [18]. The zero information routing algorithm [17] [11] [20] [16] does not use any information to make forwarding decisions.…”

Section: Related Workmentioning

confidence: 99%

MONICA One Simulator for Mobile Opportunistic

Yuan¹,

Song²

2018

Proceedings of the 11th EAI International Conference on Mobile Multimedia Communications

Self Cite

View full text Add to dashboard Cite

Routing protocols are the focus in mobile opportunistic networks, and the simulation test is one of the effective ways to evaluate their performance. This paper presents a mobile opportunistic network simulator called MONICA. It provides a programmable interface to users, which is easy to learn and easy to use. It also integrates eight classic routing algorithms, six caching strategies and two types of mobility models, so that users can make a more comprehensive evaluation of the routing protocol. In addition, MONICA can trace abnormal behaviors with the network event function and observe the real simulation process by the visual module. All of these guarantee the efficiency of the simulator in evaluating the routing performance.

show abstract

“…Routing is one of the hot issues in MOSNs, and many routing algorithms have been proposed. [5][6][7][8][13][14][15] Technically, according to the number of single-message copies, the routing algorithms for MOSNs can be classified as single-copy-based and multiple-copy-based.…”

Section: Related Workmentioning

confidence: 99%

“…In this experiment, the value of nodes' buffer size in the network is set to 1,2,3,4,5,10,20,30,40,50,60,70,80,90, and 100 MB, respectively. Figures 13 and 14 illustrate the change of the delivery ratio within a scenario where 2 regions are included, and each region includes 100 and 200 nodes, respectively.…”

Section: The Impact Of Nodes' Buffer Size On Routing Algorithm Performentioning

confidence: 99%

A social‐aware probabilistic routing approach for mobile opportunistic social networks

Zhao

Wang

Zhang

et al. 2017

Trans Emerging Tel Tech

View full text Add to dashboard Cite

In mobile opportunistic social networks (MOSNs), mobile users move around and conduct message transmission by using their portable devices without the support of communication infrastructures, in which routing is a challenge due to high connection intermittency and node mobility. The current routing schemes for MOSNs only focus on the improvement of cost‐effective delivery by using the characteristics of users' interests or mobility. In this paper, we propose a novel routing approach for MOSNs in which the probabilistic and social‐aware strategies are combined and the multiple‐copy policy is adopted. We first model an MOSN into some overlapping regions and then propose 2 region‐related centrality degrees related to users' social characteristics with the consideration of users' centrality, mobility, and interactions among users. According to the definition of centrality degrees, we design a social‐aware probabilistic routing approach in which a message replica control policy is applied to allow a user with higher encounter probability to the destination and the user could obtain more message replicas. The simulation results show that the proposed approach outperforms the previous routing algorithms in terms of delivery ratio and overhead ratio.

show abstract

Recent progress in routing protocols of mobile opportunistic networks: A clear taxonomy, analysis and evaluation

Cited by 43 publications

References 61 publications

FollowMe: One Social Importance-Based Collaborative Scheme in MONs

FollowMe: One Social Importance-Based Collaborative Scheme in MONs

MONICA One Simulator for Mobile Opportunistic

A social‐aware probabilistic routing approach for mobile opportunistic social networks

Contact Info

Product

Resources

About