An efficient clustering approach for optimized path selection and route maintenance in mobile ad hoc networks

Vatambeti, Ramesh; Sanshi, Shridhar; Krishna, D. Pramodh

doi:10.1007/s12652-021-03298-3

Cited by 16 publications

(9 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This network cycle is typically affected by the period at which a sizeable fraction of the network's sensor nodes dies due to the problem of energy exhaustion [1,2]. Because of its centrality in maintaining network viability and reducing communication interference [3]. Clustering mechanisms, which provide inspiration for the characteristics of hierarchical topology control algorithms, are deemed important and often employed in this setting.…”

Section: Introductionmentioning

confidence: 99%

Minimizing the Energy Consumption and Exploiting the NLT by E2HCA Model in WSN

Saritha,

Reddy

2024

JAIT

View full text Add to dashboard Cite

In recent years, Wireless Sensor Network (WSN) has arisen as a practical option for many sectors needing smart technology. Despite its impressive credentials, Wireless Sensor Networks' excessive need for power remains a significant limitation. There is a pressing need to create a trustworthy Wireless Sensor Network with efficient energy and network lifetime due to the proliferation of tiny sensors with incomplete resources. One of the actual ways to deal with these matters is to divide the nodes into clusters. So, it is crucial to use existing energy efficiently to prevent energy waste. In this study, we suggest an Energy-Efficient Hybrid Clustering Algorithm to reduce the high-energy ingesting and increase the network lifetime of Wireless Sensor Networks. The position and speed of a gas molecule, among other Kinetic Gas Molecule Optimization particle characteristics, are initially determined by calculating their kinetic energy. Hybridization of Kinetic Gas Molecule Optimization arises from Kinetic Gas Molecule Optimization's faster convergence in space. Pelican Optimization Algorithm is used to fix the problems with Kinetic Gas Molecule Optimization by changing its inertia weight. Throughput the number of live/dead nodes are all validated against other prominent meta-heuristic methodologies in a MATLAB environment simulation of the proposed Kinetic Gas Molecule Optimization-Pelican Optimization Algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

Minimizing the Energy Consumption and Exploiting the NLT by E2HCA Model in WSN

Saritha,

Reddy

2024

JAIT

View full text Add to dashboard Cite

show abstract

“…In order to avoid tampering with and replaying of routing data transmission, security-based routing systems use a variety of encryption methods [7]. There are a number of different security routing methods [8,9], including the most fundamental routing. In order for routers in a network to regulate the best path to take between any two points in the system, they need to be able to interconnect and share relevant information [10].…”

Section: Introductionmentioning

confidence: 99%

An Energy-Aware Cluster Head Selection and Optimal Route Selection Algorithm for Maximizing Network Lifetime in MANETs

Devarayasamudram,

Chandrashekar,

Chetla

et al. 2024

MMEP

View full text Add to dashboard Cite

Quality of Service (QoS) is a crucial aspect of Mobile Ad Hoc Networks (MANET) that needs examination to demonstrate optimal performance. The scientific community is increasingly concerned with the challenge of developing an energy-aware clustering method for MANETs. This is owing to the fact that the battery-operated sensor devices that form the backbone of these wireless networks cannot be recharged. The selection of a cluster's leader is a difficult problem in MANET. Additionally, the research focuses on Optimal Route Selection (ORS) within the MANET context, acknowledging the significance of establishing efficient communication paths between cluster heads and member nodes. Through the integration of a reliability pair factor and node energy considerations, the proposed ORS algorithm generates optimal paths based on maximizing energy efficiency while minimizing the sum of hops between nodes. The study suggests a new algorithm based on the way waterwheel plants move and change their places as they explore and exploit new territory in the quest for food. The suggested method is named Binary Waterwheel Plant Algorithm (BWPA). In this method, a novel model is used to represent both the binary search space and the mapping from continuous to discrete spaces. Particularly, mathematical models of the fitness and cost functions used by the algorithm are constructed. Through the use of a reliability pair factor and node energy, the proposed research paper on Optimal Route Selection (ORS) generates the optimal path between the cluster head and member node and establishes the path based on the maximum energy and sum of hops among the nodes. By fusing the reactive power of differential evolution with the exhaustive search efficiency of the BWPA, the proposed method extends the life of networks. The recommended method increases node lifetime by compounding the dynamic capabilities of discrepancy evolution with the high effectiveness of search.

show abstract

“…In recent years, mobile communication networks (MCN), such as satellite communication networks [1], cellular networks [2] and mobile ad hoc networks (MANET) [3], have become a part of our daily lives. In such a network, how to find an efficient path becomes a challenging prob-lem.…”

Section: Introductionmentioning

confidence: 99%

Delay bounded routing with the maximum belief degree for dynamic uncertain networks

Ji,

Rui,

Ruiying

et al. 2024

J. of Syst. Eng. Electron.

View full text Add to dashboard Cite

Delay aware routing is now widely used to provide efficient network transmission. However, for newly developing or developed mobile communication networks (MCN), only limited delay data can be obtained. In such a network, the delay is with epistemic uncertainty, which makes the traditional routing scheme based on deterministic theory or probability theory not applicable. Motivated by this problem, the MCN with epistemic uncertainty is first summarized as a dynamic uncertain network based on uncertainty theory, which is widely applied to model epistemic uncertainties. Then by modeling the uncertain end-toend delay, a new delay bounded routing scheme is proposed to find the path with the maximum belief degree that satisfies the delay threshold for the dynamic uncertain network. Finally, a low-Earth-orbit satellite communication network (LEO-SCN) is used as a case to verify the effectiveness of our routing scheme. It is first modeled as a dynamic uncertain network, and then the delay bounded paths with the maximum belief degree are computed and compared under different delay thresholds.

show abstract

An efficient clustering approach for optimized path selection and route maintenance in mobile ad hoc networks

Cited by 16 publications

References 32 publications

Minimizing the Energy Consumption and Exploiting the NLT by E2HCA Model in WSN

Minimizing the Energy Consumption and Exploiting the NLT by E2HCA Model in WSN

An Energy-Aware Cluster Head Selection and Optimal Route Selection Algorithm for Maximizing Network Lifetime in MANETs

Delay bounded routing with the maximum belief degree for dynamic uncertain networks

Contact Info

Product

Resources

About