Routing Algorithm For Communication Research Articles

Application of an improved simulated annealing algorithm in satellite network routing

Abstract Satellite communication is integral to modern communication systems, yet navigating the intricacies of routing in networks characterized by high loads and dynamic evolution poses a significant challenge. This research is dedicated to enhancing satellite communication routing algorithms, with the goal of bolstering network efficiency and amplifying the success rate of business transmissions. Our approach introduces an improved simulated annealing algorithm incorporating adaptive temperature control and innovative path neighborhood exploration strategies. This novel algorithm is adept at adjusting to ever-shifting network topologies and meeting various business requirements. Our simulation results reveal that this refined algorithm outperforms traditional annealing methods in several critical aspects. It elevates the success rate of business transmissions, reduces the average number of forwardings by 6.546% across various load scenarios, and diminishes system response time by 15.05%, thereby marking a substantial improvement in network performance.

A Two‐Level Communication Routing Algorithm Based on Vehicle Attribute Information for Vehicular Ad Hoc Network

Recently, the research on the vehicular ad hoc network (VANET) has been paid more attention by researchers with the quick development of the autonomous driving technology. In the VANET, vehicles can communicate with everything through the route established by routing algorithms. However, the topology of the VANET changes fast because the vehicles move fast. Also, as the number of vehicles increases, the probability of data collision and the transmission latency will also increase when communicating. Therefore, the VANET needs a stable, low‐latency, and efficient route for vehicles to communicate with each other. However, the existing routing algorithms are either unable to aggregate data or are not suitable for the large‐size VANET. In this paper, we consider the vehicle attribute information comprehensively and cluster the vehicles on the road by using the cluster algorithm we propose. We dynamically select the cluster heads at each moment according to their attribute information. We consider all kinds of nodes in the network and the vehicle nodes will communicate with each other through the cluster heads under the two‐level communicating algorithm we propose. Compared with the existing cluster routing algorithm, the algorithm we propose is much more suitable for the large‐size VANET because the cluster heads do not need a gateway to help them communicate. In the simulation part, we set some real street scenes in Simulation of Urban Mobility (SUMO) and the vehicles can move by the traffic rules like in the real world, which is more suitable for the VANET. After analysing the communication performance in Network Simulator version 2 (NS2), we can get a conclusion that the algorithm proposed is superior to the traditional routing algorithm. The route established by the algorithm we propose is much more stable and efficient. And the latency is also lower than the former.

Research on optimization of power line carrier communication routing algorithm for low‐voltage distribution network

<scp>Research</scp> on optimization of power line carrier communication routing algorithm for low‐voltage distribution network

A Review Paper on Different Application of Genetic Algorithm for Mobile Ad-hoc Network (MANET)

A Genetic algorithm is a search algorithm depends on the methodology of natural selection and natural genetics. A Mobile Ad hoc network (MANET) is a type of wireless nodes (Devices) which are free to move anywhere in the network without any constraints. The nodes which are in range can communicate each other through radio waves and those who are not in range use any routing algorithm for communication. In this review paper, we focus on the problems of MANET that has been solved by applying GA for it and highlights the characteristic and challenges of MANET in the literature. More specifically, we present the summary of review papers and basic solutions that use and in the last, we present some future direction. Consequently, we concluded that modification in Fitness function (Evaluation function) according to the problem is the base of Genetic algorithm and variation in algorithm parameters can give solutions in a reasonable time.

Improving of the Drones Group Control System

The article deals with the problem of drone group control, in particular, the problem of formation damage drone ensure safe movement of the group. To solve this problem is proposed to use multi-agent approach to the implementation of the overall strategy of management and metric routing algorithm for communication and the formation of the group. In general, the action of the control algorithms are shown and controlled drones in the formation of groups and roles. The conditions for the safe distance of the drone relative to each other in the group. It is shown that the combined use of these mechanisms can improve the efficiency of group management drone resistance groups to failures and failures, resulting in an increased probability of the assignment.

Packet switching for mobile earth stations via low-orbit satellite network

A potentially valuable implementation of a satellite computer communication packet switched network is one which is survivable and distributed. That is, a system which dynamically adapts to changing network element connectivities, changing interconnections of users, and is not dependent on any central unit for its own internal command and control. A laboratory prototype of such a system has been constructed of a group of computers which when given communication circuits between them will, acting autonomously, create a computer communication packet switching network and which will continually adapt to changes in connectivity. In this paper, an adaptive computer communication routing algorithm is described, its application in space including a space segment design is presented, its actual implementation in real physical hardware is discussed, and system performance results as parameters are varied are presented.