scholarly journals A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Lei You ◽  
Jianbo Li ◽  
Changjiang Wei ◽  
Chenqu Dai ◽  
Jixing Xu ◽  
...  

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.

2010 ◽  
Vol 20 (1) ◽  
pp. 9-16 ◽  
Author(s):  
Nenad Kojic ◽  
Marija Zajeganovic-Ivancic ◽  
Irini Reljin ◽  
Branimir Reljin

Mobile ad-hoc networks (MANET) are one of wireless networks implementation. MANET is very popular technology initially based on military purposes. Specific modifications of MANET created a possibility to implement several new wireless networks. One of them is a wireless mesh network (WMN). Over the last ten years, WMNs have gained more and more attention and are now considered as a convincing solution for providing better Internet access services for end users. WMN is an emerging technology that offers a cost-effective and scalable method to connect wireless devices. The main problem in WMNs is a routing protocol, especially because it has to enable the access to network for both mesh and conventional clients. Most of the existing ad hoc routing protocols use minimum hop-count as a metric for identifying the best packet routes. This paper presents neural network based approach to routing protocol for WMN. Neural networks are capable to analyze very complex network environments and solve routing problems on optimal (or almost optimal) way.


Author(s):  
Aditi Kumari ◽  
Neha Gandotra ◽  
Pankaj Joshi ◽  
Shrikant Upadhyay

As in real world the movement of nodes are almost always random. And the most important characteristics is the dynamic topology which is a consequence of node mobility, nodes can change position quite frequently, which means we need a routing protocol that quickly adapts to topology changes. Now, days there are more than billion wireless devices in use. And every devices are topology independent. Therefore, the wireless mobile computers or Mobile Ad Hoc Networks (MANET) have become very necessary.


Author(s):  
Bonu Satish Kumar , Et. al.

While its advancement inside MANETs, the AODV routing protocol convention has been and stays a powerful and gainful examination protocol, with association with its course Active Route Timeout (ART), AODV utilizes a predictable worth that demonstrates the time and the course which may stay dynamic in the directing table. A long period of the course might be chosen powerfully, dependably through the estimation, as opposed to reliable worth. For this reason, a Fuzzy rationale framework is utilized to procure the versatile qualities for ART dependent on the transmitter conditions and interceding hubs.As indicated by the pre-essentials of the International Engineering Task Force (IETF), we shouldn't be taking stil qualities in the powerful atmosphere. Subsequently, ART's tweaking of turncoat esteems is accomplished by applies fluffy principles on the info factors hop-count, Sent Control Packet, and Nodes Number. AODV convention yield is assessed after the utilization of Fuzzy based methodology. The proficiency of AODV and FBARTAODV Routing Protocols for Mobile Ad Hoc Networks will be examined with results. In this paper we give outcome show so as to the FBARTAODV perform enhanced compared to the in progress AODV.


2019 ◽  
Vol 4 (12) ◽  
pp. 155-158
Author(s):  
Sujan Chandra Roy ◽  
Farhana Enam ◽  
Md. Ashraful Islam

Delay-Tolerant Networks (DTNs) are part of Opportunistic networks. In the case of opportunistic networks, the joined node of a network can have zero or partial knowledge about other nodes in a network. For this reason, the evident information towards the nodes in the existing network is most difficult to collect for forwarding the message. The application of Opportunistic networks is where have a high tolerance for long delays, high error rate, etc. DTNs are also sparse dynamic Ad-hoc networks were source to destination path does not present all-time for successfully message transmission. As DTN has no end-to-end path for message transmission source to destination node so, the routing design is so sophisticated. The social-based routing protocol is developed to improve the routing mechanism by focusing on social behavior and the interaction with the nodes of a network. Consequently, the performance analysis of existing several DTN routing protocols represents a significant role in designing or developing a new routing protocol for a specific scenario. This article investigates the execution of ordinary routing protocols of DTNs such as Epidemic, Binary Spray and Wait (BSNW), including two social-based routing protocols such as Scorp and dLife using Opportunistic Network Environment (ONE) simulator. The performance of these routing protocols is measured based on delivery ratio and average hop count with inevitable simulation settings. From the simulation result, it is condensed that for higher delivery ratio, BSNW is best, and for average hop count, dLife is the best routing protocol.  


Sign in / Sign up

Export Citation Format

Share Document