scholarly journals ODMBP: Behavior Forwarding for Multiple Property Destinations in Mobile Social Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Jia Xu ◽  
Jin Xin Xiang ◽  
Xiang Chen ◽  
Fang Bin Liu ◽  
Jing Jie Yu
Keyword(s):  
Social Networks ◽  
Routing Protocols ◽  
Delivery Ratio ◽  
Mobile Social Networks ◽  
Computing Model ◽  
Three Stages ◽  
Novel Applications ◽  
Behavior Profile ◽  
Behavior Profiles ◽  
Overhead Ratio

The smartphones are widely available in recent years. Wireless networks and personalized mobile devices are deeply integrated and embedded in our lives. The behavior based forwarding has become a new transmission paradigm for supporting many novel applications. However, the commodities, services, and individuals usually have multiple properties of their interests and behaviors. In this paper, we profile these multiple properties and propose an Opportunistic Dissemination Protocol based on Multiple Behavior Profile, ODMBP, in mobile social networks. We first map the interest space to the behavior space and extract the multiple behavior profiles from the behavior space. Then, we propose the correlation computing model based on the principle of BM25 to calculate the correlation metric of multiple behavior profiles. The correlation metric is used to forward the message to the users who are more similar to the target in our protocol. ODMBP consists of three stages: user initialization, gradient ascent, and group spread. Through extensive simulations, we demonstrate that the proposed multiple behavior profile and correlation computing model are correct and efficient. Compared to other classical routing protocols, ODMBP can significantly improve the performance in the aspect of delivery ratio, delay, and overhead ratio.

Social-aware data dissemination in opportunistic mobile social networks

2017 ◽  
Vol 28 (09) ◽  
pp. 1750115 ◽  
Author(s):  
Yibo Yang ◽  
Honglin Zhao ◽  
Jinlong Ma ◽  
Xiaowei Han
Keyword(s):  
Social Networks ◽  
Data Dissemination ◽  
Geographical Information ◽  
Communication Overhead ◽  
Delivery Ratio ◽  
Mobile Social Networks ◽  
Relay Nodes ◽  
Data Propagation ◽  
Contact Frequency ◽  
Opportunistic Mobile Social Networks

Opportunistic Mobile Social Networks (OMSNs), formed by mobile users with social relationships and characteristics, enhance spontaneous communication among users that opportunistically encounter each other. Such networks can be exploited to improve the performance of data forwarding. Discovering optimal relay nodes is one of the important issues for efficient data propagation in OMSNs. Although traditional centrality definitions to identify the nodes features in network, they cannot identify effectively the influential nodes for data dissemination in OMSNs. Existing protocols take advantage of spatial contact frequency and social characteristics to enhance transmission performance. However, existing protocols have not fully exploited the benefits of the relations and the effects between geographical information, social features and user interests. In this paper, we first evaluate these three characteristics of users and design a routing protocol called Geo-Social-Interest (GSI) protocol to select optimal relay nodes. We compare the performance of GSI using real INFOCOM06 data sets. The experiment results demonstrate that GSI overperforms the other protocols with highest data delivery ratio and low communication overhead.

scholarly journals Evaluation of Spray Based Routing Approaches in Delay Tolerant Networks

2014 ◽  
Vol 10 (4) ◽  
pp. 213 ◽  
Author(s):  
Sweta Jain ◽  
Meenu Chawla
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Delay Tolerant Networks ◽  
Delivery Ratio ◽  
Composite Methods ◽  
Average Latency ◽  
Delay Tolerant ◽  
Overhead Ratio ◽  
Spray And Wait

Delay Tolerant Networks (DTN) are mobile ad-hoc networks in which connections are often disruptive or discontinuous. Data forwarding using an appropriate routing strategy is a highly confronting issue in such networks. The traditional ad-hoc routing protocols which require end-to-end connectivity fail to function here due to frequent occurrences of network partitions. Spray and Wait (SaW) routing algorithm is a popular controlled replication based DTN protocol which provides a better delivery performance balancing the average delay and overhead ratio. An empirical analysis of various spray based approaches that have been proposed for DTN has been performed in this paper to compare and evaluate the basic Spray and Wait algorithms (Source Spray and Wait and Binary Sprayand Wait) with some of its major improvements (Spray andFocus, Average Delivery Probability Binary Spray and Wait and Composite methods to improve Spray and Wait). The main aim of this comparative study is to verify the effect of utility metrics in spray based routing protocols over simple spray based approaches. The ONE simulator has been used to provide a simulation environment to evaluate these algorithms and generate results. The performance metrics used are delivery ratio (DR), overhead ratio (OR) and average latency (ALat). The simulation results show that in terms of delivery ratio and average latency, Composite methods to improve Spray and Wait which incorporates delivery predictability metric in the wait phase and also acknowledgements to delete already deliveredmessages from a node’s buffer, outperforms all the other variants compared.

CTR: Carry Time-Based Routing for Increasing Delivery Ratio in Mobile Social Networks

