• Title/Summary/Keyword: ROUTE

Search Result 5,431, Processing Time 0.038 seconds

An Entropy-Based Routing Protocol for Supporting Stable Route Life-Time in Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크에서 안정된 경로의 Life-Time을 지원하기 위한 엔트로피 기반의 라우팅 프로토콜)

  • An, Beong Ku;Lee, Joo Sang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.1
    • /
    • pp.31-37
    • /
    • 2008
  • In this paper, we propose an entropy-based routing protocol to effectively support both stable route construction and route lifetime in Mobile Ad-hoc Wireless Sensor Networks (MAWSN). The basic idea and feature of the proposed routing protocol are as follows. First, we construct the stable routing routes based on entropy concept using mobility of mobile nodes. Second, we consider a realistic approach, in the points of view of the MAWSN, based on mobile sensor nodes as well as fixed sensor nodes in sensor fields while the conventional research for sensor networks focus on mainly fixed sensor nodes. The performance evaluation of the proposed routing protocol is performed via simulation using OPNET(Optimized Network Engineering Tool) and analysis. The results of the performance evaluation show that the proposed routing protocol can efficiently support both the construction of stable route and route lifetime in mobile ad-hoc wireless networks.

  • PDF

A Dynamic Route Search Algorithm for Time-Sensitive Air Cargo in Air Traffic Management (항공교통관리에서 시간에 민감한 항공운송을 위한 동적 항로탐색 알고리즘)

  • Cho, Tae-Hwan;Kim, Kang-Hee;Choi, Sang-Bang
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.5
    • /
    • pp.744-751
    • /
    • 2012
  • Air Traffic Management(ATM) is to control air traffic flow quickly and safely. For efficient ATM, the ability which calculate optimal route using filight plan and filght information is required. Especially for the time-sensitive air cargo, it is essential. In this paper, therefore, we present a dynamic route search algorithm which calculate optimal route dynamically. The conventional method using Dijkstra algorithm has a problem that recalculate the entire route when some airways are closed. However, the proposed algorithm recalculates only affected waypoints, so it finds optimal route quickly and accurately. Comparisons with the conventional method and the proposed algorithm show that the proposed algorithm provides better.

Comparative Study on Determining Highway Routes (도로의 최적노선대 선정방법 비교 연구)

  • Kim, Kwan-Jung;Chang, Myung-Soon
    • International Journal of Highway Engineering
    • /
    • v.8 no.4 s.30
    • /
    • pp.159-179
    • /
    • 2006
  • By using the current road design method that is based on the regulation about structure and facilities standard of the road and the route plan guide of a national road and the alignment optimization road design method which is studied in the inside and outside of country, this study operate the route plan of the sample study and compare and analysis the route character, consequently the current design method has local optimization that is formed the plan by the stage and the section. Alignment optimization road design has the system optimal route search. But cost function has limite that caused by construction parameter that is not included in cost function. So we design a road route included cost function in main fields. As a result, we obtain a realistic and economically road route. The alignment optimization road design model has to be made up some problems, like the change of vertical gradient in the tunnel section, though this defects it has a lot of merits as a geometric design tool, especially in the feasibility study and the scheme design.

  • PDF

Mapping USN Route by Integrating Multiple Spatial Parameters into Radio Propagation Model (다중 공간변수와 전파예측 모델을 통합한 USN 중계 경로망도 제작)

  • Kim, Jin-Taek;Um, Jung-Sup
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.1
    • /
    • pp.51-63
    • /
    • 2008
  • Previous studies for routing In USN (Ubiquitous Sensor Networks) appear to be unreliable due to the dependence on non-spatial data and the lack of map overlay analysis. Multiple spatial parameters and radio propagation modeling techniques were integrated to derive RSSI (Received Signal Strength Indicator) value between route nodes and produce a highly reliable path map. It was possible to identify area-wide patterns of USN route subject to many different Influences (e.g. the specific effects of radio blocking factors such as the visible area, road area, cell duplicated area, and building density), which cannot be acquired by traditional non-spatial modeling. The quantitative evidence concerning the USN route for individual cell as well as entire study area would be utilized as major tools to visualize paths in real-time and to select alternative path when failure or audition of route node occurs.

  • PDF

A Study on Bicycle Route Selection Using Optimal Path Search (최적 경로 탐색을 이용한 자전거 경로 선정에 관한 연구)

  • Baik, Seung Heon;Han, Dong Yeob
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.5
    • /
    • pp.425-433
    • /
    • 2012
  • Dijkstra's algorithm is one of well-known methods to find shortest paths over a network. However, more research on $A^*$ algorithm is necessary to discover the shortest route to a goal point with the heuristic information rather than Dijkstra's algorithm which aims to find a path considering only the shortest distance to any point for an optimal path search. Therefore, in this paper, we compared Dijkstra's algorithm and $A^*$ algorithm for bicycle route selection. For this purpose, the horizontal distance according to slope angle and average speed were calculated based on factors which influence bicycle route selection. And bicycle routes were selected considering the shortest distance or time-dependent shortest path using Dijkstra's or $A^*$ algorithm. The result indicated that the $A^*$ algorithm performs faster than Dijkstra's algorithm on processing time in large study areas. For the future, optimal path selection algorithm can be used for bicycle route plan or a real-time mobile services.

