Proactively Placing Static Relays With Social-Link Awareness in Mobile Social Networks
Xiaomei Zhang,Guohong Cao +1 more
Reads0
Chats0
TLDR
This paper formalizes the problem of static relay placement as an optimization problem, and proposes an efficient relay replacement algorithm which replaces the outdated relays with new relays to further improve the data forwarding performance of data forwarding in mobile social networks.Abstract:
Mobile social networks have been exploited for data forwarding due to its low cost and better robustness. Existing data forwarding strategies in mobile social networks rely on the pairwise contacts among mobile users. However, these pairwise contacts only provide limited forwarding capabilities and most data fail to be delivered before the expiration time. In this paper, we improve the performance of data forwarding by proactively placing low-cost static relays to increase the opportunistic contacts among the mobile nodes. Based on this idea, an important question is where to place the static relays in the network to best facilitate data forwarding among nodes. To answer this question, we first analyze four real-world datasets of mobile social networks, and identify that data forwarding only appears in a small group of social links. Then, we formalize the problem of static relay placement as an optimization problem, and propose a heuristic based solution to improve the data forwarding performance along these social links. Considering the fact that the social links may evolve over time, we also propose an efficient relay replacement algorithm which replaces the outdated relays with new relays to further improve the data forwarding performance. Evaluation results show that the proposed relay based solutions can significantly improve the performance of data forwarding in mobile social networks.read more
Citations
More filters
Journal ArticleDOI
Deep Reinforcement Learning for Social-Aware Edge Computing and Caching in Urban Informatics
TL;DR: This article develops a social-aware nobile edge computing and caching mechanism by exploiting the relation between vehicles and roadside units that maximize the dispatch utility in an urban environment with diverse vehicular social characteristics.
Journal ArticleDOI
Fast Containment of Infectious Diseases With E-Healthcare Mobile Social Internet of Things
TL;DR: An e-healthcare mobile social Internet of Things-based targeted vaccination scheme to fast contain the spread of the infectious disease and design an optimal vaccinated target selection algorithm to choose a minimum number of targets whose locations are differentially distributed is developed.
Journal ArticleDOI
Social-Aware Routing in Mobile Opportunistic Networks
TL;DR: An insightful review of social-aware routing in MONs through thorough investigations is presented to provide a comprehensive understanding and inspire more in-depth studies.
Journal ArticleDOI
Modeling Epidemic Routing: Capturing Frequently Visited Locations While Preserving Scalability
TL;DR: In this paper, the authors investigated the performance of epidemic routing in mobile social networks considering several communities which are frequently visited by nodes, and proposed a monolithic Stochastic Reward Net (SRN) to evaluate the delivery delay and the average number of transmissions under epidemic routing by considering skewed location visiting preferences.
Journal ArticleDOI
An effective communication and computation model based on a hybridgraph-deeplearning approach for SIoT
TL;DR: In this paper , the adaptive trust weight (ATW) model with relation-based feedback fusion analysis is proposed to estimate the fitness-priority of every node based on directed graph theory to detect malicious nodes and reduce computation and communication overhead.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
The Kolmogorov-Smirnov Test for Goodness of Fit
TL;DR: In this paper, the maximum difference between an empirical and a hypothetical cumulative distribution is calculated, and confidence limits for a cumulative distribution are described, showing that the test is superior to the chi-square test.
Epidemic routing for partially-connected ad hoc networks
TL;DR: This work introduces Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery and achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
Journal ArticleDOI
On the Kolmogorov-Smirnov Test for Normality with Mean and Variance Unknown
TL;DR: In this paper, the power of the Kolmogorov-smirnov test is investigated and a table for testing whether a set of observations is from a normal population when the mean and variance are not specified but must be estimated from the sample.
Related Papers (5)
Social-Aware Data Dissemination via Device-to-Device Communications: Fusing Social and Mobile Networks with Incentive Constraints
Yiming Zhao,Wei Song,Zhu Han +2 more