Directed Flooding Routing Algorithm Based on Location in DTN

2013 ◽  
Vol 846-847 ◽  
pp. 1664-1667
Author(s):  
Geng Yu ◽  
Fu Jie Huang
Keyword(s):  
Communication Channel ◽  
Routing Algorithm ◽  
Propagation Delay ◽  
Routing Algorithms ◽  
Location Information ◽  
Delivery Ratio ◽  
Disruption Tolerant Networks ◽  
Message Transmission ◽  
Dtn Routing ◽  
Epidemic Routing

. In allusion to the high delay, restricted nodes resources and lack of persistent end to end connections in Delay /Disruption Tolerant Networks ( DTN) ,this paper proposes a novel directed flooding routing algorithm based on location information. The algorithm combines DTN with the known nodes locations in communication channel to improve the DTN networks topology knowledge to reduce the noneffective duplicate,then conducts single duplicate routing depending on location. The algorithm can increase the directivity and purposiveness of message transmission, decrease the consumption of networks resources, and thereby reduce propagation delay and improve the delivery ratio. The simulation shows that the proposed algorithm is feasible and effective, and it is superior to the typical DTN routing algorithms such as Epidemic Routing.

A Community-Based Message Transmission Algorithm for Opportunistic Networks

2013 ◽  
Vol 427-429 ◽  
pp. 2333-2337
Author(s):  
Zhi Ren ◽  
Yan Wei Liu ◽  
Shuang Peng ◽  
Ji Bi Li
Keyword(s):  
Routing Algorithm ◽  
Opportunistic Networks ◽  
Transmission Condition ◽  
Routing Algorithms ◽  
Delivery Ratio ◽  
Community Based ◽  
Delivery Delay ◽  
Message Transmission ◽  
Simulation Results ◽  
Determination Mechanism

In opportunistic networks, routing algorithms based on community division have some redundant forwarding in the process of message transmission. In this paper, we propose a community-based message transmission algorithm (CMTA). CMTA makes fully use of the nodes within communication overlapping areas to forward messages and optimizes forwarding determination mechanism to carry message nodes, then CMTA redesigns the message transmission condition and reduces the number of message forwarding which improve the efficiency of forwarding messages and reduce the average end-end delivery delay. Theoretical analysis and simulation results show that CMTA outperforms an existing Epidemic routing algorithm and the Prophet algorithm and CHMTS in terms of delivery ratio, average end-end delivery delay, relay ratio, etc.

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.

An Energy-Efficient Routing Algorithm for Disruption Tolerant Networks

2013 ◽  
Vol 756-759 ◽  
pp. 3754-3759 ◽  
Author(s):  
Yu Kun Yao ◽  
Wen Xi Zheng ◽  
Zhi Ren
Keyword(s):  
Energy Efficient ◽  
Routing Algorithm ◽  
Cross Layer ◽  
Delivery Ratio ◽  
Cross Layer Design ◽  
Control Mechanisms ◽  
Mobile Nodes ◽  
Energy Efficient Routing ◽  
Transmit Power ◽  
Disruption Tolerant Networks

In Disruption Tolerant Networks (DTN), information is exchanged between mobile nodes with the same transmit power. It is an energy-consuming process and highlights the need for energy-efficient power control mechanisms. If the transmit power of nodes is too low, they might miss many of the opportunities of transmission. On the other hand, high transmit power is energy inefficient. In this paper, we propose ERBC (Energy-efficient Routing algorithm Based on Cross-layer design), an energy-efficient routing algorithm based on cross-layer design. Instead of using fixed transmit power, ERBC dynamically chooses the transmit power using both the cross-lay design and the RSSI technology. Meanwhile, ERBC broadcast data packets partially in order to enhance the delivery ratio. Through simulation, we demonstrate that ERBC can reduce 37% for per-bit energy consumption than that in basic epidemic routing protocol.

scholarly journals Survey on Various DTN Routing Algorithms for Vehicular ADHOC Network (VANET)

2020 ◽  
pp. 224-228
Author(s):  
Saravanan M ◽  
Kamaraj K ◽  
Eswaran Arumugam
Keyword(s):  
Routing Algorithm ◽  
Opportunistic Routing ◽  
Routing Algorithms ◽  
Single Node ◽  
Intermittent Connectivity ◽  
Self Organized ◽  
Adhoc Network ◽  
Dtn Routing ◽  
Disruption Tolerant Network ◽  
Carry And Forward

Vehicle Adhoc Network (VANET) permits self-organized infrastructure. Link or Connectivity breakage or long delay (intermittent connection) is an important issue in the VANET which arises due to the dynamic topological changes. Mainly two algorithms Vehicle assisted Data Delivery (VADD) and Opportunistic routing algorithm supports for handling delay/disruption tolerant network (DTN). Intention of DTN is to create dynamic link between the sender and receiver vehicle in the case of link disruption or absence of path between two nodes and forwards the data using store carry and forward. VADD carry and forward the data as much as possible in disconnected network using intersection mode, straightway mode or destination mode. Opportunistic routing can deal the unreliable data and intermittent connectivity in VANET by considering the multiple nodes as a next hop forwarder instead of considering pre-selected single node to be the best forwarder. This paper gives the study about various opportunistic routing algorithms for handling delay/disruption tolerant network.

scholarly journals Investigating Master–Slave Architecture for Underwater Wireless Sensor Network

