A Purpose-Driven User Mobility Model for Opportunistic Networks

2010 ◽  
Vol 171-172 ◽  
pp. 804-809
Author(s):  
Jian Bo Xu ◽  
Guang Yang
Keyword(s):  
Human Movement ◽  
Mobility Model ◽  
Opportunistic Networks ◽  
User Mobility ◽  
Node Mobility ◽  
Opportunistic Network ◽  
Data Forwarding ◽  
Challenging Tasks ◽  
Efficient Data ◽  
Two Sides

An opportunistic Network is a network consisting exclusively of users’ mobile devices, with mobility being one of its essential features. Under the circumstances that a path may never exist between the two sides of communication, an opportunistic network exploits node mobility to realize delayed data delivery by capturing the opportunities of node meeting to relay messages. Designing efficient data forwarding strategies is one of the most challenging tasks in opportunistic network research, while currently the validation of any protocol for data forwarding almost absolutely relies on simulations of which node mobility models are one of the fundamental components. In this paper, we suggest a purpose-driven user mobility model for opportunistic networks which, to our best knowledge, is the first work considering the factor of purposes behind users’ movement. On the basis of location functionalization, our model can gain a better approximation of human movement patterns.

Survey on Node Mobility Model for Opportunistic Network

2011 ◽  
Vol 52-54 ◽  
pp. 1253-1257 ◽  
Author(s):  
Ming Xia Yang ◽  
Shuang Xia Han ◽  
Cai Yun Yang ◽  
Lu Zhang ◽  
Dong Fen Ye
Keyword(s):  
Wireless Sensor Networks ◽  
Ad Hoc ◽  
Mobility Model ◽  
Opportunistic Networks ◽  
Wireless Sensor ◽  
Node Mobility ◽  
Mobility Models ◽  
Opportunistic Network ◽  
Research Focus ◽  
Mobile Ad Hoc

Opportunistic networks is one of the newest hot research spots in wireless networks after mobile ad hoc net-works(MANET) and wireless sensor networks(WSN). Mobility model describes mobility manners of nodes. It has been widely used in research on wireless network. This paper firstly introduced, classifies, and compares the current familiar mobility models. Secondly, it classifies, and compares the current familiar mobility models. Next, it was discussed that current research focus on new mobility models, analysis of nodes mobility features, trace strategy, and evaluation of mobility model. Finally, this paper involved what calls for further study.

Mobile Sink with Mobile Agents

2020 ◽  
pp. 1035-1047
Author(s):  
Rachana Borawake-Satao ◽  
Rajesh Shardanand Prasad
Keyword(s):  
Sensor Network ◽  
Future Internet ◽  
Mobile Sink ◽  
Mobility Model ◽  
Wireless Sensor ◽  
Node Mobility ◽  
Key Factor ◽  
Potential Applications ◽  
Efficient Data ◽  
Efficient Data Collection

Wireless Sensor Networks (WSN) has been drawing considerable attention and discussion in recent years due to its potential applications in various fields. In modern applications for future internet the MSN (Mobile Sensor Network) is a key factor. Mobility allows the applications of Wireless Sensor Network to be compatible with IoT (Internet of Things) applications. As mobility enhances capability of the network it also affects the performance of the network at each layer. In recent years the various methodologies are proposed to handle mobility. Most of them use mobility for efficient data collection in WSNs. The purpose of this paper is to study effects of mobility on various performance parameters of the network and to explore the effective techniques to handle mobility in network. This paper proposes Mobile Sink with Mobile Agent mobility model for WSN which will increase the lifetime of the network using sink and agent node mobility.

scholarly journals Routing Algorithm Based on Trajectory Prediction in Opportunistic Networks

Information ◽  
2019 ◽  
Vol 10 (2) ◽  
pp. 49 ◽  
Author(s):  
Peijun Zou ◽  
Ming Zhao ◽  
Jia Wu ◽  
Leilei Wang
Keyword(s):  
Network Topology ◽  
Dynamic Change ◽  
Routing Algorithm ◽  
Mobility Model ◽  
Opportunistic Networks ◽  
Link Quality ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Trajectory Prediction ◽  
Routing Performance

