• Title/Summary/Keyword: Optimized Route

Search Result 104, Processing Time 0.021 seconds

A Location Recognition System of RFID Tag for Parking Control (주차관제를 위한 RFID 태그 객체의 위치 인식 시스템)

  • Kang, Ku-An;Kim, Jin-Deog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.1
    • /
    • pp.99-107
    • /
    • 2008
  • Recently route guiding system using GPS is spread widely. In the parking management system of complex mall, RFID is mainly used to control status of parking lots. However, in a case that a vehicle only with RFID tag enters into small market-populated district with service of parking lots, there is no parking route guiding system optimized with information of real tine status of parking lots and the system only with GPS can't provide a function of using real time status of parking lots. This paper proposes a location recognizing method of RFID tag object for parking control system to integrated several parking lots in the business district and database-linked route guiding system optimized for parking. The proposed location recognizing method makes the search of optimized parking route possible by abstracting decoding order of tag and antenna number and recognizing direction of tag linked with database. Ihe implemented system that is composed of RFID tag, reader, middleware, server, parking lot clients and mobile clients shows that the proposed method works well and it will be useful for integrated parking control system.

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

Comparative Results of Weather Routing Simulation (항로최적화기술 시뮬레이션 비교 결과)

  • Yoo, Yunja;Choi, Hyeong-Rae;Lee, Jeong-Youl
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.52 no.2
    • /
    • pp.110-118
    • /
    • 2015
  • Weather routing method is one of the best practices of SEEMP (Ship Energy Efficiency Management Plan) for fuel-efficient operation of ship. KR is carrying out a basic research for development of the weather routing algorithm and making a monitoring system by FOC (Fuel Oil Consumption) analysis compared to the reference, which is the great circle route. The added resistances applied global sea/weather data can be calculated using ship data, and the results can be corrected to ship motions. The global sea/weather data such as significant wave height, ocean current and wind data can be used to calculate the added resistances. The reference route in a usual navigation is the great circle route, which is the shortest distance route. The global sea/weather data can be divided into grids, and the nearest grid data from a ship's position can be used to apply a ocean going vessel's sea conditions. Powell method is used as an optimized routing technique to minimize FOC considered sea/weather conditions, and FOC result can be compared with the great circle route result.

A Route Stability-based Direction Guided Routing Protocol in Mobile Ad-hoc Wireless Networks (모바일 Ad-hoc 무선 네트워크에서 경로 안정성 기반 방향성 안내 라우팅 프로토콜)

  • Ha, Suehyung;Le, The Dung;An, Beongku
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.257-264
    • /
    • 2012
  • In this paper, we propose a Route Stability-based Direction Guided Routing protocol(RSDGR) in mobile ad-hoc wireless networks. The main features and contributions of the proposed routing protocol are as follows. First, it can calculate link stability between two nodes as well as route stability of multi hop quantitatively by using nodes' mobility. And this protocol can establish the most stable path between a source node and a destination node. Second, according to the route stability between a source node and a destination node, it can control and optimize the direction guided region dynamically for route setup. Third, we suggest theoretical model for quantitative calculation of link stability between two nodes and route stability of multi hop path. The performance evaluation of the proposed routing protocol is performed by simulation using OPNET(Optimized Network Engineering Tool) and theoretical analysis. The results of performance evaluation show that the patterns of PDR are similar in simulation and analysis according to route stability. The faster mobile nodes' velocity and the smaller source node's direct guided reigion, the lower route stability and PDR and the higher delay and control overhead related to this.

On Optimizing Route Discovery of Topology-based On-demand Routing Protocols for Ad Hoc Networks

  • Seet, Boon-Chong;Lee, Bu-Sung;Lau, Chiew-Tong
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.266-274
    • /
    • 2003
  • One of the major issues in current on-demand routing protocols for ad hoc networks is the high resource consumed by route discovery traffic. In these protocols, flooding is typically used by the source to broadcast a route request (RREQ) packet in search of a route to the destination. Such network-wide flooding potentially disturbs many nodes unnecessarily by querying more nodes than is actually necessary, leading to rapid exhaustion of valuable network resources such as wireless bandwidth and battery power. In this paper, a simple optimization technique for efficient route discovery is proposed. The technique proposed herein is location-based and can be used in conjunction with the existing Location-Aided Routing (LAR) scheme to further reduce the route discovery overhead. A unique feature of our technique not found in LAR and most other protocols is the selective use of unicast instead of broadcast for route request/query transmission made possible by a novel reuse of routing and location information. We refer to this new optimization as the UNIQUE (UNIcast QUEry) technique. This paper studies the efficacy of UNIQUE by applying it to the route discovery of the Dynamic Source Routing (DSR) protocol. In addition, a comparative study is made with a DSR protocol optimized with only LAR. The results show that UNIQUE could further reduce the overall routing overhead by as much as 58% under highly mobile conditions. With less congestion caused by routing traffic, the data packet delivery performance also improves in terms of end-to-end delay and the number of data packets successfully delivered to their destinations.

