scholarly journals Changing Trends in Modeling Mobility

2012 ◽  
Vol 2012 ◽  
pp. 1-16 ◽  
Author(s):  
Aarti Munjal ◽  
Tracy Camp ◽  
Nils Aschenbruck
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Human Mobility ◽  
Movement Patterns ◽  
Mobility Model ◽  
Opportunistic Networks ◽  
Mobility Patterns ◽  
Mobile Nodes ◽  
Changing Trends ◽  
Research Problems

A phenomenal increase in the number of wireless devices has led to the evolution of several interesting and challenging research problems in opportunistic networks. For example, the random waypoint mobility model, an early, popular effort to model mobility, involves generatingrandommovement patterns. Previous research efforts, however, validate that movement patterns are not random; instead, human mobility is predictable to some extent. Since the performance of a routing protocol in an opportunistic network is greatly improved if the movement patterns of mobile users can be somewhat predicted in advance, several research attempts have been made to understand human mobility. The solutions developed use our understanding of movement patterns to predict the future contact probability for mobile nodes. In this work, we summarize the changing trends in modeling human mobility asrandommovements to the current research efforts that model human walks in a more predictable manner. Mobility patterns significantly affect the performance of a routing protocol. Thus, the changing trend in modeling mobility has led to several changes in developing routing protocols for opportunistic networks. For example, the simplest opportunistic routing protocol forwards a received packet to a randomly selected neighbor. With predictable mobility, however, routing protocols can use the expected contact information between a pair of mobile nodes in making forwarding decisions. In this work, we also describe the previous and current research efforts in developing routing protocols for opportunistic networks.

scholarly journals A novel geo-hierarchical population mobility model for spatial spreading of resurgent epidemics

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Alexandru Topîrceanu ◽  
Radu-Emil Precup
Keyword(s):  
Computational Models ◽  
Human Mobility ◽  
Discrete Event ◽  
Mobility Model ◽  
Hierarchical Organization ◽  
Population Mobility ◽  
Mobility Patterns ◽  
Fine Grained ◽  
Epidemic Size ◽  
Control Of Epidemics

AbstractComputational models for large, resurgent epidemics are recognized as a crucial tool for predicting the spread of infectious diseases. It is widely agreed, that such models can be augmented with realistic multiscale population models and by incorporating human mobility patterns. Nevertheless, a large proportion of recent studies, aimed at better understanding global epidemics, like influenza, measles, H1N1, SARS, and COVID-19, underestimate the role of heterogeneous mixing in populations, characterized by strong social structures and geography. Motivated by the reduced tractability of studies employing homogeneous mixing, which make conclusions hard to deduce, we propose a new, very fine-grained model incorporating the spatial distribution of population into geographical settlements, with a hierarchical organization down to the level of households (inside which we assume homogeneous mixing). In addition, population is organized heterogeneously outside households, and we model the movement of individuals using travel distance and frequency parameters for inter- and intra-settlement movement. Discrete event simulation, employing an adapted SIR model with relapse, reproduces important qualitative characteristics of real epidemics, like high variation in size and temporal heterogeneity (e.g., waves), that are challenging to reproduce and to quantify with existing measures. Our results pinpoint an important aspect, that epidemic size is more sensitive to the increase in distance of travel, rather that the frequency of travel. Finally, we discuss implications for the control of epidemics by integrating human mobility restrictions, as well as progressive vaccination of individuals.

The Robustness of RM-DSR Multipath Routing Protocol with Different Network Size in MANET

2013 ◽  
Vol 5 (2) ◽  
pp. 46-57
Author(s):  
Naseer Ali Husieen ◽  
Suhaidi Hassan ◽  
Osman Ghazali ◽  
Lelyzar Siregar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobility Model ◽  
Network Size ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Route Maintenance ◽  
Dynamic Source

This paper evaluates the performance of Reliable Multipath Dynamic Source Routing Protocol (RM-DSR) protocol with different network size compared to DSR protocol. RM-DSR developed in the mobile ad-hoc network to recover from the transient failure quickly and divert the data packets into a new route before the link is disconnected. The performance of RM-DSR protocol is tested in the Network Simulator (NS-2.34) under the random way point mobility model with varying number of mobile nodes. The network size parameter is used to investigate the robustness and the efficiency of RM-DSR protocol compared to DSR protocol. The network size affects the time of the route discovery process during the route establishment and the route maintenance process which could influence the overall performance of the routing protocol. The simulation results indicate that RM-DSR outperforms DSR in terms of the packet delivery ratio, routing overhead, end-to-end delay, normalized routing load and packet drop.