Due to the dynamic change of the opportunistic network topology and the lack of stable information transmission paths between nodes, the traditional topology-based routing algorithm cannot achieve the desired routing performance. To address of this problem, this paper proposes a routing algorithm based on trajectory prediction (RATP). The routing protocol based on trajectory prediction can efficiently and quickly adapt to the network link quality instability and the dynamic changes of network topology. RATP algorithm constructs a node mobility model by analyzing the historical mobility characteristics of the nodes. According to the node prediction information, the metric value of the candidate node is calculated, and the node with the smaller metric value is selected as the data forwarding node, which can effectively reduce the packet loss rate and avoids excessive consumption. Simulation results show that compared with other algorithms, the proposed algorithm has higher data delivery ratio, and end-to-end data delay and routing overhead are significantly reduced.

Mobile Sink with Mobile Agents

2017 ◽  
Vol 4 (2) ◽  
pp. 24-35 ◽  
Author(s):  
Rachana Borawake-Satao ◽  
Rajesh Shardanand Prasad
Keyword(s):  
Sensor Network ◽  
Mobile Agents ◽  
Future Internet ◽  
Mobile Sink ◽  
Mobility Model ◽  
Wireless Sensor ◽  
Node Mobility ◽  
Key Factor ◽  
Potential Applications ◽  
Efficient Data

Wireless Sensor Networks (WSN) has been drawing considerable attention and discussion in recent years due to its potential applications in various fields. In modern applications for future internet the MSN (Mobile Sensor Network) is a key factor. Mobility allows the applications of Wireless Sensor Network to be compatible with IoT (Internet of Things) applications. As mobility enhances capability of the network it also affects the performance of the network at each layer. In recent years the various methodologies are proposed to handle mobility. Most of them use mobility for efficient data collection in WSNs. The purpose of this paper is to study effects of mobility on various performance parameters of the network and to explore the effective techniques to handle mobility in network. This paper proposes Mobile Sink with Mobile Agent mobility model for WSN which will increase the lifetime of the network using sink and agent node mobility.

Mobile Sink with Mobile Agents

2020 ◽  
pp. 1764-1777
Author(s):  
Rachana Borawake-Satao ◽  
Rajesh Shardanand Prasad
Keyword(s):  
Sensor Network ◽  
Future Internet ◽  
Mobile Sink ◽  
Mobility Model ◽  
Wireless Sensor ◽  
Node Mobility ◽  
Key Factor ◽  
Potential Applications ◽  
Efficient Data ◽  
Efficient Data Collection

Wireless Sensor Networks (WSN) has been drawing considerable attention and discussion in recent years due to its potential applications in various fields. In modern applications for future internet the MSN (Mobile Sensor Network) is a key factor. Mobility allows the applications of Wireless Sensor Network to be compatible with IoT (Internet of Things) applications. As mobility enhances capability of the network it also affects the performance of the network at each layer. In recent years the various methodologies are proposed to handle mobility. Most of them use mobility for efficient data collection in WSNs. The purpose of this paper is to study effects of mobility on various performance parameters of the network and to explore the effective techniques to handle mobility in network. This paper proposes Mobile Sink with Mobile Agent mobility model for WSN which will increase the lifetime of the network using sink and agent node mobility.

scholarly journals Study on similarity indices for link prediction in opportunistic networks

2018 ◽  
Vol 10 (10) ◽  
pp. 168781401880319
Author(s):  
Xulin Cai ◽  
Jian Shu ◽  
Linlan Liu
Keyword(s):  
Social Network ◽  
Link Prediction ◽  
Opportunistic Networks ◽  
Network Evolution ◽  
Experimental Results ◽  
Superior Performance ◽  
Node Mobility ◽  
Opportunistic Network ◽  
Similarity Indices ◽  
Intermittent Contact

Link prediction aims to estimate the existence of links between nodes, using information of network structures and node properties. According to the characteristics of node mobility, node intermittent contact, and high delay of opportunistic network, novel similarity indices are constructed based on CN, AA, and RA. The indices CN, AA, and RA do not consider the historic information of networks. Similarity indices, T_CN, T_AA, and T_RA, based on temporal characteristics are proposed. These take the historic information of network evolution into consideration. Using historic information of the evolution of opportunistic networks and 2-hop neighbor information of the nodes, similarity indices based on the temporal-spatial characteristics, O_CN, O_AA, and O_RA, are proposed. Based on the imote traces cambridge (ITC) and detected social network (DSN) datasets, the experimental results indicate that similarity indices O_CN, O_AA, and O_RA outperform CN, AA, and RA. Furthermore, index O_AA has superior performance.

scholarly journals Bonding Based Technique for message forwarding in Social Opportunistic Network

