• Title/Summary/Keyword: Location Routing Problem

Search Result 79, Processing Time 0.029 seconds

Experimental Study of Synchronization Ratio Based on Location Update Interval in Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 패킷전송주기에 따른 동기화율 성능검증)

  • Jung, SangWoo;Han, Sanghyuck;Kim, Ki-Il
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.3
    • /
    • pp.113-121
    • /
    • 2019
  • Algorithms for geographical routing and location update attract the researchers' interests in wireless ad hoc networks. Even though many various schemes have been proposed, most of them cause scalability problem in small groups of nodes. To defeat this problem, flooding algorithm is widely utilized due to low complexity. However, there is no previous research work to evaluate flooding algorithm through implementation instead of simulation. In this paper, we present implementation of flooding algorithm on Raspberry Pi and performance evaluation results.

A Connection Entropy-based Multi-Rate Routing Protocol for Mobile Ad Hoc Networks

  • Hieu, Cao Trong;Hong, Choong-Seon
    • Journal of Computing Science and Engineering
    • /
    • v.4 no.3
    • /
    • pp.225-239
    • /
    • 2010
  • This paper introduces a new approach to modeling relative distance among nodes under a variety of communication rates, due to node's mobility in Mobile Ad-hoc Networks (MANETs). When mobile nodes move to another location, the relative distance of communicating nodes will directly affect the data rate of transmission. The larger the distance between two communicating nodes is, the lower the rate that they can use for transferring data will be. The connection certainty of a link also changes because a node may move closer to or farther away out of the communication range of other nodes. Therefore, the stability of a route is related to connection entropy. Taking into account these issues, this paper proposes a new routing metric for MANETs. The new metric considers both link weight and route stability based on connection entropy. The problem of determining the best route is subsequently formulated as the minimization of an object function formed as a linear combination of the link weight and the connection uncertainty of that link. The simulation results show that the proposed routing metric improves end-to-end throughput and reduces the percentage of link breakages and route reparations.

A Gridless Area Router for Multichip Module Design (다중칩 모듈 설계를 위한 Gridless 배선기)

  • Lee, Tae-Sun;Rim, Chong-Suck
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.9
    • /
    • pp.28-43
    • /
    • 1999
  • In this paper, we present a gridless router for MultiChip Modules (MCM). Because our router uses corner stitching data structures, not a routing grid, to represent the routings status, it allows arbitrary location of pins, and routes variable-width wires, without a considerable waste of area from bulky vias. A routing speed is a very important factor because a gridless routing approach is known its computation is hard and complex, and MCM routing problem has so large routing area and layers. Our router completes the routing faster than the most of previously reported grid-based routers, with comparable routing result, by using SEGRAs routing algorithm whose very fast speed is proved, and the characteristics of the effective data structure.

  • PDF

QLGR: A Q-learning-based Geographic FANET Routing Algorithm Based on Multi-agent Reinforcement Learning

  • Qiu, Xiulin;Xie, Yongsheng;Wang, Yinyin;Ye, Lei;Yang, Yuwang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.11
    • /
    • pp.4244-4274
    • /
    • 2021
  • The utilization of UAVs in various fields has led to the development of flying ad hoc network (FANET) technology. In a network environment with highly dynamic topology and frequent link changes, the traditional routing technology of FANET cannot satisfy the new communication demands. Traditional routing algorithm, based on geographic location, can "fall" into a routing hole. In view of this problem, we propose a geolocation routing protocol based on multi-agent reinforcement learning, which decreases the packet loss rate and routing cost of the routing protocol. The protocol views each node as an intelligent agent and evaluates the value of its neighbor nodes through the local information. In the value function, nodes consider information such as link quality, residual energy and queue length, which reduces the possibility of a routing hole. The protocol uses global rewards to enable individual nodes to collaborate in transmitting data. The performance of the protocol is experimentally analyzed for UAVs under extreme conditions such as topology changes and energy constraints. Simulation results show that our proposed QLGR-S protocol has advantages in performance parameters such as throughput, end-to-end delay, and energy consumption compared with the traditional GPSR protocol. QLGR-S provides more reliable connectivity for UAV networking technology, safeguards the communication requirements between UAVs, and further promotes the development of UAV technology.

Optimal path planning and analysis for the maximization of multi UAVs survivability for missions involving multiple threats and locations (다수의 위협과 복수의 목적지가 존재하는 임무에서 복수 무인기의 생존율 극대화를 위한 최적 경로 계획 및 분석)

  • Jeong, Seongsik;Jang, Dae-Sung;Park, Hyunjin;Seong, Taehyun;Ahn, Jaemyung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.43 no.6
    • /
    • pp.488-496
    • /
    • 2015
  • This paper proposes a framework to determine the routes of multiple unmanned aerial vehicles (UAVs) to conduct multiple tasks in different locations considering the survivability of the vehicles. The routing problem can be formulated as the vehicle routing problem (VRP) with different cost matrices representing the trade-off between the safety of the UAVs and the mission completion time. The threat level for a UAV at a certain location was modeled considering the detection probability and the shoot-down probability. The minimal-cost path connecting two locations considering the threat level and the flight distance was obtained using the Dijkstra algorithm in hexagonal cells. A case study for determining the optimal routes for a persistent multi-UAVs surveillance and reconnaissance missions given multiple enemy bases was conducted and its results were discussed.

