scholarly journals An Improved SimBet Routing Algorithm for Human Mobility Based DTN

10.29007/c28h ◽  
2018 ◽  
Author(s):  
Mehul Shah ◽  
Nikhil Gondaliya ◽  
Avani Barad
Keyword(s):  
Past History ◽  
Human Mobility ◽  
Routing Algorithm ◽  
Mobility Model ◽  
Delay Tolerant Network ◽  
Pause Time ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Least Action ◽  
Routing Performance

Delay Tolerant Network (DTN) is useful for providing communication, where internet connection does not exist or in an Environment where long delay path and frequent partitions in transmission is present. A critical challenge for DTN is to determine the routing path through the network without ever having an end to end path, or finding which routers will be connected at any given instant of time. To find a routing path mobility of user needs attention, here we use human mobility model: Self Similar Least Action Walk (SLAW). In this paper, we extract pause time from past history of human mobility and utilize for routing in DTN. This concept will improve routing performance. In this paper, we propose the Multi-copy SimBet Routing with pause time factor. Finally, we conclude that the proposed routing method gives a message delivery ratio nearly equal to the Epidemic Routing, also reduce latency and overhead of the network.

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.

scholarly journals Location-assistant content distribution scheme for emergency rescue

2018 ◽  
Vol 14 (9) ◽  
pp. 155014771880046
Author(s):  
Guomin Zhang ◽  
Lihua Song ◽  
Haitao Wang ◽  
Chao Hu ◽  
Na Wang
Keyword(s):  
Content Distribution ◽  
Routing Algorithm ◽  
Mobility Model ◽  
Network Routing ◽  
Delay Tolerant Network ◽  
Message Delivery ◽  
Emergency Rescue ◽  
Course Of Action ◽  
Distribution Scheme ◽  
Delay Tolerant

In order to optimize the timeliness and pertinence of message delivery in emergency rescue scenarios and improve the service performance of emergency communications network, we propose a location-assistant content distribution scheme based on delay tolerant network. First of all, considering that the movement patterns of rescue teams tend to follow a predetermined course of action, we design a location-based group mobility model. Due to the intermittent network connectivity and variety of emergency service, a content-classification-based publish/subscribe architecture and a GenericSpray routing algorithm based on the prediction of overlap opportunity in spatio-temporal positions are proposed. Furthermore, we also give a cache management strategy based on the content significance. Since location-assistant content distribution scheme can predict the overlap of activity between rescue teams through the course of action, not only can the number of copy forwarding and message delivery delays be significantly reduced but also the priority delivery of important messages can be ensured by message classification. Simulation experiments show that compared with the traditional delay tolerant network routing algorithm and the classic first-in-first-out caching strategy, location-assistant content distribution scheme improves the performance of message delivery rate, transmission delay, and control overhead significantly.

PERFORMANCE EVALUATION OF ENHANCED MANHATTAN MOBILITY MODEL OVER GM, RWP, MANHATTAN GRID, SLAW, AND TLW MOBILITY MODELS IN MANETS

2021 ◽  
Vol 14 ◽  
Author(s):  
Satveer Kour ◽  
Jagpal Singh
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Performance Metrics ◽  
Vertical Direction ◽  
Realistic Model ◽  
Mobility Model ◽  
Delivery Ratio ◽  
Mobility Models ◽  
Least Action ◽  
Routing Performance

: The mobility model is the base of simulation experiments in the Mobile Ad-hoc Network. A composite model for mobility for city scenarios which includes a realistic model of obstacle avoidance and movement in the vertical direction, is proposed. The comparison of its performance with those of other available mobility models is encouraging. We believe that it can upgrade the routing performance. Here, we discuss the synthetic mobility models (Gauss-Markov, Random Waypoint, Manhattan Grid), and trace-based mobility models (Truncated Levy Walk, Self-Similar Least Action Walk). Then, we propose a new mobility model by replacing a speed calculating formula using Bonnmotion-3.0.1 on simulator NS2. The proposed mobility model, named Enhanced Manhattan Mobility Model, is compared with the existing Manhattan Grid mobility model in a tabulated form. AODV, DSR, and DSDV are analysed for above-mentioned mobility models against the proposed one. Furthermore, the accuracy of the best protocol over the best mobility model is investigated through Packet Delivery Ratio (PDR), throughput, average end-to-end delay, packet overhead, and packet drop rate performance metrics. Due to the smooth movements created by the proposed model, it shows an improvement of 1 percent to 7 percent in throughput, 0.8 percent to 1.7 percent in packet overhead, 1 percent to 7 percent in PDR, and 1 percent in dropped packets.

scholarly journals Design of an Optimized Multicast Routing Algorithm for Internet of Things

2019 ◽  
Vol 8 (2) ◽  
pp. 4048-4053 ◽  
Keyword(s):  
Internet Of Things ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Network Routing ◽  
Resource Optimization ◽  
System Throughput ◽  
Delivery Ratio ◽  
Portable Devices ◽  
Routing Performance ◽  
Multicast Routing Algorithm

Internet of Things (IoT) is a fast- growing technology in on-going research field that includes wireless sensor networks, cloud computing, big data analytics, ubiquitous computing, distributed decentralized systems, pervasive computing, embedded systems, mobile computing, machine learning etc. The above mentioned fields are mainly connected with IoT smart portable devices such as smartphones, home appliances, healthcare device, smart vehicle devices automation industry devices, etc. Though IoT enabled devices has been increased in many fields, the industries still faces many problem with connectivity issues because of several factors like mobility nature of devices; limited processing power and resource availability which includes energy, bandwidth constraints, routing cost and end to end delay; communication between node to node via intermediate mobile nodes towards destination may also fail links frequently, there by affecting the network performance. These limitations of existing topology based on reactive tree and mesh based routing protocols create challenging task while designing an optimized stable routing algorithm for IoT. In such a situation, resource optimization is an essential task to be performed by the IoT networks. In the proposed work resource optimization was done by Designed Optimized Multicast Routing Algorithm (DOMRA) for IoT. The DOMR algorithm implemented has route discovery process with nodes positions, directions of nodes, velocities of nodes, and then the path stability bases to overcome the connectivity issues. The proposed algorithm focusing to deploy various real time IoT enabled applications such as smart home automation, smart cites, smart agriculture, automation industry etc. To finalize the simulation results shows maximized system throughput, goodput, packet delivery ratio, network lifetime, network routing performance and reduced control overheads. The proposed algorithm hence produced better routing performance when compared with other existing algorithm in wireless networks.

