A Modified Simulated Annealing Algorithm Based on Principle of the Greedy Algorithm for Networks with Mobile Nodes
- Resource Type
- Conference
- Authors
- Pyrih, Yuliia; Kaidan, Mykola; Strykhalyuk, Bohdan; Zhebka, Viktoriia
- Source
- 2020 IEEE 15th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET) Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET), 2020 IEEE 15th International Conference on. :482-485 Feb, 2020
- Subject
- Bioengineering
Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Computing and Processing
Fields, Waves and Electromagnetics
Photonics and Electrooptics
Signal Processing and Analysis
Greedy algorithms
Scalability
Simulation
Simulated annealing
Quality of service
Routing
Market research
simulated annealing algorithm
route
QoS
mobile nodes.
- Language
A modified simulated annealing algorithm is presented to improve data routing efficiency on mobile nodes, the feature of which is the use of the greedy choice principle to determine data route with the best value of the QoS parameter by deleting / adding nodes in it. To determine the effectiveness of the modified algorithm when creating a data transmission route between the nodes of the network used the concept of relative failure rate of the route. It is shown that the proposed algorithm provides more successful routing at network scalability than the greedy routing algorithm.