Co-operative analysis of proactive and reactive protocols using Dijkstra's Algorithm

Thamizhmaran, K.; Arivazhagan, Akshaya Devi; Anitha, M.

doi:10.1109/isco.2015.7282322

Cited by 7 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When a network node receives an interest packet from a consumer requesting data, the node sends the packet to a next-hop node via the FIB routes. While reactive protocols [69][70][71][72][73][74][75] based on-demand routing algorithms create a route to a specific destination only when a node initiates a route discovery process. Once a route is formed, it is maintained by the node until the destination is no longer reachable.…”

Section: Routing In Ndnmentioning

confidence: 99%

Named Data Networking: A Survey on Routing Strategies

et al. 2022

View full text Add to dashboard Cite

Data has become an increasingly significant component of the Internet as it has increased in popularity. Where people care more about the data than the location of data. The Named Data Network (NDN) took this concept and paired it with the idea of making data a core component rather than host addresses. Because of its in-network caching capability, NDN will become a better contender than current Transmission Control Protocol and Internet Protocol (TCP/IP) based networks as data traffic grows exponentially. NDNrelated challenges are available for investigation as NDN becomes more important. Routing in NDN is another essential domain that needs to be addressed, and several approaches have been presented to address routing concerns in NDN. In this study, we discuss and highlight NDN and its routing strategies comprehensively. In addition, this research illustrates a comparison of important routing paradigms to emphasis the breadth of routing research in NDN. Also, we investigate the routing attributes of NDN and expose the latest literature on this critical topic. Finally, this study provides useful insights into the emerging areas of guidance in the NDN to assist future studies in addressing challenges and open research issues. INDEX TERMSNamed Data Networks, Open Research issues in NDN, Routing in NDN I.

show abstract

Section: Routing In Ndnmentioning

confidence: 99%

Named Data Networking: A Survey on Routing Strategies

et al. 2022

View full text Add to dashboard Cite

show abstract

“…The Dijkstra algorithm is an algorithm to assign the shortest path to reach the destination. In the AODV routing protocol, the shortest distance determination performed when discovery route RREQ was received by node [23].…”

Section: Dijkstra Algorithmmentioning

confidence: 99%

Gaussian Prediction Method to Enhance Energy Efficient in Energy Aware AODV

2019

View full text Add to dashboard Cite

One of the concerns in the development routing protocol in Mobile Ad Hoc Network is energy consumption which is very influential on package delivery. Energy Delay Aware Ad hoc Demand on Distance Vector (EA-AODV) is one of the routing protocols for the development of Ad hoc Demand on Vector (AODV) that considers energy when receiving packets stored in the routing table. The routing protocol applies the Dijkstra algorithm to determine the shortest route by considering the sequence number and hop count. In the development carried out on EA-AODV is a modification of the Dijkstra algorithm by adding a gaussian prediction method in consideration of the energy level that is expected to be more efficient in terms of energy consumption. Gaussian prediction method was executed in receive request (RREQ) when the packet saved in the routing table. The Application of the network protocol was conducted by comparing the performance of AODV with EA-AODV. The consumption energy of EA-AODV is more efficient at 12.07% compared to AODV.

show abstract

“…The presence of sink node becomes difficult to determine as the sink node cannot broadcast its presence to other nodes in the network. Thus, each node needs to keep a record of sufficient information to know about unidirectional link [9], [10], [18], [22].…”

Section: Related Workmentioning

confidence: 99%

An Efficient Destination Sequenced Distance Vector for Mobility based Asymmetric Networks

Girdhar¹,

Khatri²,

Sharma³

2017

IJCA

View full text Add to dashboard Cite

The mobile ad hoc network technology is a wireless interconnection of mobile devices and has dynamic topology. It does not have any fixed network infrastructure and the disparity in the transmission range of different nodes can result into the unidirectional asymmetric links in the network. It has adverse impacts on the overall performance of most of the routing protocols which consider all the wireless links in the network as bidirectional. Hence, a new model is proposed in this paper. It uses the routing table to store the information about the outneighbours and in-neighbours for a node which helps to determine the shortest path to the destination node as well as the reverse path from the unidirectional out-neighbour to the node itself. The paper investigates the existing methods and concludes that the new U-DSDV works efficiently in unidirectional links.

show abstract

Co-operative analysis of proactive and reactive protocols using Dijkstra's Algorithm

Cited by 7 publications

References 10 publications

Named Data Networking: A Survey on Routing Strategies

Named Data Networking: A Survey on Routing Strategies

Gaussian Prediction Method to Enhance Energy Efficient in Energy Aware AODV

An Efficient Destination Sequenced Distance Vector for Mobility based Asymmetric Networks

Contact Info

Product

Resources

About