scholarly journals A Novel Routing Protocol for Realistic Traffic Network Scenarios in VANET

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Gagan Deep Singh ◽  
Sunil Kumar ◽  
Hammam Alshazly ◽  
Sahar Ahmed Idris ◽  
Madhushi Verma ◽  
...  
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Delivery Ratio ◽  
Traffic Network ◽  
Evolutionary Trajectory ◽  
Simulation Tools ◽  
Routing Performance ◽  
Simulation Scenario ◽  
Hoc Networks

The vehicular ad hoc network (VANET) has traditional routing protocols that evolved from mobile ad hoc networks (MANET). The standard routing protocols of VANET are geocast, topology, broadcast, geographic, and cluster-based routing protocols. They have their limitations and are not suitable for all types of VANET traffic scenarios. Hence, metaheuristics algorithms like evolutionary, trajectory, nature-inspired, and ancient-inspired algorithms can be integrated with standard routing algorithms of VANET to achieve optimized routing performance results in desired VANET traffic scenarios. This paper proposes integrating genetic algorithm (GA) in ant colony optimization (ACO) technique (GAACO) for an optimized routing algorithm in three different realistic VANET network traffic scenarios. The paper compares the traditional VANET routing algorithm along with the metaheuristics approaches and also discusses the VANET simulation scenario for experimental purposes. The implementation of the proposed approach is tested on the open-source network and traffic simulation tools to verify the results. The three different traffic scenarios were deployed on Simulation of Urban Mobility (SUMO) and tested using NS3.2. After comparing them, the results were satisfactory and it is found that the GAACO algorithm has performed better in all three different traffic scenarios. The realistic traffic network scenarios are taken from Dehradun City with four performance metric parameters including the average throughput, packet delivery ratio, end-to-end delay, and packet loss in a network. The experimental results conclude that the proposed GAACO algorithm outperforms particle swarm intelligence (PSO), ACO, and Ad-hoc on Demand Distance Vector Routing (AODV) routing protocols with an average significant value of 1.55%, 1.45%, and 1.23% in three different VANET network scenarios.

A Probabilistic Routing Algorithm Based on Node Free Buffer-Utilization in Delay Tolerant Network

2013 ◽  
Vol 401-403 ◽  
pp. 2044-2047
Author(s):  
Hong Cheng Huang ◽  
Xi Zhang ◽  
Yi Ding Mao
Keyword(s):  
Network Architecture ◽  
Routing Algorithm ◽  
Buffer Management ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Delivery Ratio ◽  
Excitation Threshold ◽  
Probabilistic Routing ◽  
Disruption Tolerant Network ◽  
Set Up

This Delay/Disruption Tolerant Network(DTN) is a New Network Architecture for Communication in Restricted Condition with High Latency and Intermittent Connectivity.In Order to Solve the Problem that Messages can Not be Delivered Reliably because of Mobility and Limited Buffer Size of Nodes in DTN,a Probabilistic Routing Algorithm Based on Node Free Buffer-Utilization (NFBU)is Proposed.The Algorithm Sets Node Free Buffer Warning/excitation Threshold,through Warning/incentive Factor to Increase/decrease the Node Forwarding Probability,and Set up the Buffer Management Strategy,message Time to Live(TTL)value is Smaller,the Higher its Priority,at the same Time Remove the Oldest Message to get more Buffer Space.Simulations Indicate that the Algorithm Improves Delivery Ratio and Reduces Network Latencies in Different Node Free Buffer-Utilization State Compared with some other Routing Algorithms,and it is Highly Adaptable to Network.

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 Escape Path Obstacle-Based Mobility Model (EPOM) for Campus Delay-Tolerant Network

2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Sirajo Abdullahi Bakura ◽  
Alain Lambert ◽  
Thomas Nowak
Keyword(s):  
Human Mobility ◽  
Mobility Model ◽  
Travel Distance ◽  
Delay Tolerant Network ◽  
Space Environment ◽  
Campus Environment ◽  
Dynamic Movement ◽  
Direction Of Movement ◽  
Delay Tolerant ◽  
Escape Path

In Delay-Tolerant Networks (DTNs), humans are the main carriers of mobile devices, signifying that human mobility can be exploited by extracting nodes’ interests, social behavior, and spatiotemporal features for the performance evaluation of DTNs protocols. This paper presents a new mobility model that describes students’ daily activities in a campus environment. Unlike the conventional random walk models, which use a free space environment, our model includes a collision-avoidance technique that generates an escape path upon encountering obstacles of different shapes and sizes that obstruct pedestrian movement. We evaluate the model’s usefulness by comparing the distributions of its synthetic traces with realistic traces in terms of spatial, temporal, and connectivity features of human mobility. Similarly, we analyze the concept of dynamic movement clusters observed on the location-based trajectories of the studied real traces. The model synthetically generates traces with the distribution of the intercluster travel distance, intracluster travel distance, direction of movement, contact duration, intercontact time, and pause time similar to the distribution of real traces.

Sign in / Sign up

Export Citation Format

Share Document