• Title/Summary/Keyword: Detour Path

Search Result 38, Processing Time 0.032 seconds

Energy-Efficient Grid-based Hole-Detouring Scheme in Wireless Sensor Networks (무선센서네트워크에서 에너지 효율적인 그리드 기반의 홀 우회 방식)

  • Kim, Sung-Hwi;Park, Ho-Sung;Lee, Jeong-Cheol;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.4B
    • /
    • pp.227-235
    • /
    • 2012
  • Holes that generated by the unpredictable and harsh nature application environment or uneven energy consumption are an inevitable phenomenon in wireless sensor networks. Most of the existing schemes for this hole problem tend to use a static detour path to bypass a hole. The static detour path may lead to uneven energy consumption of the nodes on the boundary of the hole, thus it may enlarge the region of holes. At the same time, traffic would concentrate on the nodes on the boundary of the hole and tend to be depleted quickly. To solve this problem, we introduce energy-efficient grid-based geographic routing and hole-detouring scheme by taking advantage of grid anchor point in wireless sensor network with holes. The location of hole detour anchor node is dynamically shifted in grid cell. just generating dynamic hole detour paths to reduce total energy consumption. Simulation results are provided to validate the claims.

A New Dynamic Routing Algorithm for Multiple AGV Systems : Nonstop Preferential Detour Algorithm (다중무인운반차 시스템의 새로운 동적경로계획 알고리즘 : 비정지우선 우회 알고리즘)

  • Sin, Seong-Yeong;Jo, Gwang-Hyeon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.9
    • /
    • pp.795-802
    • /
    • 2002
  • We present a new dynamic routing scheme for multiple autonomous guided vehicles (AGVs) systems. There have been so many results concerned with scheduling and routing of multiple AGV systems; however, most of them are only applicable to systems with a small number of AGVs under a low degree of concurrency. With an increased number of AGVs in recent applications, these AGV systems are faced with another problem that has never been occurred in a system with a small number AGVs. This is the stop propagation problem. That is, if a leading AGV stops then all the following AGVs must stop to avoid any collision. In order to resolve this problem, we propose a nonstop preferential detour (NPD) algorithm which is a new dynamic routing scheme employing an election algorithm. For real time computation, we introduce two stage control scheme and propose a new path searching scheme, k-via shortest path scheme for an efficient dynamic routing algorithm. Finally, the proposed new dynamic routing scheme is illustrated by an example.

