Cooperative and fresher encounter algorithm for reducing delay in MANET

Alleema, N. Noor; Kumar, Dinesh

doi:10.11591/ijeecs.v14.i3.pp1258-1265

Cited by 2 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…End-to-end delay is the average time taken by a data packet to arrive at the destination [25,26]. Only the data packets that are successfully delivered to the destinations are counted.…”

Section: Resultsmentioning

confidence: 99%

Performance analysis of routing protocols in MANET

Walunjkar

Anne

2020

IJEECS

View full text Add to dashboard Cite

Popularity of Mobile ad hoc network in research is due to their ad hoc nature and effectiveness at the time of disaster management when no infrastructure support is available. Due to the limited transmission range of wireless network interfaces, multiple network hops may be needed for nodes to exchange data across the network. In such a network, each mobile node operates as a router, forwarding packets for other mobile nodes in the network that may not be within the direct reach. Routing protocols developed for wired networks such as the distance vector or link state protocols are inadequate here as they not only assume mostly fixed topology but also have high overheads. This has lead to several routing algorithms specifically targeted for ad hoc networks. In this paper, we include the MANET supported routing protocols and their performance analysis over different performance parameters such as packet delivery ratio, delay, throughput, control overhead and energy etc. INTRODUCTIONWireless network is one of the types of data communication network that utilizes wireless connections for connecting devices for exchanging information [1,2]. Wireless network technology avoids the expensive method of the installations of cables for the data connection between devices within various locations. Radio networks and Wi-Fi local networks are two of the examples of wireless networks. There exists two main classification of wireless networks; infrastructure and infrastructure less wireless networks. In the former, the data communications are created and maintained through access points or routers. An example of this type of network is cellular networks. The latter type is basically known as Ad hoc networks. In such a network where stations are capable of created by themselves and exchanging information between them in a multi-hop style without the fixed infrastructure. Such an infrastructure less property of the network can be easily adapt in a given location.The highly dynamic nature of a mobile ad hoc network results in frequent and unpredictable changes of network topology, adding difficulty and complexity to routing among the mobile nodes. The challenges and complexities, coupled with the critical importance of routing protocol in establishing communications among mobile nodes, make routing area the most active research area within the MANET domain [3]. PROPOSED MODELMANET has routable networking environment to process the exchange of information or packet from one node to other node. Different protocols are simulated for measuring the packet drop rate, the overhead introduced by the routing protocol, end-to-end delay of packet, network throughput, 

show abstract

“…End-to-end delay is the average time taken by a data packet to arrive at the destination [25,26]. Only the data packets that are successfully delivered to the destinations are counted.…”

Section: Resultsmentioning

confidence: 99%

Performance analysis of routing protocols in MANET

Walunjkar

Anne

2020

IJEECS

View full text Add to dashboard Cite

show abstract

“…A fresher encounter algorithm is an uncomplicated algorithm for efficiently determining the routes. The node desires to discover the in-between node rather than decide on the receiver node; that in-between node keeps the information of the freshly encountered receiver node [19]. The significant benefit of this algorithm is that it minimizes the processing time.…”

Section: Proposed Systemmentioning

confidence: 99%

Cooperative Routing for Improving the Lifetime of Wireless Ad-Hoc Networks

Unnikrishnan¹,

Das²

2022

IJASIS

View full text Add to dashboard Cite

In Wireless Ad-hoc Networks (WANET), route detection is the main issue. In the usual route detection method, the sender itself discovers the route to the receiver based on the shortest path. In this path, the sender node does not require knowledge of the in-between nodes, and the sender node transmits the information to the in-between nodes. The in-between nodes transmit the data to the near node that receives it. This procedure will be maintained till the information reaches the receiver node. The main disadvantage of usual route detection is that the node is highly moved; thus, the transmitted data packet will be dropped. A Cooperative Routing for Improving Lifetime (CRIL) in WANET is introduced to solve these issues. This approach aims to enhance the WANET lifetime and minimize the cost of route discovery. This approach uses the fresher encounter algorithm with energyefficient routing to improve network lifetime. It is a simple algorithm to efficiently discover the routes in WANET.

show abstract

Cooperative and fresher encounter algorithm for reducing delay in MANET

Cited by 2 publications

References 13 publications

Performance analysis of routing protocols in MANET

Performance analysis of routing protocols in MANET

Cooperative Routing for Improving the Lifetime of Wireless Ad-Hoc Networks

Contact Info

Product

Resources

About