A Real-Life Mobility Patterns Based Routing Protocol in Delay Tolerant Mobile Sensor Network

2012 ◽  
Vol 490-495 ◽  
pp. 1411-1415
Author(s):  
Xiao Min Wang ◽  
Lei Wu ◽  
Ling Fei Yu
Keyword(s):  
Sensor Network ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Real Life ◽  
Delivery Ratio ◽  
Mobile Sensor ◽  
Mobility Patterns ◽  
Mobile Sensor Network ◽  
Delay Tolerant ◽  
Transmission Overhead

Most existing routing protocols for delay tolerant mobile sensor network(DTMSN) based on simplistic random mobility models. However, the real-life mobility pattern is complicated. We propose a real-life mobility patterns based routing protocol in DTMSN, The simulation results show that RMPR achieves higher delivery ratio and lower delay and transmission overhead

scholarly journals Impact of Node Density on the QoS Parameters of Routing Protocols in Opportunistic Networks for Smart Spaces

2020 ◽  
Vol 2020 ◽  
pp. 1-18
Author(s):  
Puneet Garg ◽  
Ashutosh Dixit ◽  
Preeti Sethi ◽  
Plácido Rogerio Pinheiro
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Smart Cities ◽  
Opportunistic Networks ◽  
Opportunistic Routing ◽  
Maximum Output ◽  
Opportunistic Network ◽  
Smart Spaces ◽  
Node Density ◽  
Wide Range

The need and importance of Smart Spaces have been potentially realized by the researchers due to its applicability in the current lifestyle. Opportunistic network, a successor of mobile ad hoc networks and a budding technology of network, is a best-suited technology for implementing Smart Spaces due to its wide range of applications in real-life scenarios ranging from building smart cities to interplanetary communication. There are numerous routing protocols which are available in opportunistic network, each having their pros and cons; however, no research till the time of listing has been done which can quantitatively demonstrate the maximum performance of these protocols and standardize the comparison of opportunistic routing protocols which has been a major cause of ambiguous performance evaluation studies. The work here presents a categorical view of the opportunistic routing protocol family and thereby compares and contrasts the various simulators suited for their simulation. Thereafter, the most popular protocols (selecting at least one protocol from each category) are compared based on node density on as many as 8 standard performance metrics using ONE simulator to observe their scalability, realism, and comparability. The work concludes by presenting the merits and demerits of each of the protocols discussed as well as specifying the best routing protocol among all the available protocols for Smart Spaces with maximum output. It is believed that the results achieved by the implemented methodology will help future researchers to choose appropriate routing protocol to delve into their research under different scenarios.

scholarly journals Energy-Efficient Check-and-Spray Geocast Routing Protocol for Opportunistic Networks

Information ◽  
2020 ◽  
Vol 11 (11) ◽  
pp. 504
Author(s):  
Khuram Khalid ◽  
Isaac Woungang ◽  
Sanjay Kumar Dhurandher ◽  
Jagdeep Singh ◽  
Joel J. P. C. Rodrigues
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Network Performance ◽  
Opportunistic Networks ◽  
Packet Transmission ◽  
Superior Performance ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Hop Count

Opportunistic networks (OppNets) are a type of challenged network where there is no guaranteed of end-to-path between the nodes for data delivery because of intermittent connectivity, node mobility and frequent topology changes. In such an environment, the routing of data is a challenge since the battery power of the mobile nodes drains out quickly because of multi-routing activities such as scanning, transmitting, receiving, and computational processing, effecting the overall network performance. In this paper, a novel routing protocol for OppNets called Energy-Efficient Check-and-Spray Geocast Routing (EECSG) is proposed, which introduces an effective way of message distribution in the geocasting region to all residing nodes while saving the energy consumption by restricting the unnecessary packet transmission in that region. A Check-and-Spray technique is also introduced to eliminate the overhead of packets in the geocast region. The proposed EECSG is evaluated by simulations and compared against the Efficient and Flexible Geocasting for Opportunistic Networks (GSAF) and the Centrality- Based Geocasting for Opportunistic networks (CGOPP) routing protocols in terms of average latency, delivery ratio, number of messages forwarded, number of dead nodes, overhead ratio, and hop count, showing superior performance.

scholarly journals An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks

2018 ◽  
Vol 8 (11) ◽  
pp. 2215 ◽  
Author(s):  
Eun Lee ◽  
Dong Seo ◽  
Yun Chung
Keyword(s):  
Routing Protocol ◽  
Opportunistic Networks ◽  
Opportunistic Routing ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Final Destination ◽  
History Of

In opportunistic networks such as delay tolerant network, a message is delivered to a final destination node using the opportunistic routing protocol since there is no guaranteed routing path from a sending node to a receiving node and most of the connections between nodes are temporary. In opportunistic routing, a message is delivered using a ‘store-carry-forward’ strategy, where a message is stored in the buffer of a node, a node carries the message while moving, and the message is forwarded to another node when a contact occurs. In this paper, we propose an efficient opportunistic routing protocol using the history of delivery predictability of mobile nodes. In the proposed routing protocol, if a node receives a message from another node, the value of the delivery predictability of the receiving node to the destination node for the message is managed, which is defined as the previous delivery predictability. Then, when two nodes contact, a message is forwarded only if the delivery predictability of the other node is higher than both the delivery predictability and previous delivery predictability of the sending node. Performance analysis results show that the proposed protocol performs best, in terms of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

scholarly journals GROUP MOBILITY MODEL BASED PROACTIVE AND REACTIVE ROUTING PROTOCOL IN MANET

2013 ◽  
pp. 190-195
Author(s):  
ANKUR PATEL ◽  
Shivendu Dubey ◽  
ASHOK VERMA ◽  
SHARDA PD. PATEL
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Dynamic Network ◽  
Mobility Model ◽  
Delivery Ratio ◽  
Mobility Patterns ◽  
Mobile Nodes ◽  
Group Mobility ◽  
Manet Routing

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes forming a dynamic network Topology without the aid of any existing network infrastructure or centralized administration. Each node participating in the network acts as a host and as a router , means they have to forward packets and identify route as well. Random way point is the most common mobility model in most of the simulation based studies of various MANET routing protocols.The Group Mobility Model has been generated by Impact of Mobility Patterns on Routing in Ad-hoc Network(IMPORTANT). In the present communication, we have analyzed the Packet Delivery Ratio (PDR), Average End to End delay, Average Throughput, Normalized Routing Load (NRL) and number of Drop packets in CBR and TCP traffic models using routing protocols namely AODV and DSDV. Research efforts have focused much in evaluating their performance with same number of nodes but divided in different number of groups. Simulations has been carried out using NS-2 simulator.

scholarly journals EVALUATION OF THE PERFORMANCE OF RE-AODV ROUTING PROTOCOL WITH DIFFERENT MOBILITY MODELS IN WIRELESS SENSOR NETWORKS

2021 ◽  
Vol 56 (5) ◽  
pp. 457-463
Author(s):  
Outazgui Saloua ◽  
Fakhri Youssef
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Mobility Model ◽  
Wireless Sensor ◽  
Handheld Devices ◽  
Mobility Models ◽  
Mobile Nodes ◽  
Network Efficiency ◽  
Aodv Routing Protocol

This paper aims to present a detailed study of different mobility models applicable for Wireless Sensor Networks (WSN). Wireless Sensor Networks (WSN) have evolved dramatically in mobile networks, providing the key advantage of offering access to information without considering a user's spatial and topological characteristics. Due to the exponential advancement of the Internet and the development of small handheld devices as a source of connectivity and data sharing, the wireless network has almost exploded over the past few years. As a routing protocol for WSN in different studies, the Ad-hoc On-demand Distance-vector routing protocol (AODV) has shown better performance than different routing protocols. It offers quick adaptation to dynamic link conditions, low processing, low memory overheads, and low network utilization. To develop an optimized routing protocol, in our previous work, we had proposed an enhancement of the AODV routing protocol to increase the performance of the classic AODV protocol by optimizing the energy consumption and automatically maximizing the network lifetime. In this paper, we present a detailed study of mobility models applicable for WSN. We describe various mobility models representing mobile nodes whose movements are independent (individual mobility models) and dependent (group mobility models). Furthermore, we will focus on studying the behavior of our optimized version of AODV that we named RE-AODV with different existing mobility models so that we can, in the end, select the best mobility model. In terms of network efficiency, simulation results in this Work demonstrate that the type of mobility model used makes the difference and influences the behavior of nodes.

Sign in / Sign up

Export Citation Format

Share Document