scholarly journals An Adaptive Routing Algorithm Based on Relation Tree in DTN

Sensors ◽  
2021 ◽  
Vol 21 (23) ◽  
pp. 7847
Author(s):  
Diyue Chen ◽  
Hongyan Cui ◽  
Roy E. Welsch
Keyword(s):  
Negative Feedback ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Routing Algorithms ◽  
Source Node ◽  
Message Delivery ◽  
Average Delay ◽  
Hop Count ◽  
Simulation Results ◽  
Delay Tolerant

It is found that nodes in Delay Tolerant Networks (DTN) exhibit stable social attributes similar to those of people. In this paper, an adaptive routing algorithm based on Relation Tree (AR-RT) for DTN is proposed. Each node constructs its own Relation Tree based on the historical encounter frequency, and will adopt different forwarding strategies based on the Relation Tree in the forwarding phase, so as to achieve more targeted forwarding. To further improve the scalability of the algorithm, the source node dynamically controls the initial maximum number of message copies according to its own cache occupancy, which enables the node to make negative feedback to network environment changes. Simulation results show that the AR-RT algorithm proposed in this paper has significant advantages over existing routing algorithms in terms of average delay, average hop count, and message delivery rate.

scholarly journals Non-dominated Sorting Genetic Algorithm-II for Throwbox Deployment in Delay Tolerant Networks

2019 ◽  
Vol 8 (4) ◽  
pp. 7475-7479
Keyword(s):  
Genetic Algorithm ◽  
Delay Tolerant Networks ◽  
Opportunistic Networks ◽  
Transmission Range ◽  
Message Delivery ◽  
Average Delay ◽  
Optimal Deployment ◽  
Simulation Results ◽  
Delay Tolerant ◽  
Carry And Forward

Delay-tolerant networks (DTNs) are basically opportunistic networks and uses store-carry-and-forward switching for message forwarding. Performance of DTNs can be improved by placing stationary nodes, called throwboxes which increases the contact opportunities among nodes. Throwbox is viewed as relaying node and the message delivery is enhanced by spreading as many messages as possible. Increasing the contact opportunities in throwbox based DTN model depends on the deployment of throwboxes in suitable places. The objective of this paper is to identify optimal deployment locations of the throwboxes with a pre-specified transmission range, and to maximize the coverage of all the throwboxes in order to increase average delivery and to reduce the average delay among all the nodes in the network. We use Non-Dominated Sorting Genetic Algorithm–II for optimizing the deployment of throwboxes in DTN. The simulation results are analyzed for better strategy in deploying throwboxes and to improve the performance of throwbox-augmented DTNs.

scholarly journals A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Wei Zhou ◽  
Zilong Tan ◽  
Shaowen Yao ◽  
Shipu Wang
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Upper And Lower Bounds ◽  
Resource Location ◽  
Hop Count ◽  
Worst Case ◽  
Average Case ◽  
Splay Tree ◽  
Efficient Resource ◽  
P2p System

Resource location in structured P2P system has a critical influence on the system performance. Existing analytical studies of Chord protocol have shown some potential improvements in performance. In this paper a splay tree-based new Chord structure called SChord is proposed to improve the efficiency of locating resources. We consider a novel implementation of the Chord finger table (routing table) based on the splay tree. This approach extends the Chord finger table with additional routing entries. Adaptive routing algorithm is proposed for implementation, and it can be shown that hop count is significantly minimized without introducing any other protocol overheads. We analyze the hop count of the adaptive routing algorithm, as compared to Chord variants, and demonstrate sharp upper and lower bounds for both worst-case and average case settings. In addition, we theoretically analyze the hop reducing in SChord and derive the fact that SChord can significantly reduce the routing hops as compared to Chord. Several simulations are presented to evaluate the performance of the algorithm and support our analytical findings. The simulation results show the efficiency of SChord.

Comparative Performance Analysis of 
Selected Routing Algorithms by Load Variation of 2-Dimensional Mesh Topology Based 
Network-On-Chip

2021 ◽  
Vol 20 (3) ◽  
pp. 1-6
Author(s):  
Mohammed Shaba Saliu ◽  
Muyideen Omuya Momoh ◽  
Pascal Uchenna Chinedu ◽  
Wilson Nwankwo ◽  
Aliu Daniel
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Injection Rate ◽  
Network On Chip ◽  
Routing Algorithms ◽  
Comparative Performance ◽  
Traffic Pattern ◽  
Mesh Topology ◽  
Similar Vein ◽  
On Chip

