scholarly journals A Data Dissemination Method Based on Region Type Correlations for Mobile Opportunistic Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-10
Author(s):  
Linfeng Liu ◽  
Daoliang Chen
Keyword(s):  
Data Dissemination ◽  
Opportunistic Networks ◽  
Delivery Ratio ◽  
Mobility Patterns ◽  
Relay Nodes ◽  
Data Packets ◽  
Mobile Opportunistic Networks ◽  
Communication Devices ◽  
Markov Decision ◽  
Markov Decision Model

In Mobile Opportunistic Networks (MONs), due to the node movements and the uncontrollable on/off switches of the carried communication devices, the contacts between nodes may be scarce and momentary, and thus a data packet should be transferred through some discrete hops. To avoid the costly flooding of data packets, the data packets are typically disseminated to some relay nodes selected by data holders. However, the mobility patterns of nodes will become different in different types of regions (such as residential regions, commercial regions, scenery regions, or industrial regions); i.e., the movement directions and movement ranges of nodes are frequently varied when the nodes move among various regions. At present, the issues regarding the region types and region type correlations have not been investigated for the data dissemination in existing works. To this end, we propose a Region Type based Data Dissemination Method (RTDDM) for MONs, which exploits the region type correlations and selects the proper relay nodes through a Markov decision model. To verify the performance of RTDDM, we give some theoretical analysis as well as an elaborated simulation study, the results of which show that RTDDM can improve the delivery ratio and reduce the delivery delay, especially in the applications with various region types.

scholarly journals A Novel Topological Multicast Routing Algorithm (ToMuRo)

2010 ◽  
Vol 8 (01) ◽  
Author(s):  
R Aquino Santos ◽  
L A Villaseñor González ◽  
V Rangel Licea ◽  
A González Potes ◽  
M A García Ruiz ◽  
...  
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Mobility Patterns ◽  
Relay Nodes ◽  
Packet Delivery ◽  
Multicast Routing Algorithm

This paper presents a performance analysis of an enhanced version of the Topological Multicast Routing Algorithm (ToMuRo) on mobile wireless ad‐hoc networks, which includes undecided border nodes. Employing undecided border nodes to forward multicast packets represents a significant enhancement because it optimizes the path discovery process by selecting undecided nodes that can function as multicast relay nodes. Flooding Mechanism and On‐Demand Multicast Routing Protocol (ODMRP) are simulated and compared with both the basic and enhanced versions of the Topological Multicast Routing algorithm. The scenario evaluated considers one multicast transmitter and one, two, and three multicast receivers with various mobility patterns and transmission ranges. The behavior of 250 nodes is evaluated in terms of End to End Delay (EED), jitter, packet delivery ratio, and overhead. Results reveal that the enhanced version of ToMuRo performs better in terms of packet delivery ratio and jitter, while ODMRP performs better with respect to EED and Overhead.

Efficient interest‐aware data dissemination in mobile opportunistic networks

2019 ◽  
Author(s):  
Sui Yu ◽  
Lichen Zhang ◽  
Peng Li ◽  
Lixia Li ◽  
Bin Yan ◽  
...  
Keyword(s):  
Data Dissemination ◽  
Opportunistic Networks ◽  
Mobile Opportunistic Networks

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 NPLP: An Improved Routing-Forwarding Strategy Utilizing Node Profile and Location Prediction for Opportunistic Networks

Information ◽  
2019 ◽  
Vol 10 (10) ◽  
pp. 306
Author(s):  
Bangyuan Chen ◽  
Lingna Chen
Keyword(s):  
Urban Areas ◽  
Data Dissemination ◽  
Opportunistic Networks ◽  
Mobile Node ◽  
Network Routing ◽  
Delivery Ratio ◽  
Location Prediction ◽  
Node Location ◽  
Forwarding Strategy ◽  
Routing State

Opportunistic networks are considered as the promising network structures to implement traditional and typical infrastructure-based communication by enabling smart mobile devices in the networks to contact with each other within a fixed communication area. Because of the intermittent and unstable connections between sources and destinations, message routing and forwarding in opportunistic networks have become challenging and troublesome problems recently. In this paper, to improve the data dissemination environment, we propose an improved routing-forwarding strategy utilizing node profile and location prediction for opportunistic networks, which mainly includes three continuous phases: the collecting and updating of routing state information, community detection and optimization and node location prediction. Each mobile node in the networks is able to establish a network routing matrix after the entire process of information collecting and updating. Due to the concentrated population in urban areas and relatively few people in remote areas, the distribution of location prediction roughly presents a type of symmetry in opportunistic networks. Afterwards, the community optimization and location prediction mechanisms could be regarded as an significant foundation for data dissemination in the networks. Ultimately, experimental results demonstrate that the proposed algorithm could slightly enhance the delivery ratio and substantially degrade the network overhead and end-to-end delay as compared with the other four routing strategies.

Friend-Based Prediction Routing Protocol in Socially-Aware Opportunistic Networks

2014 ◽  
Vol 519-520 ◽  
pp. 241-244
Author(s):  
Li Liu
Keyword(s):  
Mobile Devices ◽  
Routing Protocol ◽  
Social Relationship ◽  
Data Dissemination ◽  
Opportunistic Networks ◽  
Delivery Ratio ◽  
Average Latency ◽  
Simulation Results ◽  
Carry And Forward ◽  
Intermittently Connected

Mobile devices are popular used in peoples life. Generally, most of portable mobile devices are carried by people. Thus, the mobility of mobile devices is influenced heavily by peoples social relationship. Socially-aware Opportunistic Networks are used in intermittently connected networks by use of store-carry-and-forward fashion. It is mainly based on social relationship to design solutions for problem such as routing protocol or data dissemination. In this paper, we exploit social relationship about friendships information among people and use them to predict the contact opportunities. We present Friend-based Prediction routing protocol (FBP) and establish experiment based on ONE. The simulation results show that the efficiency of FBP outperforms Epidemic and PROPHET in higher delivery ratio, lower overhead and shorter average latency.

Sign in / Sign up

Export Citation Format

Share Document