A Real-time Point-to-Point Shortest Path Search Algorithm Based on Traveling Time (주행시간 기반 실시간 점대점 최단경로 탐색 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.131-140
    • /
    • 2012
  • The shortest path search algorithm of navigation is generally based on Dijkstra algorithm and considers only the distance using the weight. Dijkstra algorithm based on the distance mainly ought to perform the 'number of nodes 1' and requires a lot of memory, for it is to start from the starting node and to decide the shortest path for all the nodes. Also, it searches only the same identical path in case of any bottleneck due to an accident nearby, since it is based only on the distance, and hence does not have a system that searches the detour road. In order to solve this problem, this paper considers only the travelling time per road (travelling speed * distance), without applying speed criteria (smoothness, slow speed, stagnation and accident control) or road class (express road, national road and provincial road). This provides an advantage of searching the detour, considering the reality that there are differences in time take for the car to travel on different roads with same distance, due to any accident, stagnation, or repair construction. The suggested algorithm proves that it can help us to reach the destination within the shortest time, making a detour from any congested road (outbreak) on providing an information on traveling time continuously(real-time) even though there is an accident in a particular road.

A Study on a new Algorithm for K Shortest Paths Problem (복수 최단 경로의 새로운 해법에 관한 연구)

  • Chang, Byung-Man
    • Korean Management Science Review
    • /
    • v.25 no.2
    • /
    • pp.81-88
    • /
    • 2008
  • This paper presents a new algorithm for the K shortest paths problem in a network. After a shortest path is produced with Dijkstra algorithm. detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set. this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated until the $K^{th}-1$ path of the set is obtained. The computational results for networks with about 1,000,000 nodes and 2,700,000 arcs show that this algorithm can be applied to a problem of generating the detouring paths in the metropolitan traffic networks.

A Path & Velocity Profile Planning Based on A* Algorithm for Dynamic Environment (동적 환경을 위한 A* 알고리즘 기반의 경로 및 속도 프로파일 설계)

  • Kwon, Min-Hyeok;Kang, Yeon-Sik;Kim, Chang-Hwan;Park, Gwi-Tae
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.5
    • /
    • pp.405-411
    • /
    • 2011
  • This paper presents a hierarchical trajectory planning method which can handle a collision-free of the planned path in complex and dynamic environments. A PV (Path & Velocity profile) planning method minimizes a sharp change of orientation and waiting time to avoid a collision with moving obstacle through detour path. The path generation problem is solved by three steps. In the first step, a smooth global path is generated using $A^*$ algorithm. The second step sets up the velocity profile for the optimization problem considering the maximum velocity and acceleration. In the third step, the velocity profile for obtaining the shortest path is optimized using the fuzzy and genetic algorithm. To show the validity and effectiveness of the proposed method, realistic simulations are performed.

A Collision Avoidance Algorithm for Two Mobile Robots with Independent Goals in Skeleton Map (골격지도에서 개별 목표를 갖는 두 이동로봇의 충돌 회피 알고리즘)

  • Yang Dong-Hoon;Hong Suk-Kyo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.7
    • /
    • pp.700-705
    • /
    • 2006
  • This paper proposes a collision avoidance algorithm for two mobile robots with independent goals in a same workspace. Using skeleton map, an environment is presented as a graph consisting of nodes and arcs. Robots generate the shortest set of paths using the combination of objective functions of the two robots. Path for collision avoidance of a robot can be selected among three class; the shortest path, detour, paths with a waiting time at safety points around crossing points. Simulation results are presented to verify the efficiency of the proposed algorithms.

Multihop Range-Free Localization with Virtual Hole Construction in Anisotropic Sensor Networks (비등방성 센서 네트워크에서 가상 홀을 이용한 다중 홉 Range-Free 측위 알고리즘)

  • Lee, Sangwoo;Kim, Sunwoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.1
    • /
    • pp.33-42
    • /
    • 2013
  • This paper presents a multihop range-free localization algorithm to estimate the physical location of a normal node with local connectivity information in anisotropic sensor networks. In the proposed algorithm, a normal node captures the detour degree of the shortest path connecting an anchor pair and itself by comparing the measured hop count and the expected hop count, and the node estimates the distances to the anchors based on the detour degree. The normal node repeats this procedure with all anchor combinations and pinpoints its location using the obtained distance estimates. The proposed algorithm requires fewer anchors and less communication overhead compared to existing range-free algorithms. We showed the superiority of the proposed algorithm over existing range-free algorithms through MATLA simulations.

Developing algorithms for providing evacuation and detour route guidance under emergency conditions (재난.재해 시 대피 및 우회차량 경로 제공 알고리즘 개발)

  • Yang, Choong-Heon;Son, Young-Tae;Yang, In-Chul;Kim, Hyun-Myoung
    • International Journal of Highway Engineering
    • /
    • v.11 no.3
    • /
    • pp.129-139
    • /
    • 2009
  • The transportation network is a critical infrastructure in the event of natural and human caused disasters such as rainfall, snowfall, and terror and so on. Particularly, the transportation network in an urban area where a large number of population live is subject to be negatively affected from such events. Therefore, efficient traffic operation plans are required to assist rapid evacuation and effective detour of vehicles on the network as soon as possible. Recently, ubiquitous communication and sensor network technology is very useful to improve data collection and connection related emergency information. In this study, we develop a specific algorithm to provide evacuation route and detour information only for vehicles under emergency situations. Our algorithm is based on shortest path search technique and dynamic traffic assignment. We perform the case study to evaluate model performance applying hypothetical scenarios involved terror. Results show that the model successfully describe effective path for each vehicle under emergency situation.

  • PDF

A Risk Factor Detour Multi-Path Routing Scheme in Wireless Multimedia Sensor Networks (무선 멀티미디어 센서 네트워크 환경에서 위험요소 우회 다중 경로 라우팅 기법)

  • Hwang, Donggyo;Son, In-Goog;Park, Junho;Seong, Dong-Ook;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.1
    • /
    • pp.30-39
    • /
    • 2013
  • In recent years, with the development of devices to collect multimedia data such as small CMOS camera sensor and micro phone, studies on wireless multimedia sensor network technologies and their applications that extend the existing wireless sensor network technologies have been actively done. In such applications, various basic schemes such as the processing, storage, and transmission of multimedia data are required. Especially, a security for real world environments is essential. In this paper, in order to defend the sniffing attack in various hacking techniques, we propose a multipath routing scheme for physically avoiding the data transmission path from the risk factors. Our proposed scheme establishes the DEFCON of the sensor nodes that are geographically close to risk factors and the priorities according to the importance of the data. Our proposed scheme performs risk factor detour multipath routing through a safe path considering the DEFCON and data priority. Our experimental results show that although our proposed scheme takes the transmission delay time by about 5% over the existing scheme, it reduces the eavesdropping rate that can attack and intercept data by the risk factor by about 18%.