Network-on-Chip (NoC) has been proposed as a viable solution to the communication challenges on System-on-Chips (SoCs). As the communication paradigm of SoC, NoCs performance depends mainly on the type of routing algorithm chosen. In this paper different categories of routing algorithms were compared. These include XY routing, OE turn model adaptive routing, DyAD routing and Age-Aware adaptive routing.  By varying the load at different Packet Injection Rate (PIR) under random traffic pattern, comparison was conducted using a 4 × 4 mesh topology. The Noxim simulator, a cycle accurate systemC based simulator was employed. The packets were modeled as a Poisson distribution; first-in-first-out (FIFO) input buffer channel with a depth of five (5) flits and a flit size of 32 bits; and a packet size of 3 flits respectively. The simulation time was 10,000 cycles. The findings showed that the XY routing algorithm performed better when the PIR is low.  In a similar vein, the DyAD routing and Age-aware algorithms performed better when the load i.e. PIR is high.

A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes

2005 ◽  
Vol 15 (01n02) ◽  
pp. 153-168 ◽  
Author(s):  
A. KHONSARI ◽  
H. SARBAZI-AZAD ◽  
M. OULD-KHAOUA
Keyword(s):  
Routing Algorithm ◽  
Queueing Systems ◽  
Adaptive Routing ◽  
Routing Algorithms ◽  
Performance Model ◽  
Deadlock Detection ◽  
Impatient Customers ◽  
Simulation Experiments ◽  
Proposed Model ◽  
Fully Adaptive

Recent studies have revealed that deadlocks are generally infrequent in the network. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated the development of novel adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model to predict message latency in hypercubes with a true fully adaptive routing algorithm with progressive deadlock recovery. One of the main features of the proposed model is the use of results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

scholarly journals DCAR: DTN Congestion Avoidance Routing Algorithm Based on Tokens in an Urban Environment

2017 ◽  
Vol 2017 ◽  
pp. 1-9
Author(s):  
Hezhe Wang ◽  
Hongwu Lv ◽  
Huiqiang Wang ◽  
Guangsheng Feng
Keyword(s):  
Network Performance ◽  
Routing Algorithm ◽  
Relay Node ◽  
Routing Algorithms ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Movement Trajectory ◽  
Average Delay ◽  
Urban Scenario

When a delay/disruption tolerant network (DTN) is applied in an urban scenario, the network is mainly composed of mobile devices carried by pedestrians, cars, and other vehicles, and the node’s movement trajectory is closely related to its social relationships and regular life; thus, most existing DTN routing algorithms cannot show efficient network performance in urban scenarios. In this paper, we propose a routing algorithm, called DCRA, which divides the urban map into grids; fixed sink stations are established in specific grids such that the communication range of each fixed sink station can cover a specific number of grids; these grids are defined as a cluster and allocated a number of tokens in each cluster; the tokens in the cluster are controlled by the fixed sink station. A node will transmit messages to a relay node that has a larger remaining buffer size and encounters fixed sink stations or the destination node more frequently after it obtains a message transmit token. Simulation experiments are carried out to verify the performance of the DCAR under an urban scenario, and results show that the DCAR algorithm is superior to existing routing algorithms in terms of delivery ratio, average delay, and network overhead.

scholarly journals Providing an Adaptive Routing along with a Hybrid Selection Strategy to Increase Efficiency in NoC-Based Neuromorphic Systems

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Mohammad Trik ◽  
Saadat Pour Mozaffari ◽  
Amir Massoud Bidgoli
Keyword(s):  
Power Consumption ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Selection Strategy ◽  
Communication Structure ◽  
Average Delay ◽  
Selection Strategies ◽  
Neuromorphic Systems ◽  
Hybrid Selection ◽  
Network On A Chip

Effective and efficient routing is one of the most important parts of routing in NoC-based neuromorphic systems. In fact, this communication structure connects different units through the packets routed by routers and switches embedded in the network on a chip. With the help of this capability, not only high scalability and high development can be created, but by decreasing the global wiring to the chip level, power consumption can be reduced. In this paper, an adaptive routing algorithm for NoC-based neuromorphic systems is proposed along with a hybrid selection strategy. Accordingly, a traffic analyzer is first used to determine the type of local or nonlocal traffic depending on the number of hops. Then, considering the type of traffic, the RCA and NoP selection strategies are used for the nonlocal and local strategies, respectively. Finally, using the experiments that performed in the simulator environment, it has been shown that this solution can well reduce the average delay time and power consumption.

