Graph theory has around 300 years of history,but many problems haven't been solvedWith the development of computer science,graph theory becomes hot point againIn this paper,the application of graph theory is discussed

On Graph Theory and Its Application

Vehicle to Vehicle (V2V) communication offers great potential as far as information dissemination in VANETs is concerned. Research has shown that clustering vehicles and relaying information through cluster-heads (CHs) has several advantages over allowing all the vehicles to broadcast the information. Forming and maintaining stable clusters as well as ensuring good QoS in intra-cluster communications has always been a great challenge. In this paper we present a VANET Cluster-onDemand (CoD) Minimum Spanning Tree (MST) Prim algorithm which clusters vehicles taking into consideration the intra-cluster QoS. Matlab simulation results of the algorithm applied to real traffic data has shown the algorithm’s ability to successfully form clusters with good QoS. The algorithm has also been shown to compare very well with Dijkstra’s algorithm which is one of the best clustering algorithms. Keywords-Dijkstra’s algorithm, Minimum spanning tree (MST), Prim algorithm, Vehicular ad hoc networks (VANETs)

VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim clustering algorithm

Multimedia applications are expected to guarantee end-to-end quality of service QoS and are characterized by stringent constraints on delay, delay-jitter, bandwidth, cost, and so forth. The authors observe that Kruskal's algorithm is limited to minimal maximal spanning unconstrained tree. As such, the authors extend Kruskal's algorithm to incorporate the delay bound constraint. Consequently, a novel algorithm is proposed, called EKRUS Extended Kruskal, for constructing multicast trees. The EKRUS' distinguishing features consists of a better management of Kruskal's priority queues, and in the provision of edge priority aggregation. Preliminary results show that the proposed EKRUS algorithm performs as well as the best-known algorithms such as the DDMC, DMCTc algorithms while exhibiting reduced complexity. The authors conducted an intensive analysis and evaluations of different strategies of assigning edges into the classes of the queue as well as edge selection. As a result, the EKRUS algorithm was further extended with different edge assignment and selection strategies. Through extensive simulations, the authors have evaluated various versions of the EKRUS and analyzed their performance under different load conditions.

New Strategies and Extensions in Kruskal's Algorithm in Multicast Routing

With the advancement of urbanization in China, urban blocks have higher and higher requirements for landscape, and the power supply mode of overhead lines is gradually being replaced by cable power supply. Compared with the distribution network planning of overhead line power supply, most of them only need to consider the spatial layout of the load. The distribution network planning of cable power supply should consider the urban geographic information, and the cables should generally be arranged along the streets, not only considering the spatial layout of the load, but also considering the impact of the intersection of urban streets on the network planning. This paper presents a method of urban distribution network planning considering geographic information based on improved prim genetic hybrid algorithm. The improved prim algorithm and improved genetic algorithm are used to plan the network of urban distribution network including street intersections. Firstly, the adjacency matrix between nodes in the area to be planned is established. Secondly, the improved prim algorithm is used to generate a certain number of population size, and the network planning model of urban distribution network is established. Finally, the improved genetic algorithm is used to solve the distribution network model, and the urban distribution network planning scheme considering geographic information is obtained. 

Urban Distribution Network Planning Method Considering Geographic Information based on Improved Prim Genetic Hybrid Algorithm

With the advancement of urbanization in China, urban blocks have higher and higher requirements for landscape, and the power supply mode of overhead lines is gradually being replaced by cable power supply. Compared with the distribution network planning of overhead line power supply, most of them only need to consider the spatial layout of the load. The distribution network planning of cable power supply should consider the urban geographic information, and the cables should generally be arranged along the streets, not only considering the spatial layout of the load, but also considering the impact of the intersection of urban streets on the network planning. This paper presents a method of urban distribution network planning considering geographic information based on improved prim genetic hybrid algorithm. The improved prim algorithm and improved genetic algorithm are used to plan the network of urban distribution network including street intersections. Firstly, the adjacency matrix between nodes in the area to be planned is established. Secondly, the improved prim algorithm is used to generate a certain number of population size, and the network planning model of urban distribution network is established. Finally, the improved genetic algorithm is used to solve the distribution network model, and the urban distribution network planning scheme considering geographic information is obtained.

In order to improve the efficiency of the communication networks, we used the Kruskal algorithm and the Prim algorithm through algorithm comparison and analysis methods of data structure. A dynamic framework for the communication network installed system is built. Moreover, according to the actual framework of the communication network specific issues, the module chooses the Minimum Cost Spanning Tree Prim algorithm ultimately. The assumptions process and outcomes simulation have proper analysis and certification by C language. Experimental results show that the Minimum Cost Spanning Tree of Prim algorithm on the installed system for communication networks dynamic planning process have the advantage of speed and effectively reduce the waste of resources, which not only can ensure efficiency but also can effectively improve communication networks installed cost.

Chenghui Yang

Papers

Simulation Research of Communication Networks Based on Prim Algorithm