Sensors ◽  
2021 ◽  
Vol 21 (9) ◽  
pp. 3000
Author(s):  
Sadeeq Jan ◽  
Eiad Yafi ◽  
Abdul Hafeez ◽  
Hamza Waheed Khatana ◽  
Sajid Hussain ◽  
...  
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Propagation Delay ◽  
Data Packet ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Term Survival ◽  
Limited Bandwidth ◽  
Delay Tolerant

A significant increase has been observed in the use of Underwater Wireless Sensor Networks (UWSNs) over the last few decades. However, there exist several associated challenges with UWSNs, mainly due to the nodes’ mobility, increased propagation delay, limited bandwidth, packet duplication, void holes, and Doppler/multi-path effects. To address these challenges, we propose a protocol named “An Efficient Routing Protocol based on Master–Slave Architecture for Underwater Wireless Sensor Network (ERPMSA-UWSN)” that significantly contributes to optimizing energy consumption and data packet’s long-term survival. We adopt an innovative approach based on the master–slave architecture, which results in limiting the forwarders of the data packet by restricting the transmission through master nodes only. In this protocol, we suppress nodes from data packet reception except the master nodes. We perform extensive simulation and demonstrate that our proposed protocol is delay-tolerant and energy-efficient. We achieve an improvement of 13% on energy tax and 4.8% on Packet Delivery Ratio (PDR), over the state-of-the-art protocol.

scholarly journals A Social-Based DTN Routing in Cooperative Vehicular Sensor Networks

2018 ◽  
Vol 27 (01) ◽  
pp. 1741003 ◽  
Author(s):  
Tong Wang ◽  
Yongzhe Zhou ◽  
Xibo Wang ◽  
Yue Cao
Keyword(s):  
Information System ◽  
Sensor Networks ◽  
High Speed ◽  
Delivery Ratio ◽  
Dtn Routing ◽  
Replication Strategy ◽  
Social Metrics ◽  
Routing Mechanism ◽  
Network Overhead ◽  
Overhead Ratio

As a cooperative information system, vehicles in Vehicular Sensor Networks deliver messages based on collaboration. Due to the high speed of vehicles, the topology of the network is highly dynamic, and the network may be disconnected frequently. So how to transfer large files in such network is worth considering. The encountering nodes which never meet before flood messages blindly cause tremendous network overhead. We address this challenge by introducing the Encounter Utility Rank Router (EURR) based on social metrics. EURR includes three cases: Utility Replication Strategy, Lifetime Replication Strategy and SocialRank Replication Strategy. The Lifetime Replication is promising and complements Utility Replication. It enhances the delivery ratio by relaying the copy via the remaining lifetime. Considering the network overhead, the SocialRank Replication replicates a copy according to the SocialRank when two communicating nodes have not met before. The routing mechanism explores the utility of history encounter information and social opportunistic forwarding. The results under the scenario show an advantage of the proposed EURR over the compared algorithms in terms of delivery ratio, average delivery latency and overhead ratio.

scholarly journals Antnet: A Robust Routing Algorithm for Data Networks

1970 ◽  
Vol 5 (1) ◽  
Author(s):  
Shariq Haseeb Khairul Azami Sidek Ahmad Faris Ismail, Lai W.K. ◽  
Aw Yit Mei
Keyword(s):  
Mobile Agents ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Convergence Time ◽  
Data Networks ◽  
Successful Implementation ◽  
Link State ◽  
Performance Matrix ◽  
Telecommunications Network ◽  
Routing Tables

Successful implementation and operation of a network largely depends on the routing algorithm in use. To date, several routing algorithms are in use but the problem with these algorithms is that they are either not adaptive or not robust enough, thus limiting the proper use of bandwidth.  AntNet is an innovative algorithm that may be used for data networks. It is a combination of both static and dynamic routing algorithms. In this algorithm, a group of mobile agents (compared to real ants) form paths between source and destination nodes. They explore the network continuously and exchange obtained information indirectly, in order to update the routing tables at different nodes. Our version of AntNet (hereinafter referred to as AntNet2.0) has been improved to overcome the problems with other algorithms. This paper compares the performance of AntNet2.0 against two other commercially popular algorithms, viz. link state routing algorithm and distant vector routing algorithm. The performance matrix used to compare the algorithms is based on average throughput, packet loss, packet drop and end-to-end delay. Convergence time for this algorithm on a nation-wide telecommunications network will also be discussed. Conclusions and areas of further work will also be presented in lucid manner, so that it may be transformed into real practice in the future.Key Words: mobile agents, swarm intelligence, networks and constant bit rate

INVESTIGATING A WIRELESS SENSOR NETWORK OPTIMAL LIFETIME SOLUTION FOR LINEAR TOPOLOGIES

2006 ◽  
Vol 07 (01) ◽  
pp. 91-99 ◽  
Author(s):  
Keith Hellman ◽  
Michael Colagrosso
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Nearest Neighbor ◽  
Analytic Solution ◽  
Routing Algorithm ◽  
Optimal Solution ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Global Knowledge ◽  
Alternative Solutions

We investigate a known optimal lifetime solution for a linear wireless sensor network through simulation, and propose alternative solutions where a known optimal solution does not exist. The network is heterogeneous in the sensors' energy distribution and also in the amount of data each sensor must communicate. As a basis for comparison, we analyze the lifetime of a network using a simple, nearest-neighbor routing algorithm, and an analytic solution to the optimal lifetime of networks meeting certain constraints. Alternative solutions considered range from those requiring global knowledge of the network to solutions using only next-neighbor knowledge. We compare the performance of all the routing algorithms in simulation.

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.

Sign in / Sign up

Export Citation Format

Share Document