무선 애드 혹 네트워크에서 가상위치정보 기반 라우팅 기법

윤주상(JooSang Youn) 한국컴퓨터정보학회 2013 韓國컴퓨터情報學會論文誌 Vol.18 No.2

최근 무선 애드 혹 네트워크에서 경로 탐색을 위한 위치정보 기반 라우팅 프로토콜에 관한 연구가 활발히 진행 중이다. 위치정보 기반 라우팅 프로토콜은 모든 노드가 GPS 장치를 통해 자신의 위치정보를 습득하고 이를 이용해 제한적 영역으로만 플러딩을 수행한다. 따라서 기존 IP 기반 라우팅 프로토콜보다 라우팅 메시지 수를 줄일 수 있는 장점을 가지고 있다. 또한 이 프로토콜은 네트워크를 구성하는 모든 노드가 자신의 위치정보를 습득해야만 라우팅에 참여할 수 있도록 가정하고 있다. 하지만 최근 소형화 되고 있는 센서 노드의 경우 GPS 장치가 없는 경우가 있다. 따라서 자신의 위치정보가 없는 센서 노드의 경우 네트워크 구성 및 위치기반 라우팅에 참여가 불가능하다. 따라서 본 논문에서는 GPS 기능을 가진 노드와 그렇지 않은 노드가 서로 공존하는 무선 애드 혹 네트워크에서 GPS 기능을 가지고 있지 않은 노드가 위치정보 기반 라우팅 프로토콜에 참여할 수 있는 가상 위치정보 기반 라우팅 프로토콜을 제안한다. 이 프로토콜은 위치정보를 획득할 수 없는 노드가 자신의 주위 노드의 위치 정보를 획득하여 자신의 위치정보로 활용할 수 있는 기법이다. 따라서 제안하는 프로토콜은 GPS 기능을 가지고 있지 않은 무선 노드가 애드 혹 네트워크 구성에 참여하여 위치정보 기반 라우팅에 참여 할 수 있는 장점을 가지고 있다. Recently, location information based routing protocol has been studied to estimate end-to-end path in wireless ad-hoc network. This protocol assumes all nodes can get heir location information via GPS devices and floods only limited area with routing message through acquired location information. Therefore, this protocol has advantage that can reduce the number of routing message than the existing IP-based routing protocols. In addition, all nodes enabling this protocol must acquire their own location information to participate in the location-based routing. However, recent because of the miniaturization of sensor node, sensor node without GPS function has been launched. Therefore in case of the sensor node that does not know location information, it is impossible to participate in the ad hoc network configuration and location information based routing. In this paper, a virtual location information based routing scheme is proposed for wireless nodes without GPS function to be able to participate in location information based routing within ad hoc network environments consisting of wireless nodes with GPS function and wireless nodes without GPS function. Therefore, the proposed protocol has the advantage that a wireless node without a GPS function is able to participate in ad hoc network configuration and the location information based routing.

Routing for Enhancing Source-Location Privacy in Wireless Sensor Networks of Multiple Assets

Tscha, Yeong-Hwan The Korea Institute of Information and Commucation 2009 Journal of communications and networks Vol.11 No.6

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.

Routing for Enhancing Source-Location Privacy in Wireless Sensor Networks of Multiple Assets

Yeonghwan Tscha 한국통신학회 2009 Journal of communications and networks Vol.11 No.6

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.

애드혹 위치기반 라우팅을 위한 안전한 쿼럼기반 위치 서비스

임지환(Jihwan Lim),김상진(Sangjin Kim),오희국(Heekuck Oh) 한국정보보호학회 2007 정보보호학회논문지 Vol.17 No.4

애드혹(Ad hoc) 네트워크에서의 위치기반 라우팅(position-based routing)은 노드의 지리적인 위치정보를 이용함으로써 효율적인 라우팅이 가능하다는 장점이 있다. 위치기반 라우팅에서 위치 서비스(location service)는 라우팅의 안전성과 효율성에 있어서 매우 중요한 부분이다. 본 논문에서는 위치 서비스에서 발생할 수 있는 보안 위협을 정의하여 기존 애드혹 라우팅에서의 보안 위협뿐 아니라 위치 서비스에서의 보안 위협에도 안전한 쿼럼기반 위치 서비스 프로토콜을 제안한다. 제안하는 프로토콜에서 노드는 공격 노드에 의한 거짓 위치 갱신, 거짓 위치 응답 공격에 대응하기 위해 스스로 생성한 공개키/개인키 쌍과 자신의 위치정보를 이용하여 주소를 생성하며 이를 위치기반 라우팅에 사용한다. 본 논문에서는 제안하는 프로토콜이 기존에 존재했던 다양한 공격들에 대해 안전하며 위치 서비스를 대상으로 한 공격에도 안전하게 대응할 수 있음을 보였고 시뮬레이션을 통해 프로토콜의 안전성 및 효율성을 분석하였다. In ad hoc networks, position-based routing schemes, that use geographical positions of nodes, have been proposed to efficiently route messages. In these routing schemes, the location service is one of the key elements that determines and effects security and efficiency of the protocol. In this paper, we define security threats of location service and propose a new quorum based location service protocol. In our proposed protocol, nodes register their public keys in other nodes during the initialization phase and these registered keys are used to verify locations of other nodes and the messages exchanged. In this paper, we prove that our protocol is robust against traditional attacks and new attacks that may occur due to the use of position-based routing. We also analyze the efficiency of our protocol using various simulations.

