A Route Discovery of Dynamic Wireless Network Using Particle Swarm Optimization

Aini, Qurrotul

doi:10.12720/jcm.14.5.368-374

Cited by 5 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A lot of work has also been performed in the field of security using PSO based approach. It is helpful to find out threats and vulnerability of the network [17]. It is also possible to deal with security aspect like intrusion detection and management of security of key using pso.…”

Section: Related Workmentioning

confidence: 99%

Cost Optimization Approach for MANET using Particle Swarm Optimization

Polara,

Rathod

2023

IJRITCC

View full text Add to dashboard Cite

This paper present the approach require to increase the QoS of MANET network using particle swarm optimization algorithm. To improve data communication between two nodes we propose an efficient algorithm for AODV protocol using PSO where instead of suppling all default parameter with default value of AODV protocol we try to provide selective parameters with optimum value so that overall requirement of control packet get decrease that in turn result in to increase quality of service parameters of MANET. For the enhancement of reliability and reduction of cost, node speed control mechanism is implemented using PSO, The given method which is use for simulation, reduces the overall loss of data and also make transmission effective. We have also tested the performance of network by changing data rates and the speed of the node.

show abstract

Section: Related Workmentioning

confidence: 99%

Cost Optimization Approach for MANET using Particle Swarm Optimization

Polara,

Rathod

2023

IJRITCC

View full text Add to dashboard Cite

show abstract

Distributed wireless network resource optimisation method based on mobile edge computing

Jiang¹,

Quan²,

Qian³

et al. 2022

IET Networks

View full text Add to dashboard Cite

For caching and forwarding problems in mobile networks, a new method of caching and forwarding in mobile networks based on boundary computing is proposed. Using Problem Optimisation to Transform Joint Optimal Problems into Linear Programming Problems and online algorithms, such as real‐time caching and forwarding, are designed. The network ranking leader, consumption amount, and network signal reception of the three algorithms are compared. The study found that in terms of network sort captain, there are significant differences between the CPLEX algorithm, the cell clustering for spatial transcriptomics (CCST) algorithm, and edge computing methods. The CCST algorithm and edge computing have little difference in queue length with small queue length and low latency. However, the CPLEX algorithm has a long queue, resulting in high latency. In terms of amount spent, at the beginning, the edge computing method requires more costly than the linear programming method. But as the beta value increases, so does its amount spent. Although the amount spent of the CPLEX algorithm is low, it is not accepted by users in terms of network delay. In terms of the network signal reception, the edge computing method is 18.3% higher than the linear programming method, and the network signal reception of the CPLEX algorithm is low. Under the premise of higher network signal reception and smaller queue length, higher delivery costs can be achieved and can be adjusted by the size. It can make the consumption amount and the network congestion level to be satisfied.

show abstract