scholarly journals Agent Aided Routing for Faster and Efficient Spreading of Messages in Delay Tolerant Networks

1970 ◽  
Vol 8 (2) ◽  
pp. 123-132
Author(s):  
Shahid Md. Asif Iqbal ◽  
Alok Kumar Chowdhury ◽  
Amina Akhter
Keyword(s):  
Delay Tolerant Networks ◽  
Communication Overhead ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Agent Based ◽  
Delivery Delay ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Delay Tolerant ◽  
Better Than

Routing schemes in Delay Tolerant Networks depend on the intermediate nodes to carry messages till the forwarding of the messages to other nodes or delivery of the messages to their destinations. Thus, efficient and faster spreading of messages is essential to reduce the delay of sending a message from source to destination. In this work, we aim to design a new agent aided routing scheme in Delay Tolerant Networks to avoid large message delivery delay. Here, the source of a message is permitted to create unlimited copies of a message and distribute these copies to agents. Agents acting as the representative of the sources receive messages from the sources based on their node visited list and delivery predictability. After that, the agents forward the copies to the other intermediate nodes or deliver the message directly to the destination. Thus, the agents help in faster and efficient dissemination of a message in the network which helps in reducing message delivery delay. Besides, we compare our scheme with that of other schemes in different network scenarios through simulations. Simulation results show that our agent based routing scheme performs better than that of others in terms of Delivery Ratio, Delay and Communication Overhead.

scholarly journals A Message Transfer Framework for Enhanced Reliability in Delay-Tolerant Networks

2015 ◽  
Vol 7 (3) ◽  
pp. 52
Author(s):  
Farzana Yasmeen ◽  
Uyen Trang Nguyen ◽  
Nurul Huda ◽  
Shigeki Yamada ◽  
Cristian Borcea
Keyword(s):  
Network Performance ◽  
Performance Metrics ◽  
Delay Tolerant Networks ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Delivery Performance ◽  
End To End Delay ◽  
End To End ◽  
Deadline Constraints ◽  
Delay Tolerant

Delay-tolerant networks (DTNs) can tolerate disruption on end-to-end paths by taking advantage of temporal links emerging between nodes as nodes move in the network. Intermediate nodes store messages before forwarding opportunities become available. A series of encounters (i.e., coming within mutual transmission range) among different nodes will eventually deliver the message to the desired destination. The message delivery performance in a DTN (such as delivery ratio and end-to-end delay) highly depends on the time elapsed between encounters and the time two nodes remain in each others communication range once a contact is established. As messages are forwarded opportunistically among nodes, it is important to have sufficient contact opportunities in the network for faster, more reliable delivery of messages. We propose a simple yet efficient method for improving the performance of a DTN by increasing the contact duration of encountered nodes (i.e., mobile devices). Our proposed sticky transfer framework and protocol enable nodes in DTNs to collect neighbors’ information, evaluate their movement patterns and amounts of data to transfer in order to make decisions of whether to “stick” with a neighbor to complete the necessary data transfers. The sticky transfer framework can be combined with any DTN routing protocol to improve its performance. We evaluate ourframework through simulations and measure several network performance metrics. Simulation results show that the proposed framework can improve the message delivery ratio, end-to-end delay, overhead ratio, buffer occupancy, number of disrupted message transmissions and so on. It can be well adopted for challenged scenarios where larger messages sizes need to be delivered with application deadline constraints. Furthermore, performance of the DTN improved (upto 43%) at higher node densities and (up to 49%) under increased mobility conditions.

scholarly journals RDSP: Rapidly Deployable Wireless Ad Hoc System for Post-Disaster Management

Sensors ◽  
2020 ◽  
Vol 20 (2) ◽  
pp. 548 ◽  
Author(s):  
Ajmal Khan ◽  
Adnan Munir ◽  
Zeeshan Kaleem ◽  
Farman Ullah ◽  
Muhammad Bilal ◽  
...  
Keyword(s):  
Ad Hoc ◽  
Outdoor Environment ◽  
Location Information ◽  
Communication Overhead ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Routing Scheme ◽  
Emergency Scenarios ◽  
Client Device ◽  
Post Disaster

In post-disaster scenarios, such as after floods, earthquakes, and in war zones, the cellular communication infrastructure may be destroyed or seriously disrupted. In such emergency scenarios, it becomes very important for first aid responders to communicate with other rescue teams in order to provide feedback to both the central office and the disaster survivors. To address this issue, rapidly deployable systems are required to re-establish connectivity and assist users and first responders in the region of incident. In this work, we describe the design, implementation, and evaluation of a rapidly deployable system for first response applications in post-disaster situations, named RDSP. The proposed system helps early rescue responders and victims by sharing their location information to remotely located servers by utilizing a novel routing scheme. This novel routing scheme consists of the Dynamic ID Assignment (DIA) algorithm and the Minimum Maximum Neighbor (MMN) algorithm. The DIA algorithm is used by relay devices to dynamically select their IDs on the basis of all the available IDs of networks. Whereas, the MMN algorithm is used by the client and relay devices to dynamically select their next neighbor relays for the transmission of messages. The RDSP contains three devices; the client device sends the victim’s location information to the server, the relay device relays information between client and server device, the server device receives messages from the client device to alert the rescue team. We deployed and evaluated our system in the outdoor environment of the university campus. The experimental results show that the RDSP system reduces the message delivery delay and improves the message delivery ratio with lower communication overhead.

scholarly journals Advanced Optimal Buffer Scheduling Policy in Opportunistic Networks

2012 ◽  
Vol 4 ◽  
pp. 13-18
Author(s):  
Qi Lie Liu ◽  
Guang De Li ◽  
Yun Li ◽  
Ying Jun Pan ◽  
Feng Zhi Yu
Keyword(s):  
Buffer Management ◽  
Opportunistic Networks ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Scheduling Policy ◽  
Optimal Theory ◽  
Overall Performance ◽  
Delay Tolerant ◽  
Ratio Transmission ◽  
Better Than

Opportunistic Networks (ONs) are the newly emerging type of Delay Tolerant Network (DTN) systems that opportunistically exploit unpredicted contacts among nodes to share information. As with all DTN environments ONs experience frequent and large delays, and an end-to-end path may only exist for a brief and unpredictable time. In this paper, we employ optimal theory to propose a novel buffer management strategy named Optimal Buffer Scheduling Policy (OBSP) to optimize the sequence of message forwarding and message discarding. In OBSP, global optimization considering delivery ratio, transmission delay, and overhead is adopted to improve the overall performance of routing algorithms. The simulation results show that the OBSP is much better than the existing ones.

A Reed-Solomon Based Method to Improve Message Delivery in Delay Tolerant Networks

2017 ◽  
Vol 24 (4) ◽  
pp. 444-453 ◽  
Author(s):  
Angelita Rettore de Araujo Zanella ◽  
Luiz Carlos Pessoa Albini
Keyword(s):  
Delay Tolerant Networks ◽  
Message Delivery ◽  
Delay Tolerant
Sign in / Sign up

Export Citation Format

Share Document