해양 유․무인 수상함정의 감시정찰 임무를 위한 위치-경로 문제

이진호 한국산업경영시스템학회 2023 한국산업경영시스템학회지 Vol.46 No.4

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.

THE EFFICIENCY ROUTING ALGORITHM FOR MULTIMEDIATRANSMISSION IN DIGITAL HOME NETWORK SCENARIOS

Thanh Tung Nguyen,Sea Young Ahn,Sunshin An 한국정보과학회 2006 한국정보과학회 학술발표논문집 Vol.33 No.1

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.

MANET에서 P2P 성능 향상을 위한 위치기반 라우팅 기법에 관한 연구

양환석,Yang, Hwanseok 디지털산업정보학회 2015 디지털산업정보학회논문지 Vol.11 No.2

The technology development of MANET and dissemination of P2P services has been made very widely. In particular, the development of many application services for the integration of P2P services in MANET has been made actively. P2P networks are commonly used because of the advantages of efficient use of network bandwidth and rapid information exchange. In P2P network, the infrastructure managing each node in the middle does not exist and each node is a structure playing a role as the sender and receiver. Such a structure is very similar to the structure of the MANET. However, it is difficult to provide reliable P2P service due to the high mobility of mobile nodes. In this paper, we propose location-based routing technique in order to provide efficient file sharing and management between nodes. GMN managing the group is elected after network is configured to the area of a certain size. Each node is assigned an identifier of 12 bit dynamically to provide routing which uses location information to the identifier. ZGT is managed in the GMN in order to provide management of group nodes and distributed cache information. The distributed cache technique is applied to provide a rapid retrieval of the sharing files in the each node. The excellent performance of the proposed technique was confirmed through experiments.

A Location-Based Deterministic Load Balancing for Cluster Routing Protocol in Wireless Sensor Networks

강상혁,최혜경 한국통신학회 2024 韓國通信學會論文誌 Vol.49 No.1

Wireless sensor networks (WSN) play an important role in Internet of Things (IoT). Routing protocols are essential for energy-efficient WSN with battery powered sensor nodes. Cluster-based hierarchical routing protocols are renowned for its simplicity and efficiency in WSN. However, stochastic cluster formation in conventional schemes often suffer from high energy drain. We suggest a location-based load balancing scheme with a deterministic cluster formation approach. Our proposed scheme features the location phase which is carried out once before the first round starts in the beginning. In the location phase, the sensor nodes exchange greeting messages to measure the distance between every pair of nodes. The distance information is forwarded to the base station (BS) node. The BS node calculates the exact coordinate of every sensor node and then constructs a deterministic process for cluster head selection and transmission scheduling in clusters. Our proposed scheme is evaluated through computer simulations and is shown to outperform existing schemes with or without location information, in terms of network/node lifespan.

스마트폰 사용자의 경로 모델 구축을 위한 관심 지점과 이동 경로 식별 방법

김제민(Je-Min Kim),박영택(Young-Tack Park) 한국정보과학회 2013 정보과학회논문지 : 소프트웨어 및 응용 Vol.40 No.12

