This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to del...This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.展开更多
Sensor networks can consist of large number of sensors. Often, sensors networks use low cost units and thus a subject to malfunctions that can bring the system to inconsistent states. After deployment, the system can ...Sensor networks can consist of large number of sensors. Often, sensors networks use low cost units and thus a subject to malfunctions that can bring the system to inconsistent states. After deployment, the system can be situated in places that are hard to reach and therefore manual reboot operations are undesirable and even unfeasible. Therefore, it is imperative to consider the eventual recovery of arbitrary fault when designing sensor networks. Dijkstra’s algorithm is an important foundation of self-managing computer system and fault-tolerance computing system in distributed systems, since it allows a distributed system to recover from arbitrary starting state within a finite time. The arbitrary starting state ca model arbitrary failure (as long as the code segment stays correct).Another key advantage of Dijkstra’s asynchronous algorithm is that no global clock is needed. This project tests an implementation of Dijkstra’s algorithm using snapshotting techniques that we developed in an earlier work. These sensors can initiate from any state but they come into a consistent one after several cycles of running. We demonstrate the usefulness of our testing technique.展开更多
In recent years, Japan, and especially rural areas have faced the growing problems of debt-ridden local railway lines along with the population decline and aging population. Therefore, it is best to consider the disco...In recent years, Japan, and especially rural areas have faced the growing problems of debt-ridden local railway lines along with the population decline and aging population. Therefore, it is best to consider the discontinuation of local railway lines and introduce replacement buses to secure the transportation methods of the local people especially in rural areas. Based on the above background, targeting local railway lines that may be discontinued in the near future, appropriate bus stops when provided with potential bus stops were selected, the present study proposed a method that introduces routes for railway replacement buses adopting ant colony optimization (ACO). The improved ACO was designed and developed based on the requirements set concerning the route length, number of turns, road width, accessibility of railway lines and zones without bus stops as well as the constraint conditions concerning the route length, number of turns and zones without bus stops. Original road network data were generated and processed adopting a geographic information systems (GIS), and these are used to search for the optimal route for railway replacement buses adopting the improved ACO concerning the 8 zones on the target railway line (JR Kakogawa line). By comparing the improved ACO with Dijkstra’s algorithm, its relevance was verified and areas needing further improvements were revealed.展开更多
We propose a high-performance path planning algorithm for automatic target tracking in the applications of real-time simulation and visualization of large-scale terrain datasets, with a large number of moving objects ...We propose a high-performance path planning algorithm for automatic target tracking in the applications of real-time simulation and visualization of large-scale terrain datasets, with a large number of moving objects （such as vehicles） tracking multiple moving targets. By using a modified Dijkstra＇s algorithm, an optimal path between each vehicle-target pair over a weighted grid-presented terrain is computed and updated to eliminate the problem of local minima and losing of tracking. Then, a dynamic path re-planning strategy using multi-resolution representation of a dynamic updating region is proposed to achieve high-performance by trading-off precision for efficiency, while guaranteeing accuracy. Primary experimental results showed that our algorithm successfully achieved l0 to 96 frames per second interactive path-replanning rates during a terrain simulation scenario with 10 to 100 vehicles and multiple moving targets.展开更多
Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two point...Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily travel.Taking Heze Railway Station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target area.With Dijkstra as theoretical basis of shortest path algorithm,we use ArcG IS network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.展开更多
In the shipbuilding industry,market competition is currently operating in an intense state.To be able to strive in the global market,the shipbuilders must able to produce ships that are more efficient and can be const...In the shipbuilding industry,market competition is currently operating in an intense state.To be able to strive in the global market,the shipbuilders must able to produce ships that are more efficient and can be constructed in a relatively short amount of time.The piping layouts in the engine room requires a lot of time for the designer to design the best possible route and in a way are not the most efficient route.This paper presents an automatic piping support system in the ship’s engine room based on the Dijkstra’s algorithm of pathfinding method.The proposed method is focused on finding the shortest possible route with a consideration of the following things:cost of the bend pipe,cost of the crossing pipe,cost reduction by pipe support,restriction on piping,reduction of calculation time,and design procedure of piping route.Dijkstra’s shortest path algorithm is adopted to find the shortest path route between the start and goal point that is determined based on the layout of the ship’s engine room.Genetic algorithm is adopted to decide the sequence of the pipe execution.The details of the proposed method are explained in this paper.This paper also discusses the application of the proposed method on an actual ship and evaluates its effectiveness.展开更多
Network planning, analysis and design are an iterative process aimed at ensuring that a new network service meets the needs of subscribers and operators. During the initial start-up phase, coverage is the big issue an...Network planning, analysis and design are an iterative process aimed at ensuring that a new network service meets the needs of subscribers and operators. During the initial start-up phase, coverage is the big issue and coverage in telecommunications systems is related to the service area where a bare minimum access in the wireless network is possible. In order to guarantee visibility of at least one satellite above a certain satellite elevation, more satellites are required in the constellation to provide Global network services. Hence, the aim of this paper is to develop wide area network coverage for sparsely distributed earth stations in the world. A hybrid geometrical topology model using spherical coordinate framework was devised to provide wide area network coverage for sparsely distributed earth stations in the world. This topology model ensures Global satellite continuous network coverage for terrestrial networks. A computation of path lengths between any two satellites put in place to provide network services to selected cities in the world was carried out. A consideration of a suitable routing decision mechanism, routing protocols and algorithms were considered in the work while the shortest paths as well as the alternate paths between located nodes were computed. It was observed that a particular satellite with the central angle of 27°can provide services into the diameter of the instantaneous coverage distance of 4081.3 Km which is typical of wide area network coverage. This implies that link-state database routing scheme can be applied, continuous global geographical coverage with minimum span, minimum traffic pattern and latency are guaranteed. Traffic handover rerouting strategies need further research. Also, traffic engineering resources such as channel capacity and bandwidth utilization schemes need to be investigated. Satellite ATM network architecture will benefit and needs further study.展开更多
基金supported by Northern Border University,Arar,Kingdom of Saudi Arabia,through the Project Number“NBU-FFR-2024-2248-03”.
文摘This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.
文摘Sensor networks can consist of large number of sensors. Often, sensors networks use low cost units and thus a subject to malfunctions that can bring the system to inconsistent states. After deployment, the system can be situated in places that are hard to reach and therefore manual reboot operations are undesirable and even unfeasible. Therefore, it is imperative to consider the eventual recovery of arbitrary fault when designing sensor networks. Dijkstra’s algorithm is an important foundation of self-managing computer system and fault-tolerance computing system in distributed systems, since it allows a distributed system to recover from arbitrary starting state within a finite time. The arbitrary starting state ca model arbitrary failure (as long as the code segment stays correct).Another key advantage of Dijkstra’s asynchronous algorithm is that no global clock is needed. This project tests an implementation of Dijkstra’s algorithm using snapshotting techniques that we developed in an earlier work. These sensors can initiate from any state but they come into a consistent one after several cycles of running. We demonstrate the usefulness of our testing technique.
文摘In recent years, Japan, and especially rural areas have faced the growing problems of debt-ridden local railway lines along with the population decline and aging population. Therefore, it is best to consider the discontinuation of local railway lines and introduce replacement buses to secure the transportation methods of the local people especially in rural areas. Based on the above background, targeting local railway lines that may be discontinued in the near future, appropriate bus stops when provided with potential bus stops were selected, the present study proposed a method that introduces routes for railway replacement buses adopting ant colony optimization (ACO). The improved ACO was designed and developed based on the requirements set concerning the route length, number of turns, road width, accessibility of railway lines and zones without bus stops as well as the constraint conditions concerning the route length, number of turns and zones without bus stops. Original road network data were generated and processed adopting a geographic information systems (GIS), and these are used to search for the optimal route for railway replacement buses adopting the improved ACO concerning the 8 zones on the target railway line (JR Kakogawa line). By comparing the improved ACO with Dijkstra’s algorithm, its relevance was verified and areas needing further improvements were revealed.
基金Project partially supported by NSF (No. CCR0306438) and theBoeing Company, USA
文摘We propose a high-performance path planning algorithm for automatic target tracking in the applications of real-time simulation and visualization of large-scale terrain datasets, with a large number of moving objects （such as vehicles） tracking multiple moving targets. By using a modified Dijkstra＇s algorithm, an optimal path between each vehicle-target pair over a weighted grid-presented terrain is computed and updated to eliminate the problem of local minima and losing of tracking. Then, a dynamic path re-planning strategy using multi-resolution representation of a dynamic updating region is proposed to achieve high-performance by trading-off precision for efficiency, while guaranteeing accuracy. Primary experimental results showed that our algorithm successfully achieved l0 to 96 frames per second interactive path-replanning rates during a terrain simulation scenario with 10 to 100 vehicles and multiple moving targets.
基金Supported by Science Foundation of Heze University(XY14SK14)
文摘Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily travel.Taking Heze Railway Station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target area.With Dijkstra as theoretical basis of shortest path algorithm,we use ArcG IS network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.
基金supported the Directorate of Research and Community Engagement,Universitas Indonesia,and scheme of Research Collaboration,contract number:NKB-1954/UN2.R3.1/HKP.05.00/2019.
文摘In the shipbuilding industry,market competition is currently operating in an intense state.To be able to strive in the global market,the shipbuilders must able to produce ships that are more efficient and can be constructed in a relatively short amount of time.The piping layouts in the engine room requires a lot of time for the designer to design the best possible route and in a way are not the most efficient route.This paper presents an automatic piping support system in the ship’s engine room based on the Dijkstra’s algorithm of pathfinding method.The proposed method is focused on finding the shortest possible route with a consideration of the following things:cost of the bend pipe,cost of the crossing pipe,cost reduction by pipe support,restriction on piping,reduction of calculation time,and design procedure of piping route.Dijkstra’s shortest path algorithm is adopted to find the shortest path route between the start and goal point that is determined based on the layout of the ship’s engine room.Genetic algorithm is adopted to decide the sequence of the pipe execution.The details of the proposed method are explained in this paper.This paper also discusses the application of the proposed method on an actual ship and evaluates its effectiveness.
文摘Network planning, analysis and design are an iterative process aimed at ensuring that a new network service meets the needs of subscribers and operators. During the initial start-up phase, coverage is the big issue and coverage in telecommunications systems is related to the service area where a bare minimum access in the wireless network is possible. In order to guarantee visibility of at least one satellite above a certain satellite elevation, more satellites are required in the constellation to provide Global network services. Hence, the aim of this paper is to develop wide area network coverage for sparsely distributed earth stations in the world. A hybrid geometrical topology model using spherical coordinate framework was devised to provide wide area network coverage for sparsely distributed earth stations in the world. This topology model ensures Global satellite continuous network coverage for terrestrial networks. A computation of path lengths between any two satellites put in place to provide network services to selected cities in the world was carried out. A consideration of a suitable routing decision mechanism, routing protocols and algorithms were considered in the work while the shortest paths as well as the alternate paths between located nodes were computed. It was observed that a particular satellite with the central angle of 27°can provide services into the diameter of the instantaneous coverage distance of 4081.3 Km which is typical of wide area network coverage. This implies that link-state database routing scheme can be applied, continuous global geographical coverage with minimum span, minimum traffic pattern and latency are guaranteed. Traffic handover rerouting strategies need further research. Also, traffic engineering resources such as channel capacity and bandwidth utilization schemes need to be investigated. Satellite ATM network architecture will benefit and needs further study.
