Least Mobility High Power (LMHP) Dynamic Routing for QoS Development in Manet

Arumugham, Kowshika; Chenniappan, Vivekanandan

doi:10.1007/s11277-018-6116-4

Cited by 7 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…LMHP steering calculation [27] is proposed a calculation to find the course by sending LMHP course revelation LMHP-RD packet to the neighbors. The neighbors answer the LMHP-course demand (RREQ) bundle to the source hub which contains power and dislodging data pretty much all the middle of the road hubs.…”

Section: Literature Surveymentioning

confidence: 99%

Multi-objective Based Route Selection Approach Using AOMDV in MANET

Saxena,

Dutta,

K.Singh

et al. 2023

SN COMPUT. SCI.

View full text Add to dashboard Cite

Mobile ad hoc networks consist of mobile nodes in wireless mode. Because of ease deployment, low cost and easy communication, MANET has become one of the attractive research area in wireless communication. The challenging issues in MANET are limited energy of nodes, high mobility and dynamic topologies. These issues cause frequent link breakage due to this route discovery process reinitiated repeatedly. Many researchers gave their contribution for improving the existing protocols; still there are many scopes of improvements present. In this paper a novel routing algorithm MO-AOMDV (Multi Objective AOMDV) is proposed. In this algorithm route discovery and route selection is based on the quality of node and links, it denoted by G (V, L) where V present number of nodes and L present the link between nodes. In addition, every node has a local list where the remaining energy of node and list of neighbors is updated. It is developed and simulated in network simulator and the performance is compared with traditional AODV and AOMDV algorithm and comparing parameters are packet drop ratio, packet delivery ratio, and network lifetime.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Multi-objective Based Route Selection Approach Using AOMDV in MANET

Saxena,

Dutta,

K.Singh

et al. 2023

SN COMPUT. SCI.

View full text Add to dashboard Cite

show abstract

“…For the purpose of improving the performance of the MANET, there was an efficient routing algorithm known as the Least Mobility High Power (LMHP) that had been presented by Arumugham and Chenniappan [7]. This source node will discover routes by sending the LMHP-Route Discovery (LMHP-RD) based message to its neighbours that were identified in the phase of neighbour discovery.…”

Section: Related Workmentioning

confidence: 99%

Hybrid Tabu-Shuffled Frog Leaping Algorithm for Multipath Quality Route Selection Routing In High Mobility Network

Indhumathi¹,

V.²

2019

IJITEE

View full text Add to dashboard Cite

The Mobile Ad hoc Networks (MANETs) have been emerging as a technology offering many advantages to the users as regards cost and ease. The MANET is the collection of the connected mobile nodes and the connection is by the wireless links forming a temporary topology of network operating without centralized administration or the base station. Routing indicates a method by which information gets forwarded from transmitters to recipients. This is a strategy which guarantees the connection between two of the nodes in this network. For this work, there was a routing algorithm that was proposed for an efficient determination of an optimal path from the source to the destination in the MANETs. The Ad hoc On-Demand Distance Vector Routing (AODV) based protocol has been a routing protocol that has been designed for operating the MANET. This algorithm had been designed by means of using the TABU Search (TS) and the Shuffled Frog Leaping Algorithm (SFLA) which has been a metaheuristic algorithm that is a representation. The TABU_SFLA proposed had carried out two other operations generated in the neighbourhood for determining the optimal path and to minimize the time of execution. The results were compared to prove that the proposed TABU_SFLA was able to outperform all other algorithms that were well-suited for adapting the problem of routing optimization.

show abstract

“…The ad hoc networks as whole poses the certain unique characteristics such as dynamically changing network topologies, decentralization, heterogeneity-when the nodes are not of same type, dispersed operation, mobility and energy constraint [12] causing multiple issues in the process of transmitting information's from one end to the other. Form the above listed characteristics of the adhoc or the fly networks, the mobility and the energy constraint of the nodes serve as the prime characteristics that causes issues related to the transmission in the routing of the information paving way for the link failure or the topology change, thus causing failure in the transmission of the information's, the researches proceeded with the aim of envisioning a routing handling the issues of the mobility and energy usage and succeeded in enhancing the network longevity, improving its performance reducing the energy consumption [13] and handling the mobility issues continuing with the same topology throughout the transmission [17], and the routing algorithms based on the evolutionary and the swarm intelligence provided an even enhanced routing, [18], [19], [20] optimizing the energy and the mobility of the network, preventing the dynamic topology changes to a certain extent and enhancing the performance, reducing the link failures.…”

Section: Introductionmentioning

confidence: 99%

September 2019

2019

JTCSST

View full text Add to dashboard Cite

The autonomous mobile nodes framing an instantaneous network, utilizing the nearby available device that volunteer in establishing network is coined as the fly wire network. These adhoc type of network framed simultaneously are prone to various vulnerabilities, developing alterations in the information's or hacking of information's or the blocking of services. These security threats causing losses in the information transmitted, makes it necessary for the trust evaluation of the nodes to identify the selfish nodes. So the paper proposes the block chain trust management of nodes to avoid the vulnerabilities in the transmission path, enhancing the performance of the network. The performance of the proposed method is validated in the network simulator -II to ensure its capability in terms of the quality of service and the security (defense).

show abstract

Least Mobility High Power (LMHP) Dynamic Routing for QoS Development in Manet

Cited by 7 publications

References 14 publications

Multi-objective Based Route Selection Approach Using AOMDV in MANET

Multi-objective Based Route Selection Approach Using AOMDV in MANET

Hybrid Tabu-Shuffled Frog Leaping Algorithm for Multipath Quality Route Selection Routing In High Mobility Network

September 2019

Contact Info

Product

Resources

About