The urban road network is abstracted as a directed graph in this paper, according to the theory of graph theory. It uses depth-first traversal algorithm of graph, and combining with dijkstra shortest path algorithm, f...
详细信息
ISBN:
(纸本)9783037853191
The urban road network is abstracted as a directed graph in this paper, according to the theory of graph theory. It uses depth-first traversal algorithm of graph, and combining with dijkstra shortest path algorithm, futhermore ,these two algorithms are improved, so that, the model of this regional division are built which on city roads for patrol's police Alarm practical speed and distance as the verification conditions, we propose an efficient program for the city police patrol.
In a massive Low Earth Orbit(LEO) satellite network without inter-satellite links(ISLs), connection between source node and destination node can be established through satellite-ground links. Utilizing satellite netwo...
详细信息
ISBN:
(纸本)9781538637784
In a massive Low Earth Orbit(LEO) satellite network without inter-satellite links(ISLs), connection between source node and destination node can be established through satellite-ground links. Utilizing satellite network topology in time virtualization algorithm and assuming that the current traffic of satellite-ground links which is used as the value of the topology correlation matrix can be perceived, the network uses the dijkstra algorithm to obtain the shortest path of the current total network traffic and thus implements load balancing of the constellation system. Due to the large number of satellites, the network topology is complex and time varying, it is difficult to find the optimal path in a short time, so a suboptimal routing algorithm based on network topology is proposed in this paper. The local network topology is obtained by using the positions of the source and destination gateway, and the number of satellites and gateways used to establish the correlation matrix of the dijkstra algorithm is reduced. Through the simulation analysis, the average computational complexity of this algorithm is much lower than that of the global optimal routing algorithm, and the average propagation delay of routing is almost the same. When the network load is normal, the system performance is almost the same with the global optimal routing algorithm.
Purpose The vehicular ad hoc network (VANET) is an emerging area for smart cities as observed in last few decades. However, some hurdles for VANET exist that need to be resolved before its full implementation in smart...
详细信息
Purpose The vehicular ad hoc network (VANET) is an emerging area for smart cities as observed in last few decades. However, some hurdles for VANET exist that need to be resolved before its full implementation in smart cities. Routing is one of the main factors for having effective communication between smart vehicles that urgently needs to be addressed. One factor that affects communication between the vehicles is the intersection points that obstruct the communication. The paper aims to discuss these issues. Design/methodology/approach The conventional routing schemes fail to address the intersection problems that occur during the two points of communication. Therefore, this paper analyses the performance of existing position-based routing protocol for inter-vehicle ad hoc networks, considering the impact of a number of intersections. This simulation evaluates different position-based routing protocols such as Intersection-based Distance and Traffic-Aware Routing (IDTAR), Greedy Traffic-Aware Routing, Anchor-based Street and Traffic-Aware Routing and Geographic Source Routing, based on road topology and the number of intersections. Findings As a result, the protocol IDTAR has a lower end-to-end delay and high packet delivery ratio in terms of the number of intersections as a case study of smart cities. This concludes that IDTAR can be adaptive to smart cities communication, although some questions need to be considered in terms of its security, compatibility, reliability and robustness. Practical implications The role of VANET has been highlighted in smart cities due to its implications in day-to-day life. The vehicles in VANET are equipped with wireless communication nodes to provide network connectivity. Such types of network operate without the legacy infrastructure, as well as legacy client/servers. Originality/value Additionally, the study contributes to smart cities by measuring the performance of position-based routing protocols for VANETs.
In order to solve the problem caused by any fault in locating equipment, start-up failure and time record error of location failure on the traditional both-terminal traveling waves location on power line fault, the in...
详细信息
ISBN:
(纸本)9781467360654;9781467360630
In order to solve the problem caused by any fault in locating equipment, start-up failure and time record error of location failure on the traditional both-terminal traveling waves location on power line fault, the information fusion and Floyd algorithm have been proposed. But these algorithms have some shortages which include long time complexity and need undo network and the weight matrix cannot automatically generate etc. On the basis, this paper proposed a novel algorithm network-based dijkstra algorithm for fault location with traveling wave. The established PDR matrix can be used as basis of information fusion processing and the different matching combination of the traveling wave positioning device of each observation point, to find out the practical fault point. Simulation results show that the algorithm has a high precision and robustness for locating the power transmission line faults and the location error is less than 100m and has a good fault-tolerance.
In this article, we present the application of Graph Theory in the development of an algorithm of path planning for mobile robots. The proposed system evaluates a RRT algorithm based on the individual cost of nodes an...
详细信息
ISBN:
(纸本)9783030026981;9783030026974
In this article, we present the application of Graph Theory in the development of an algorithm of path planning for mobile robots. The proposed system evaluates a RRT algorithm based on the individual cost of nodes and the optimized reconnection of the final path based on dijkstra and Floyd criteria. Our proposal includes the comparisons between different RRT* algorithms and the simulation of the environments in different platforms. The results identify that these criteria must be considered in all the variations of RRT to achieve a definitive algorithm in mobile robotics.
As the basic theory of shortest path calculation, dijkstra algorithm is widely used in various aspects, such as: transportation, construction of signal station, laying of high-speed rail. Based on graph theory, this p...
详细信息
As the basic theory of shortest path calculation, dijkstra algorithm is widely used in various aspects, such as: transportation, construction of signal station, laying of high-speed rail. Based on graph theory, this paper studies dijkstra algorithm to analyze network communication problems, introduces the principle of dijkstra algorithm in detail, and makes a contribution to the research of shortest path.
Wireless sensor network (WSN) turns out to be a vital innovation identified with systems as well as it is by and large broadly connected and received in the present day control and checking functions. In any case, pro...
详细信息
ISBN:
(纸本)9789811055447;9789811055430
Wireless sensor network (WSN) turns out to be a vital innovation identified with systems as well as it is by and large broadly connected and received in the present day control and checking functions. In any case, problems with respect to vitality proficiency create huge worries during the time spent in remote sensor system. For problems concerning vitality, power efficient adaptive clustering hierarchy (PEACH) tradition has been suggested essentially for WSNs so as to criticize vitality use of hubs and expanding life range of the system. The hubs in the remote sensor system structure as a gathering. The most noteworthy vitality hub in the gathering has been chosen as a bunch head. The bunch head determination has a few criteria in choosing: (1) based on the vitality levels of sensors in group (i.e., the hub with higher vitality would be chosen as a bunch head). (2) based on hub degree (total number of hubs associated with it) (i. e., the hub with advanced hub degree would be chosen as a bunch head). The time differential of arrival (TDA) has been proposed for vitality consumption of sensor hubs in the system. TDA decreases the vitality utilization of hubs and expanding the system life duration. The node connectivity algorithm (NCA) has been proposed to discover the availability with neighbor's hub in the remote sensor system. The bunch head confirms the gathering hubs and transfers the confirmation data to server. On the off chance that any noxious hub available in the system, the server would recognize through self-mending key appropriation procedure and the bunch head would shut the hub and toss out the hub from the bunch. The noxious hub assets would be stored into the server. It will make the system more ensured and safe one. To broadcast the parcels from resource to goal, figure the most limited way with the assistance of dijkstra algorithm. The bundle encodes at source and unscrambled once it gets to the goal by means of Advanced Encryption Standard (AES) enc
In most European countries, websites are available with route planners and real time information about incidents and expected delay on the highways. These websites enable car drivers to plan their route from start to ...
详细信息
ISBN:
(纸本)9781450364256
In most European countries, websites are available with route planners and real time information about incidents and expected delay on the highways. These websites enable car drivers to plan their route from start to destination. On their way, they can use route planners on their smart phone or oilier devices. Recent route planners take care of incidents on the roads. However, none of these planners takes care of the future. In this paper, we present a route planner integrating information from experts in the traffic centers and a route planner based on a dynamic version of the dijkstra algorithm.
This paper aims to deliver movement of the robot by finding and traversing the shortest path in the static present grid, using source and destination positions entered by the user. The robot currently requires a grid ...
详细信息
ISBN:
(数字)9781728119243
ISBN:
(纸本)9781728119250
This paper aims to deliver movement of the robot by finding and traversing the shortest path in the static present grid, using source and destination positions entered by the user. The robot currently requires a grid since it traverses space using line-tracing. Further addition to the functioning - the robot avoids static obstacles which might be present in its path towards destination. A microcontroller (AtMega2560) was used as an interface between the hardware and our software program. The robot used was Firebird V. For line-tracing, infrared LEDs (transmitters) and photodiodes (receivers) present on the robot were used. The popular dijkstra's algorithm had been incorporated in our shortest-path follower code. The language used for programming is AVR.
Proper planning of the commercial vehicle supply chain is conducive to improving work efficiency and reducing transportation *** this paper,the dijkstra algorithm is used to solve the neighboring weight matrix between...
详细信息
Proper planning of the commercial vehicle supply chain is conducive to improving work efficiency and reducing transportation *** this paper,the dijkstra algorithm is used to solve the neighboring weight matrix between different *** 0-1 planning model is established by distance,fixed cost and demand,and the optimal total cost scheme is calculated by genetic *** simulated annealing algorithm is used to solve the problem of minimum road damage in the case of a certain increase in total cost,which is convenient for the transportation company to make rational adjustments of the commercial vehicle supply chain network.
暂无评论