• 한국군사과학기술학회지
• /
• 제18권4호
• /
• pp.432-440
• /
• 2015

UGVs(Unmanned Ground Vehicles) are robots that can substitute humans in reconnaissance operations of potentially dangerous and contaminated sites. Currently, there have been active research on utilizing UGVs in military environments. Much resrach has been focused on exploiting the weakness of topology-based routing and instead utilize location-based routing for the networking of UGVs. It is generally assumed that location-based routing methods can fully utilize the location information gained from GPS. However, this may not be possible in tactical environments due to enemy GPS jamming and LOS(Line of Sight) limitations. To solve this problem, we propose a location-based routing scheme utilizing low control message that can calibrate the location information using GPS information as well as location of neighboring UGV, movement direct and speed information. Also utilizing topology-based routing scheme to solve incorrect location information in GPS jamming region.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.340-342
• /
• 2003

Location based services based on positions of moving objects are expanding the business area gradually. The location is included all estimate position of the future as well as the position of the present and the past. Location based routing service is active business application in which the position information of moving objects is applied efficiently. This service includes the trajectory of past positions, the real-time tracing of present position of special moving objects, and the shortest and optimized paths combined with map information. In this paper, we describes the location based routing services is extend in distributed web GIS environment. Web GIS service systems provide the various GIS services of analyzing and displaying the spatial data with friendly user - interface. That is, we propose the efficient architecture and technologies for servicing the location based routing services in distributed web GIS environment. The position of moving objects is acquired by GPS (Global Positioning System) and converted the coordinate of real world by map matching with geometric information. We suppose the swapping method between main memory and storages to access the quite a number of moving objects. And, the result of location based routing services is wrapped the web-styled data format. We design the schema based on the GML. We design these services as components were developed in object-oriented computing environment, and provide the interoperability, language-independent, easy developing environment as well as re - usability.

• 한국컴퓨터정보학회논문지
• /
• 제18권2호
• /
• pp.77-85
• /
• 2013

최근 무선 애드 혹 네트워크에서 경로 탐색을 위한 위치정보 기반 라우팅 프로토콜에 관한 연구가 활발히 진행 중이다. 위치정보 기반 라우팅 프로토콜은 모든 노드가 GPS 장치를 통해 자신의 위치정보를 습득하고 이를 이용해 제한적 영역으로만 플러딩을 수행한다. 따라서 기존 IP 기반 라우팅 프로토콜보다 라우팅 메시지 수를 줄일 수 있는 장점을 가지고 있다. 또한 이 프로토콜은 네트워크를 구성하는 모든 노드가 자신의 위치정보를 습득해야만 라우팅에 참여할 수 있도록 가정하고 있다. 하지만 최근 소형화 되고 있는 센서 노드의 경우 GPS 장치가 없는 경우가 있다. 따라서 자신의 위치정보가 없는 센서 노드의 경우 네트워크 구성 및 위치기반 라우팅에 참여가 불가능하다. 따라서 본 논문에서는 GPS 기능을 가진 노드와 그렇지 않은 노드가 서로 공존하는 무선 애드 혹 네트워크에서 GPS 기능을 가지고 있지 않은 노드가 위치정보 기반 라우팅 프로토콜에 참여할 수 있는 가상 위치정보 기반 라우팅 프로토콜을 제안한다. 이 프로토콜은 위치정보를 획득할 수 없는 노드가 자신의 주위 노드의 위치 정보를 획득하여 자신의 위치정보로 활용할 수 있는 기법이다. 따라서 제안하는 프로토콜은 GPS 기능을 가지고 있지 않은 무선 노드가 애드 혹 네트워크 구성에 참여하여 위치정보 기반 라우팅에 참여 할 수 있는 장점을 가지고 있다.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1733-1740
• /
• 2007

In this paper, we propose a wireless location-based routing algorithm which uses the location information of its neighbor nodes and a destination node. At first, the proposed routing algorithm forwards a packet to the X direction by selecting a closest node to its destination as a next hop in terms of the X coordinate until the packet reaches closely to the packet's destination. Then the packet is forwarded to the Y direction by selecting a closest node to its destination in terms of the Y coordinate. We use a back off mechanism in case that a next hop cannot be found using the proposed routing algorithm, which resolves loops while forwarding. The experimental results show that the proposed routing algorithm performs well like the existing routing algorithms Ad hoc On-demand Distance Vector and Greedy Perimeter Stateless Routing. It is expected to use the proposed routing algorithm in the digital battlefield of military environments and survival games of commercial environments.

• 산업경영시스템학회지
• /
• 제46권4호
• /
• pp.238-245
• /
• 2023