2019 ◽  
Vol 110 (3) ◽  
pp. 1271-1282
Author(s):  
Simin Abdolhosseinzadeh ◽  
Nahideh Derakhshanfard
Keyword(s):  
Social Networks ◽  
Delivery Ratio ◽  
Mobile Social Networks

PERFORMANCE COMPARISON OF BASELINE ROUTING PROTOCOLS IN POCKET SWITCHED NETWORK

2016 ◽  
Vol 78 (8-2) ◽  
Author(s):  
Deni Yulianti ◽  
Satria Mandala ◽  
Anazida Zainal ◽  
Dewi Nasien ◽  
Md. Asri Ngadi ◽  
...  
Keyword(s):  
Routing Protocols ◽  
Performance Metrics ◽  
Performance Comparison ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Switched Network ◽  
Direct Delivery ◽  
Overhead Ratio ◽  
Spray And Wait

Pocket Switched Network (PSN) is a branch of Delay Tolerant Network (DTN) which is intended to work in a challenged network. Challenged network is network with lack of infrastructure such as disaster area. As such, the network has intermittent connectivity. PSN provides a new paradigm to distribute messages in the network by taking advantage of roaming nodes from one place to another. In this paper, network performances of eight PSN routing protocols are investigated namely, First Contact, Direct Delivery, Epidemic, PRotocol using History of Encounter and Transitivity (PRoPHET), Spray and Wait, Binary Spray and Wait, Fuzzy Spray, Adaptive Fuzzy Spray and Wait. The performance metrics are packet delivery ratio, overhead ratio and average latency. Opportunistic Network Environment (ONE) simulator is used to evaluate the network performance. Experiments show that Epidemic has the best performance in term of message delivery ratio, but it has the highest overhead ratio. Direct Delivery has the lowest overhead ratio (zero overhead ratio) and PRoPHET has the lowest latency average.

ANALYSIS OF EPIDEMIC, PROPHET AND SPRAY AND WAIT ROUTING PROTOCOLS IN THE MOBILE OPPORTUNISTIC NETWORKS

2019 ◽  
Vol 13 ◽  
Author(s):  
Jasvir Singh ◽  
Raman Maini
Keyword(s):  
Mobile Networks ◽  
Routing Protocols ◽  
Opportunistic Networks ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Message Size ◽  
Average Latency ◽  
Overhead Ratio ◽  
Spray And Wait

Background: The opportunistic mobile networks (OMNs) are a type of mobile adhoc networks (MANETs) with delay-tolerant network (DTN) features, where the sender to receiver connectivity never exists most of the time, due to dynamic nature of the nodes and the network partition. The real use of OMNs is to provide connectivity in challenged environments. Methods: The paper presents the detailed analysis of three routing protocols, namely Epidemic, PROPHET and Spray and Wait, against variable size of the messages and the time to live (TTL) in the networks. The key contribution of the paper is to explore routing protocols with mobility models for the dissemination of data to the destination. Routing uses the store-carryforward mechanism for message transfer and network has to keep compromise between message delivery ratio and delivery delay. Results: The results are generated from the experiments with Opportunistic Network Environment (ONE) simulator. The performance is evaluated based on three metrics, the delivery ratio, overhead ratio and the average latency. The results show that the minimum message size (256 KB) offers better performance in the delivery than the larger message size (1 MB). It has also been observed that with the epidemic routing, since there are more message replicas, which in turn increase the cost of delivery, so with a smaller message, the protocol can reduce the overhead ratio with a high proportion. Conclusion: The average latency observed increases with the increase of the TTL of the message in three protocols with variation of the message size from 256KB to 1 MB.

scholarly journals Activity-based routing algorithm in opportunistic mobile social networks

2021 ◽  
Vol 17 (9) ◽  
pp. 155014772110412
Author(s):  
Sheng Zhang ◽  
Houzhong Liu ◽  
Caisen Chen ◽  
Zhaojun Shi ◽  
William Wei Song
Keyword(s):  
Social Networks ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Source Node ◽  
Prediction Algorithm ◽  
Destination Node ◽  
Delivery Ratio ◽  
Mobile Social Networks ◽  
Delivery Probability ◽  
Opportunistic Mobile Social Networks

In opportunistic mobile social networks, nodes are clustered according to their interests or hobbies and take part in different activities regularly. We delve into the temporal and spatial mobility characteristics of network nodes and put forward an activity-based message opportunistic forwarding algorithm. The main idea of the algorithm is that we choose different message forwarding methods according to the situation of nodes participating in activities. If the source node and the destination node are both attend in the same activities, we select the best relay node which has the biggest delivery probability. While the source node and the destination node are not in the same activities at the same time, we need to find the optimal path which owns highest indirect delivery probability, and messages will be transmitted through the optimal path. The simulation results show that the proposed routing algorithm can not only improve the successful delivery ratio of messages but also reduce the network delay and the network overhead obviously, in comparison with the classical opportunistic routing algorithms, such as community-aware message opportunistic transmission algorithm, community-based message transmission scheme algorithm, PRoPHET, Epidemic algorithm, and interest characteristic probability prediction algorithm.

Sign in / Sign up

Export Citation Format

Share Document