스마트폰 사용자에게 위치 기반 지능형 서비스를 제공하기 위해서는, 사용자가 어디로 이동하고 있는지에 대한 상황 정보를 시스템 스스로 인지할 수 있도록 근거를 제공하는 개인 경로 모델이 필요하다. 경로 모델을 구축하는데 필요한 정보 중 사용자가 경유한 목적지와 경로는 실시간으로 기록하기가 어렵다. 본 논문에서는 GPS 좌표 정보를 기반으로 관심 지점(목적지)과 이동 경로를 자동 추출하는 알고리즘을 제시하였다. 관심 지점을 탐지하기 위해 밀도 기반 군집화를 적용할 경우 최소 영역과 최소 좌표 개수가 적절하게 주어져야 하며, 이동 경로를 식별하기 위해서는 GPS 로그를 이동 궤적으로 적절하게 분할하는 방법과 분할된 궤적간의 유사성을 계산하는 함수가 필요하다. 따라서 본 논문은 이 두 가지 부분에 초점을 맞추어 서술하였다. 특히 본 연구는 스마트폰 GPS의 부정확성을 극복하기 위해, 수신된 GPS 좌표를 지리정보시스템을 기반으로 가장 근접한 길로 보정을 하고, 보정된 좌표 이력과 가속도 센서로부터 인지된 이동 행위 정보를 활용하였다. 실제 스마트폰 사용자를 대상으로 제안하는 기법을 적용한 결과, 관심 지점 탐지에 대한 정확도는 약 93%, 이동 경로 식별에 대한 정확도는 약 92%를 보였다. Personal route models are required to provide location-based intelligent services to smartphone users. A route model guides a user on his/her path. Real-time recording of users" destinations and route patterns among other essential information for building the route model is very difficult. In this paper, we propose algorithms that detect points of interest (destinations) and automatically identify travel routes based on global positioning system (GPS) coordinates. When applying density-based clustering methods to detect POIs, an appropriate minimum boundary and several minimum points should be given. In order to identify travel routes, a procedure for dividing GPS logs into trajectories and a function for calculating similarity between trajectories are required. In this paper, we address these requirements. In particular, we compensate for the GPS coordinates of adjacent streets by using a geographic information system (GIS) to overcome the inaccuracy of GPS coordinates, and utilize travel behaviors that can be recognized by an accelerometer. Based on experiments conducted with three smartphone users, our approach shows about 93% POI detection accuracy and about 92% route identification accuracy.

근거리 영역에서의 개인 경로 학습을 위한 노이즈 좌표 제거 및 이동 궤적의 단순화 기법

김제민,양승국,백혜정,전명중,박영택 한국정보과학회 2012 정보과학회논문지 : 시스템 및 이론 Vol.39 No.4

지능형 시스템이 사용자에게 위치 기반 서비스를 제공하기 위해서는 사용자의 현재 위치를 인지하고 있어야 한다. 따라서 각 개인이 특정 장소로 이동하는 사용자 경로 정보는 위치 기반 서비스를 제공하기 위한 좋은 자료가 된다. 개인 경로를 학습하기 위해서는 사용자의 위치와 이동 궤적을 표현한 자료가 필요하다. 사용자의 이동 정보를 파악하기 위한 지표로 GPS가 많이 사용되고 있다. 그러나 일반적으로 GPS는 수신 오류율로 인해 사용자의 위치 좌표가 부정확하게 수신될 수 있다. 또한 많은 양의 좌표로 구성된 GPS 이력을 기반으로 이동 경로를 계산할 경우 높은 시간 복잡도를 보일 수 있다. 본 논문에서는 이러한 단점을 개선하기 위해서 근거리 영역에서의 효과적인 이동 경로 학습 기법을 제안한다. 본 기법은 GPS 좌표의 오류 검출, 이동 궤적의 단순화, 경로 결정의 세 단계로 구성된다. GPS 좌표의 오류 검출은 이웃하는 좌표간의 속도, 각도 및 와이파이 신호의 강도 차이를 통하여 부정확하게 수신된 좌표를 검출하고, 이동궤적의 단순화는 수신된 좌표 중에서 이동 궤적의 특징을 잘 반영하는 좌표를 결정하며, 경로의 유사성 검출은 개인 경로 인지를 위해 유사성이 높은 이동 궤적을 선별하는 과정이다. 본 논문에서 제안하는 기법은 특히 학교와 같은 근거리 범위 내에서 개인 이동 경로를 파악하는데 효과적으로 적용될 수 있다. Intelligent system should recognize users' current locations for providing location based service. Therefore, personal routes moving each person to specific places are good resources for location based service. In order to learn personal routes, data which present users' locations and trajectory are positively necessary. GPS coordinates are mostly utilized for recognizing users' locations. However, users' location coordinates might be incorrectly detected because GPS has an error of receive about 50 meter. In addition, the processing of route learning based on GPS history composed to many coordinates requires high time complexity. In this paper, we propose an approach of personal route learning improving these weak points. This approach consists of GPS noise detecting, trajectories simplification and personal route decision. The step of GPS noise detecting removes incorrect GPS coordinates detected by the difference of velocity, angle and WiFi strength between neighbor coordinates. The step of trajectories simplification decides coordinates which reflect features of a user's trajectory and the step of personal rout decision make each other trajectories taking high similarity a cluster. In this paper, the proposed approach is suitable for recognizing personal routes in close range as like universities.