Route Optimization for Energy-Efficient Path Planning in Smart Factory Autonomous Mobile Robot (스마트 팩토리 모빌리티 에너지 효율을 위한 경로 최적화에 관한 연구)

  • Dong Hui Eom;Dong Wook Cho;Seong Ju Kim;Sang Hyeon Park;Sung Ho Hwang
    • Journal of Drive and Control
    • /
    • v.21 no.1
    • /
    • pp.46-52
    • /
    • 2024
  • The advancement of autonomous driving technology has heightened the importance of Autonomous Mobile Robotics (AMR) within smart factories. Notably, in tasks involving the transportation of heavy objects, the consideration of weight in route optimization and path planning has become crucial. There is ongoing research on local path planning, such as Dijkstra, A*, and RRT*, focusing on minimizing travel time and distance within smart factory warehouses. Additionally, there are ongoing simultaneous studies on route optimization, including TSP algorithms for various path explorations and on minimizing energy consumption in mobile robotics operations. However, previous studies have often overlooked the weight of the objects being transported, emphasizing only minimal travel time or distance. Therefore, this research proposes route planning that accounts for the maximum payload capacity of mobile robotics and offers load-optimized path planning for multi-destination transportation. Considering the load, a genetic algorithm with the objectives of minimizing both travel time and distance, as well as energy consumption is employed. This approach is expected to enhance the efficiency of mobility within smart factories.

Route Optimization Scheme for Mobile Content Sources in Content Centric Networking

  • Lee, Jihoon;Rhee, Eugene
    • Journal of information and communication convergence engineering
    • /
    • v.18 no.1
    • /
    • pp.22-27
    • /
    • 2020
  • Content centric networking (CCN) is regarded as promising internet architecture because it can provide network efficiency in terms of bandwidth consumption by separating contents from a specific network location and decrease network congestion events. However, the application of a CCN does not widely consider the side effects of mobile devices, particularly mobile content sources. For content source mobility, a full routing update is required. Therefore, in this study, a route optimization scheme is proposed for mobile content sources in a CCN environment to provide low communication overhead, short download time, and low resource consumption. The proposed scheme establishes a direct path between content requesters and a mobile content source for the exchange of interest and data packets using interest-piggybacked data packets. Based on the inherent CCN naming characteristics, the content source does not know the name prefix of the content consumer, and thus the proposed optimized CCN scheme utilizes the content router in the home domain of the content source.

Grid-based Location Service Spot scheme for optimized routing path on VANET (VANET 환경에서의 경로 최적화를 위한 그리드 기반 위치 정보 서비스 스팟 기법)

  • Kim, Jong-Hyun;Kim, Kee-Cheon;Jung, Woo-Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.1
    • /
    • pp.76-90
    • /
    • 2010
  • Location Service is required in position-based routing for VANET to provide position information. We propose Grid-based Location service spot(GLSS) scheme for optimized routing path to improve accessibility and load balance in location service. Specific area is defined as Location service spot(LSS) on each grid in this scheme, and all nodes in the grid geocast its location update message and location request message to each LSS. Location request messages are flooded throughout LSSs, location reply messages establish optimized route from the source grid to the destination grid. We evaluated GLSS which establishes optimized route on the grid comparing GPSR in consideration of road condition and geographical features.

A Study on Optimized Size of a Mobile Harbor for South Korea Coastal Service

  • Heo, Sung-Kuk;Park, Nam-Kyu
    • Journal of Navigation and Port Research
    • /
    • v.35 no.2
    • /
    • pp.159-165
    • /
    • 2011
  • The aim of paper is to calculate the optimized size of Mobile Harbor(MH) which would be operated in South Korea coast area. MH is the combined entity which has the function of both ship and container port. In estimating the optimized size, the total cost concept is applied to the different size of MH. Trade-off factors for calculating total cost are MH cost and the over-capacity lost cost. The factors for MH cost estimation are the cargo demand, distance from origin to destination, voyage route and MH's fixed and variable cost in both sailing and port. The other cost is the over-capacity lost cost which is occurred from dead space in case of oversize compared with a voyage demand. The alternatives for the least cost are 250TEU, 500TEU, 750TEU and 1,000TEU sized vessel. The result of research is that 250TEU sized vessel is optimized in a South Korea costal service. If the coastal area be separated in terms of voyage distance or the specific area in considering trade, the optimized size is changed depending upon distance.

Network Mobility Handoff Scheme to Support Fast Route Optimization in Nested Network Mobility (중첩된 이동 네트워크 환경에서 빠른 경로 최적화를 지원하는 핸드오프 방안)

  • Lee, Il-Ho;Lee, Jun-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.5
    • /
    • pp.119-131
    • /
    • 2009
  • Existing proposals on route optimization for nested Network Mobility(NEMO) have a problem that it is difficult to optimize a route promptly in an environment where a MR moves frequently. Also, they have L3 handoff latency as well as route optimization latency until an optimized route is formed. In this paper, we propose a L3 handoff scheme that supports fast route optimization for nested NEMO without any additional optimization procedure. To achieve this, our proposed scheme is designed to include a procedure that an AR acquires address informations of a MR. After receiving binding update message from the MR, the AR performs the binding update procedure with the MR's HA on behalf of the MR. Packets are delivered to the AR only passing by the MR's HA after a bi-directional tunnel is formed between the AR and the HA. The result of our performance evaluation has shown that the proposed scheme could provide excellent performance compared with the RRH and the ONEMO.