2019 ◽  
Vol 20 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Ritu Nigam ◽  
Deepak Kumar Sharma ◽  
Satbir Jain ◽  
Sarthak Gupta ◽  
Shilpa Ghosh
Keyword(s):  
Shortest Path ◽  
Mobility Model ◽  
Opportunistic Networks ◽  
Opportunistic Network ◽  
Contact Information ◽  
Indirect Bonding ◽  
Average Latency ◽  
Shortest Path Map ◽  
And Performance ◽  
One Simulator

Integrating social networks properties such as centrality, tie strength, etc into message forwarding protocols in opportunistic networks has grown into a vital major benchmark. The opportunistic network is a demanding network with no set route to travel a message from the source to be able to the destination. During these networks, nodes use possibilities gained based on store-carry-forward patterns to forward communications. Every node that obtains a message when it activities another node makes selection concerning the forwarding or not necessarily delivering the node came across. Most of these message forwarding protocols use the benefit of social properties information like contact information and social relationship enclosed by the nodes in the social opportunistic network. In this paper, a Bonding based forwarding technique is proposed which is finding direct and indirect bonding among nodes by exploiting contact information and social pattern. In the proposed protocol, we also focus on indirect bonding by finding weakest direct bonded nodes and then replace it with strong indirect bonded nodes of the network. In this work, the balance between transmission delay and network traffic is considered by using shortest path map based mobility model. ONE simulator is used for simulation and performance of the proposed protocol is compared contrary popular approaches for instance Epidemic, PRoPHET, and BubbleRap, and Interaction based when using the shortest path map based mobility model. The Bonding based forwarding technique performs adequately well concerning the number of messages delivered, overhead ratio, message dropping and average latency.

scholarly journals Opportunistic Network Algorithms for Internet Traffic Offloading in Music Festival Scenarios

Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3315
Author(s):  
Aida-Ștefania Manole ◽  
Radu-Ioan Ciobanu ◽  
Ciprian Dobre ◽  
Raluca Purnichescu-Purtan
Keyword(s):  
High Performance ◽  
Geographical Area ◽  
Mobility Model ◽  
Routing Algorithms ◽  
Message Delivery ◽  
Opportunistic Network ◽  
Key Factors ◽  
Network Algorithms ◽  
Music Festival ◽  
Social Metrics

Constant Internet connectivity has become a necessity in our lives. Hence, music festival organizers allocate part of their budget for temporary Wi-Fi equipment in order to sustain the high network traffic generated in such a small geographical area, but this naturally leads to high costs that need to be decreased. Thus, in this paper, we propose a solution that can help offload some of that traffic to an opportunistic network created with the attendees’ smartphones, therefore minimizing the costs of the temporary network infrastructure. Using a music festival-based mobility model that we propose and analyze, we introduce two routing algorithms which can enable end-to-end message delivery between participants. The key factors for high performance are social metrics and limiting the number of message copies at any given time. We show that the proposed solutions are able to offer high delivery rates and low delivery delays for various scenarios at a music festival.

scholarly journals A Novel Theoretical Probabilistic Model for Opportunistic Routing with Applications in Energy Consumption for WSNs

Sensors ◽  
2021 ◽  
Vol 21 (23) ◽  
pp. 8058
Author(s):  
Christian E. Galarza ◽  
Jonathan M. Palma ◽  
Cecilia F. Morais ◽  
Jaime Utria ◽  
Leonardo P. Carvalho ◽  
...  
Keyword(s):  
Monte Carlo ◽  
Energy Consumption ◽  
Stochastic Model ◽  
Opportunistic Networks ◽  
Opportunistic Routing ◽  
Opportunistic Network ◽  
Expected Number ◽  
Successful Transmission ◽  
Network Parameters ◽  
Proposed Model

This paper proposes a new theoretical stochastic model based on an abstraction of the opportunistic model for opportunistic networks. The model is capable of systematically computing the network parameters, such as the number of possible routes, the probability of successful transmission, the expected number of broadcast transmissions, and the expected number of receptions. The usual theoretical stochastic model explored in the methodologies available in the literature is based on Markov chains, and the main novelty of this paper is the employment of a percolation stochastic model, whose main benefit is to obtain the network parameters directly. Additionally, the proposed approach is capable to deal with values of probability specified by bounded intervals or by a density function. The model is validated via Monte Carlo simulations, and a computational toolbox (R-packet) is provided to make the reproduction of the results presented in the paper easier. The technique is illustrated through a numerical example where the proposed model is applied to compute the energy consumption when transmitting a packet via an opportunistic network.

Sign in / Sign up

Export Citation Format

Share Document