Route-optimized Handoff in Mobile CORBA Environment (Mobile CORBA 환경에서 게이트웨이간의 경로최적화 핸드오프)

  • Shin, Hye-Ryung;Lee, Hyung-Woo;Kim, Ju-Ho
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.224-232
    • /
    • 2002
  • The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been proposed. However, when these protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoe networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable rouse that is impervious to route failures by topological changes by mobile hosts. For reliable route selection, the concept of virtual zone (stable lone and caution zone) is proposed. The lone is located in a mobile node's transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

A Study on the Planning of Railway Route Adjacent to the Preservation Area of Cultural Assets (문화재 보호구역 주변 근접통과 구간의 철도노선 계획 사례에 대한 연구)

  • Roh, Byoung-Kuk;Kim, Jae-Bok
    • Journal of the Korean Society for Railway
    • /
    • v.12 no.3
    • /
    • pp.370-375
    • /
    • 2009
  • This study draws from the hands-on experience of designing railway routes that pass very close to the Cultural Heritage Protection Areas. There have been many cases where the rail route plan is rejected during the deliberation process of National Cultural Heritage Alteration although it has been selected as the best alternative after much time and expenses are spent and public consensus is obtained. When the route has to be realigned, this often leads to project delay and possible counter protest from the local public. In an effort to prevent such problems from occurring over again, this study looks at the projects where railways pass close to the Cultural Heritage Protection Areas. We examine the nature of public protests and the route selection process that reflects these protests into consideration. Based on the experiences drawn from these cases, we offer a few suggestions that we hope will contribute to the success of the project. The suggestions include the right timing for the application of Cultural Heritage Alteration and route alignment technique.

Mobile Ad Hoc Routing Protocol Supporting Unidirectional Links (단방향 링크를 지원하는 이동 Ad Hoc 라우팅 프로토콜)

  • Lee, Kwang-Bae;Kim, Hyun-Ug;Jung, Kun-Won
    • Journal of IKEEE
    • /
    • v.5 no.1 s.8
    • /
    • pp.59-66
    • /
    • 2001
  • In this paper, we propose a dynamic source routing protocol supporting asymmetric paths for mobile Ad Hoc networks that contain unidirectional links. At present, the existing dynamic source routing protocol supports only symmetric paths that consist of bidirectional links for routing. However, in fact, there can exist unidirectional links due to asymmetric property of mobile terminals or current wireless environment. Thus, we implement a mobile Ad Hoc routing protocol supporting unidirectional links, which is fit for more general wireless environment. Especially, the proposed protocol uses an improved multipath maintenance method in order to perform rapid route reconfiguration when route error due to mobility is detected. For performance evaluation, we consider the following factors: average route discovery time and average data reception rate. In order to obtain the factors of the performance evaluation, we did simulation for 900 seconds in the step of 100 seconds with the following scenarios: usage of route cache in intermediate nodes on route path, and different mobility/connection patterns.

  • PDF

Optimal Route Discovery System for Emergency Escape from Disaster Situations (재난 상황 시 탈출을 위한 최적 경로 탐색 시스템)

  • Kang, Moo-Bin;Joo, Yang-Ick
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.448-449
    • /
    • 2016
  • Enlargement and complexification of current structures increase the expected casualty in case of accident in those e.g., fire. In that case, there only have been basic instructions such as announcement of that situation, alarm bell, exit signs, etc. but any guidance to lead to proper escape route was not been provided so far. To tackle the problem, several schemes have been proposed. However, various risk factors were not considered and route discovery performance must be improved to be applied to structures. Therefore, this paper proposes an optimal route discovery system for emergency escape from disaster situations which takes into account various possible risk factors and enhances the searching efficiency by using the $A^{\ast}$ algorithm. Performance evaluation by computer simulation shows that the proposed scheme effectively leads to safe escape route.

  • PDF

Environment Adaptive Emergency Evacuation Route GUIDE through Digital Signage Systems

  • Lee, Dongwoo;Kim, Daehyun;Lee, Junghoon;Lee, Seungyoun;Hwang, Hyunsuk;Mariappan, Vinayagam;Lee, Minwoo;Cha, Jaesang
    • International Journal of Advanced Culture Technology
    • /
    • v.5 no.1
    • /
    • pp.90-97
    • /
    • 2017
  • Nowadays, the most of commercial buildings are build-out with complex architecture and decorated with more complicated interiors of buildings so establishing intelligible escape routes becomes an important case of fire or other emergency in a limited time. The commercial buildings are already equipped with multiple exit signs and these exit signs may create confusion and leads the people into different directions under emergency. This can jeopardize the emergency situation into a chaotic state, especially in a complex layout buildings. There are many research focused on implementing different approached to improve the exit sign system with better visual navigating effects, such as the use of laser beams, the combination of audio and video cues, etc. However the digital signage system based emergency exit sign management is one of the best solution to guide people under emergency situations to escape. This research paper, propose an intelligent evacuation route GUIDE that uses the combination centralized Wireless Sensor Networks (WSN) and digital signage for people safety and avoids dangers from emergency conditions. This proposed system applies WSN to detect the environment condition in the building and uses an evacuation algorithm to estimate the safe route to escape using the sensor information and then activates the signage system to display the safe evacuation route instruction GUIDE according to the location the signage system is installed. This paper presented the prototype of the proposed signage system and execution time to find the route with future research directions. The proposed system provides a natural intelligent evacuation route interface for self or remote operation in facility management to efficiently GUIDE people to the safe exit under emergency conditions.