Propose a new algorithm of routing with information collected locally

2016 ◽  
Vol 2 (1) ◽  
pp. 70
Author(s):  
Tran Minh Anh ◽  
Nguyen Chien Trinh
Keyword(s):  
Routing Algorithm ◽  
Qos Routing ◽  
Local Information ◽  
Routing Algorithms ◽  
Source Node ◽  
Quality Of Services ◽  
Global State ◽  
State Information ◽  
Near Future

The type of algorithm which uses local information collected from source node for Quality of Service (QoS) routing has recently been researched as an alternative to QoS routing algorithms that traditionally use global state information. This algorithm, collecting information from source node only, helps flow routing better and assures more flexibly QoS for network. This trend leads to a new solution for satisfying the higher and higher demand of telecom market in the near future. In this paper, we introduce a new algorithm of routing like that type for assuring the quality of network as well as quality of services. The simulations at last section show the advantages over some other localized routing algorithms and global routing algorithm.

scholarly journals Probabilistic Routing Based on Two-Hop Information in Delay/Disruption Tolerant Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Xu Wang ◽  
Rongxi He ◽  
Bin Lin ◽  
Ying Wang
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Delivery Rate ◽  
Message Delivery ◽  
Total Energy Consumption ◽  
Average Delay ◽  
Disruption Tolerant Networks ◽  
Probabilistic Routing ◽  
Comparable Performance ◽  
One Simulator

We investigate an opportunistic routing protocol in delay/disruption tolerant networks (DTNs) where the end-to-end path between source and destination nodes may not exist for most of the time. Probabilistic routing protocol using history of encounters and transitivity (PRoPHET) is an efficient history-based routing protocol specifically proposed for DTNs, which only utilizes the delivery predictability of one-hop neighbors to make a decision for message forwarding. In order to further improve the message delivery rate and to reduce the average overhead of PRoPHET, in this paper we propose an improved probabilistic routing algorithm (IPRA), where the history information of contacts for the immediate encounter and two-hop neighbors has been jointly used to make an informed decision for message forwarding. Based on the Opportunistic Networking Environment (ONE) simulator, the performance of IPRA has been evaluated via extensive simulations. The results show that IPRA can significantly improve the average delivery rate while achieving a better or comparable performance with respect to average overhead, average delay, and total energy consumption compared with the existing algorithms.

DTN Routing Mechanism Based on Area Dipartition

2013 ◽  
Vol 756-759 ◽  
pp. 851-854
Author(s):  
Yun Yang ◽  
Long Sheng Han ◽  
Ran Yan ◽  
Xiu Ping Kong ◽  
Wen Chun Xu
Keyword(s):  
Network Architecture ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Network Routing ◽  
Message Delivery ◽  
Transfer Path ◽  
Delivery Probability ◽  
Dtn Routing ◽  
Routing Mechanism ◽  
Delay Tolerant

Delay Tolerant Networks (DTN) has been widely used in challenge networks as an emerging network architecture. Among all studies , routing mechanism is the key problem in DTN. Because of high latency and low data rate, the traditional network routing algorithm can not apply to DTN. This paper proposed a DTN routing mechanism based on area dipartition. The mechanism divided the space into several regions, and calculated the probability of occurrence of each node in each region to determine data transfer path according to the probability. Finally, the simulation results show that the mechanism can significantly enhance the message delivery probability and reduce the packet loss rate.

ON THE DESIGN OF DEADLOCK-FREE ADAPTIVE MULTICAST ROUTING ALGORITHMS

1993 ◽  
Vol 03 (04) ◽  
pp. 321-333 ◽  
Author(s):  
JOSÉ DUATO
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Sufficient Conditions ◽  
Adaptive Routing ◽  
Routing Algorithms ◽  
Multicast Communication ◽  
Adaptive Multicast ◽  
Routing Methods ◽  
Wormhole Networks ◽  
Additional Channel

Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. Two multicast wormhole routing methods have been presented in [13] for multicomputers with 2D-mesh and hypercube topologies. Also, a theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed in [7, 8]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. This paper analyses the additional channel dependencies produced by multicast routing algorithms on wormhole networks. Then, the theory proposed in [7, 8] is extended by considering them. As an example, the multicast routing algorithms presented in [13] are extended, taking advantage of the alternative paths offered by the network.

Sign in / Sign up

Export Citation Format

Share Document