As technologies have been more quickly developed in this 4th Industry Revolution era, their application to defense industry has been also growing. With these much advanced technologies, we attempt to use Manned-Unmanned Teaming systems in various military operations. In this study, we consider the Location-Routing Problem for reconnaissance surveillance missions of the maritime manned-unmanned surface vehicles. As a solution technique, the two-phase method is presented. In the first location phase, the p-median problem is solved to determine which nodes are used as the seeds for the manned vehicles using Lagrangian relaxation with the subgradient method. In the second routing phase, using the results obtained from the location phase, the Vehicle Routing Problems are solved to determine the search routes of the unmanned vehicles by applying the Location Based Heuristic. For three network data sets, computational experiments are conducted to show the performance of the proposed two-phase method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.504-527
• /
• 2015

Underwater wireless sensor networks (UWSNs) are similar to the terrestrial sensor networks. Nevertheless, there are different characteristics among them such as low battery power, limited bandwidth and high variable propagation delay. One of the common major problems in UWSNs is determining an efficient and reliable routing between the source node and the destination node. Therefore, researchers tend to design efficient protocols with consideration of the different characteristics of underwater communication. Furthermore, many routing protocols have been proposed and these protocols may be classified as location-based and location-free routing protocols. Pressure-based routing protocols are a subcategory of the location-free routing protocols. This paper focuses on reviewing the pressure-based routing protocols that may further be classified into non-void avoidance protocols and void avoidance protocols. Moreover, non-void avoidance protocols have been classified into single factor based and multi factor based routing protocols. Finally, this paper provides a comparison between these protocols based on their features, performance and simulation parameters and the paper concludes with some future works on which further study can be conducted.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (D)
• /
• pp.136-138
• /
• 2006

The high-rate Wireless Personal Area Networks (WPANs) which IEEE 802.15.3 standard support, foster the Digital Home Network (DHN) scenarios with high rate multimedia data transmission. Actually, there are a few routing protocols for ad-hoc networks which considered the terminal location information and routing metric to reduce the energy consumption and optimize the routing path in mobile system. Based on other routing protocols, this paper presents the reliable location-based routing algorithm which is an adaptation to these networks.

• 정보보호학회논문지
• /
• 제17권4호
• /
• pp.21-35
• /
• 2007

애드혹(Ad hoc) 네트워크에서의 위치기반 라우팅(position-based routing)은 노드의 지리적인 위치정보를 이용함으로써 효율적인 라우팅이 가능하다는 장점이 있다. 위치기반 라우팅에서 위치 서비스(location service)는 라우팅의 안전성과 효율성에 있어서 매우 중요한 부분이다. 본 논문에서는 위치 서비스에서 발생할 수 있는 보안 위협을 정의하여 기존 애드혹 라우팅에서의 보안 위협뿐 아니라 위치 서비스에서의 보안 위협에도 안전한 쿼럼기반 위치 서비스 프로토콜을 제안한다. 제안하는 프로토콜에서 노드는 공격 노드에 의한 거짓 위치 갱신, 거짓 위치 응답 공격에 대응하기 위해 스스로 생성한 공개키/개인키 쌍과 자신의 위치정보를 이용하여 주소를 생성하며 이를 위치기반 라우팅에 사용한다. 본 논문에서는 제안하는 프로토콜이 기존에 존재했던 다양한 공격들에 대해 안전하며 위치 서비스를 대상으로 한 공격에도 안전하게 대응할 수 있음을 보였고 시뮬레이션을 통해 프로토콜의 안전성 및 효율성을 분석하였다.

• Journal of Communications and Networks
• /
• 제11권6호
• /
• pp.589-598
• /
• 2009

In wireless sensor networks, a node that reports information gathered from adjacent assets should relay packets appropriately so that its location context is kept private, and thereby helping ensure the security of the assets that are being monitored. Unfortunately, existing routing methods that counter the local eavesdropping-based tracing deal with a single asset, and most of them suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. In this paper, we propose a routing method, greedy perimeter stateless routing-based source-location privacy with crew size w (GSLP-w), that enhances location privacy of the packet-originating node (i.e., active source) in the presence of multiple assets. GSLP-w is a hybrid method, in which the next-hop node is chosen in one of four modes, namely greedy, random, perimeter, and retreat modes. Random forwarding brings the path diversity, while greedy forwarding refrains from taking an excessively long path and leads to convergence to the destination. Perimeter routing makes detours that avoid the nodes near assets so that they cannot be located by an adversary tracing up the route path. We study the performance of GSLP-w with respect to crew size w (the number of packets being sent per path) and the number of sources. GSLP-w is compared with phantom routing-single path (PR-SP), which is a notable routing method for source-location privacy and our simulation results show that improvements from the point of the ratio of safety period and delivery latency become significant as the number of source nodes increases.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 춘계학술발표대회
• /
• pp.1264-1266
• /
• 2009

We introduce a location-based routing model applied for grid backbone nodes in wireless mesh network. The number of paths with nearest distance between two nodes is calculated and used as key parameter to execute routing algorithm. Node will increase the transmission range that makes a trade off with data rate to reach its neighbors when node itself is isolated. The routing model is lightweight and oriented thanks to the simple but efficient routing algorithm.