Vehicle Routing Model Based on AVL System (자동 위치 조회시스템을 이용한 차량운송계획모델)

  • 황흥석;조규성
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.279-282
    • /
    • 2000
  • 물류시스템설계 및 개선의 일환으로 차량운송계획 문제는 매우 중요시되는 분야이다. 본 연구는 유전자 알고리즘을 이용한 통합물류 운송계획문제(Integrated Vehicle Routing Problem : IVRP)를 위한 전산화 모델의 개발로서 운송 중인 차량의 자동위치 조회시스템(Automatic Vehicle Location System : AVL)을 이용하여 차량운송의 통제기능을 높이며, 차량운송 효율을 높이는 목적으로 VRP문제와 AVL문제를 연계하는 통합운송시스템의 개념 연구이다. 본 연구에서는 다-물류센터를 고려한 운송 영역할당(Sector Clustering), 경로계획 문제(VRP) 및 유전자 알고리즘을 이용한 운송순서 계획(GA-TSP)을 고려한 통합운송계획모델의 개발을 목적으로 차량의 운송간의 통신 및 통제 등의 기능을 위하여 위치 추적을 가진 GPS와 통신시스템을 위한 TRS 및 위치설정을 위한 GIS를 고려하였다. 본 연구에서의 AVL시스템 개발을 위한 GPS, GIS 및TRS 등 AVL시스템의 구성요소에 대하여 그 개요를 조사 연구하였다. 또한 GPS, GIS을 기반으로한 물류시스템의 구성과 시스템에 필요한 기능 및 구성요소를 파악하고 서브 시스템을 구성하여 각 서브 시스템의 기본설계를 실시하기 위한 연구이다.

  • PDF

GEOP : A Security Aware Multipath Routing Protocol (GEOP : 보안 인식 다중경로 라우팅 프로토콜)

  • Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.2
    • /
    • pp.151-157
    • /
    • 2010
  • Rapid technological advances in the area of micro electro-mechanical systems (MEMS) have spurred the development of small inexpensive sensors capable of intelligent sensing. A significant amount of research has been done in the area of connecting large numbers of these sensors to create robust and scalable Wireless Sensor Networks (WSNs). The resource scarcity, ad-hoc deployment, and immense scale of WSNs make secure communication a particularly challenging problem. Since the primary consideration for sensor networks is energy efficiency, security schemes must balance their security features against the communication and computational overhead required to implement them. In this paper, we combine location information and probability to create a new security aware multipath geographic routing protocol. The implemented result in network simulator (ns-2) showed that our protocol has a better performance under attacks.

A Simulation Model for Evaluating Demand Responsive Transit: Real-Time Shared-Taxi Application (수요대응형 교통수단 시뮬레이션 방안: Real-Time Shared-Taxi 적용예시)

  • Jung, Jae-Young
    • International Journal of Highway Engineering
    • /
    • v.14 no.3
    • /
    • pp.163-171
    • /
    • 2012
  • Demand Responsive Transit (DRT) services are becoming necessary as part of not only alternative transportation means for elderly and mobility impaired passengers, but also sustainable and flexible transportation options in urban area due to the development of communication technologies and Location Based Services (LBS). It is difficult to investigate the system performance regarding vehicle operational schemes and vehicle routing algorithms due to the lack of commercial software to support door-to-door vehicle simulation for larger area. This study proposes a simulation framework to evaluate innovative and flexible transit systems focusing on various vehicle routing algorithms, which describes data-type requirements for simulating door-to-door service on demand. A simulation framework is applied to compare two vehicle dispatch algorithms, Nearest Vehicle Dispatch (NVD) and Insertion Heuristic (IH) for real-time shared-taxi service in Seoul. System productivity and efficiency of the shared-taxi service are investigated, comparing to the conventional taxi system.

A Self-Organizing Angle-based Routing Protocol for Urban Environments (도심환경에서의 자율 군집적인 각도 기반 라우팅 프로토콜)

  • Oh, Seungyong;Cho, Keuchul;Kim, Junhyung;Yun, Jeongbae;Seong, Gihyuk;Han, Kijun
    • Journal of Digital Convergence
    • /
    • v.11 no.10
    • /
    • pp.379-385
    • /
    • 2013
  • MANET is not suitable to be applied to vehicle environments because of frequent path loss and path re-routing. To solve these problem, It is known that location-based routing protocol VANET is efficient. But, the VANET algorithm does not consider urban environments due to frequent vehicle movement and jamming by tall building. In this paper, we propose an efficient routing protocol to improve transfer efficiency and reduce transfer hop count. in urban networks.

A case study on algorithm development and software materialization for logistics optimization (기업 물류망 최적 설계 및 운영을 위한 알고리즘 설계 및 소프트웨어 구현 사례)

  • Han, Jae-Hyun;Kim, Jang-Yeop;Kim, Ji-Hyun;Jeong, Suk-Jae
    • Journal of the Korea Safety Management & Science
    • /
    • v.14 no.4
    • /
    • pp.153-168
    • /
    • 2012
  • It has been recognized as an important issue to design optimally a firm's logistics network for minimizing logistics cost and maximizing customer service. It is, however, not easy to get an optimal solution by analyzing trade-off of cost factors, dynamic and interdependent characteristics in the logistics network decision making. Although there has been some developments in a system which helps decision making for logistics analysis, it is true that there is no system for enterprise-wise's on-site support and methodical logistics decision. Specially, E-biz process along with information technology has been made dramatic advance in a various industries, there has been much need for practical education closely resembles on-site work. The software developed by this study materializes efficient algorithm suggested by recent studies in key topics of logistics such as location and allocation problem, traveling salesman problem, and vehicle routing problem and transportation and distribution problem. It also supports executing a variety of experimental design and analysis in a way of the most user friendly based on Java. In the near future, we expect that it can be extended to integrated supply chain solution by adding decision making in production in addition to a decision in logistics.