• Title/Summary/Keyword: GPS Node

Search Result 97, Processing Time 0.03 seconds

Unified Index for Managing of Current Data and Past Trajectory of Moving Object Information (과거 및 현재 정보의 통합 관리를 위한 이동체 색인 기법)

  • Lee, Yang-Koo;Lee, Eung-Jae;Nam, Kwang-Woo;Ryu, Keun-Ho
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2003.11a
    • /
    • pp.153-158
    • /
    • 2003
  • 최근 이동 통신 기술과 GPS 기술의 발달은 실시간으로 이동하는 차량이나 비행기 등과 같은 이동 객체의 위치 정보 서비스를 가능하게 하였고, 이로 인해 이동 객체의 정보를 빠르게 검색하고 저장하기 위한 기술에 대한 연구가 활발히 진행되고 있다. 지금까지의 연구는 이동 객체의 과거 궤적 정보, 현재 및 미래 정보를 다루기 위한 구조가 각각 분리되어 연구되어 왔다. 하지만 이동객체는 시간의 흐름에 따라 연속적으로 변화하기 때문에 과거 정보와 현재 정보를 별도로 관리할 경우, 빈번한 위치 갱신이 발생하는 이동 객체의 환경에서는 심각한 처리비용이 요구된다. 따라서 이 논문에서는 이동 객체의 위치 정보를 효과적으로 관리하기 위하여 이동 객체의 과거 궤적정보 뿐만 아니라 현재의 정보까지도 하나의 색인 내에 통합하여 관리하는 방법을 제안한다. 제안된 방법에서는 범위 질의와 같은 좌표 기반의 질의뿐만 아니라 이동 객체의 궤적과 관련된 질의까지도 처리 가능하도록 기존의 TB-tree를 확장한다 또한 기존의 이동 객체 관리 기법들에서 처리하던 이동 객체의 궤적 정보를 저장하기 위한 방법을 개선하여 이동 객체 위치 정보의 중복저장 문제를 해결하고, 전체 색인의 크기를 크게 줄일 수 있는 방법을 제안한다. 그리고 현재 정보의 관리를 통해 새로운 데이터 삽입 시 방문하는 node의 수를 줄이고, 삽입 시간을 단축하는 방법을 제시한다.

  • PDF

A Routing Metric to Improve Route Stability in Mobile Wireless Sensor Networks

  • XU, Yi-Han;WU, Yin;SONG, Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2245-2266
    • /
    • 2016
  • The hop count routing metric is widely used in routing protocols of Wireless Sensor Networks (WSNs) due to its simplicity and effectiveness. With a lower hop count route, fewer transmissions are required to send a packet from the source to the destination. This can improve the throughput of a network because fewer transmissions results in less channel contention and interference. Despite this, the hop count routing metric may not be ideal for mobile scenarios where the topology of a network changes constantly and rapidly. In this paper, we propose to increase route stability in mobile WSNs by discovering paths that are more stable during route discoveries using routing metrics. Two routing metrics were proposed, the true beauty of these routing metrics lies in the fact that they can even be used even without specialized hardware such as GPS and other sensors. We implemented the proposed routing metrics in the AODV routing protocol and found that they are highly effective and outperform other stability-based routing metrics and the hop count routing metric.

A WSN-based Safety Management System in School-Zone (무선센서네트워크 기반의 스쿨존 안전관리 시스템)

  • Lee, Chang-Bok;Lee, Jin-Kwan;Park, Sang-Jun;Lee, Jong-Chan;Park, Ki-Hong
    • Convergence Security Journal
    • /
    • v.9 no.1
    • /
    • pp.19-27
    • /
    • 2009
  • In this paper, we propose a safety management system which prevents the occurrence of crime and accident from rising in school neighborhood. This system offers a monitoring method for safety of children which make intelligent space from environment and location sensing data through wireless communication between sensors attached to children and fixed sensor network in school neighborhood. Also, We propose a strategic safety management plan using opportunistic network when node is out of school zone network. Many students can easily receive the service of low cost from WSN-based School zone network than existing service from GPS individually by using our scheme.

  • PDF

Traffic Information Service Model Considering Personal Driving Trajectories

  • Han, Homin;Park, Soyoung
    • Journal of Information Processing Systems
    • /
    • v.13 no.4
    • /
    • pp.951-969
    • /
    • 2017
  • In this paper, we newly propose a traffic information service model that collects traffic information sensed by an individual vehicle in real time by using a smart device, and which enables drivers to share traffic information on all roads in real time using an application installed on a smart device. In particular, when the driver requests traffic information for a specific area, the proposed driver-personalized service model provides him/her with traffic information on the driving directions in advance by predicting the driving directions of the vehicle based on the learning of the driving records of each driver. To do this, we propose a traffic information management model to process and manage in real time a large amount of online-generated traffic information and traffic information requests generated by each vehicle. We also propose a road node-based indexing technique to efficiently store and manage location-based traffic information provided by each vehicle. Finally, we propose a driving learning and prediction model based on the hidden Markov model to predict the driving directions of each driver based on the driver's driving records. We analyze the traffic information processing performance of the proposed model and the accuracy of the driving prediction model using traffic information collected from actual driving vehicles for the entire area of Seoul, as well as driving records and experimental data.

Design and Implementation of Unified Index for Moving Objects Databases (이동체 데이타베이스를 위한 통합 색인의 설계 및 구현)

  • Park Jae-Kwan;An Kyung-Hwan;Jung Ji-Won;Hong Bong-Hee
    • Journal of KIISE:Databases
    • /
    • v.33 no.3
    • /
    • pp.271-281
    • /
    • 2006
  • Recently the need for Location-Based Service (LBS) has increased due to the development and widespread use of the mobile devices (e.g., PDAs, cellular phones, labtop computers, GPS, and RFID etc). The core technology of LBS is a moving-objects database that stores and manages the positions of moving objects. To search for information quickly, the database needs to contain an index that supports both real-time position tracking and management of large numbers of updates. As a result, the index requires a structure operating in the main memory for real-time processing and requires a technique to migrate part of the index from the main memory to disk storage (or from disk storage to the main memory) to manage large volumes of data. To satisfy these requirements, this paper suggests a unified index scheme unifying the main memory and the disk as well as migration policies for migrating part of the index from the memory to the disk during a restriction in memory space. Migration policy determines a group of nodes, called the migration subtree, and migrates the group as a unit to reduce disk I/O. This method takes advantage of bulk operations and dynamic clustering. The unified index is created by applying various migration policies. This paper measures and compares the performance of the migration policies using experimental evaluation.

Design and Implementation of Location Based Seamless Handover for IEEE 802.11s Wireless Mesh Networks (IEEE 802.11s 무선 메쉬 네트워크를 위한 위치 기반 핸드오버의 설계 및 구현)

  • Lee, Sung-Han;Yang, Seung-Chur;Kim, Jong-Deok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.10
    • /
    • pp.2004-2010
    • /
    • 2009
  • The characteristic of the backbond for distribution service in WMNs(Wireless Mesh Networks) is that WMNs has multiple links connected to mesh points and dynamic routing protocol such as AODV to establish routing paths. When the terminal is communicating with the service through new AP, mobile nodes can resume communication by setting only the link between new AP and mobile node in the case of existing WLANs, but WMNs needs path establishment process in multihop networks. Our goal in this paper is to support the seamless communication service by eliminating path establishment delay in WMNs. We present the method that eliminates the handover latency by predicting the location of handover using GPS information and making the paths to their destination in advance. We implement mesh nodes using embedded board that contains proposed handover method and evaluate performance of handover latency. Our experiment shows that handover delay time is decreased from 2.47 to 0.05 seconds and data loss rate is decreased from 20~35% in the existing method to 0~10% level.

Cluster-based Geocasting Protocol in Ad-hoc Networks (애드 혹 네트워크에서 클러스터 기반 지오캐스팅 프로토콜)

  • Lee Jung-Hwan;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5A
    • /
    • pp.407-416
    • /
    • 2005
  • This paper suggests a new geocasting protocol which is used to transfer the geographic packets to the specific region in MANET. Geocasting protocol is basically different from the conventional multicasting protocol that needs group addition and maintenance. A geocasting protocol using the mobile node's position information is the new area of multicasting protocols. The existing geocasting protocols have the following problems; it may be impossible to transfer data to some mobile hosts even if there are alternate routes and they have low adaptability and efficiency when the number of mobile hosts increases. The proposed CBG (Cluster-Based Geocasting) uses the proactive routing strategy and clustering technique with mobile host's location information. The CBG achieves high successful data transmission ratio and low data delivery cost to mobile hosts at specific region.

A Study on the Seismic Resistance Design of Sway Brace Device using Internet of Things (IoT를 활용한 흔들림 방지 버팀대의 내진설계에 관한 연구)

  • Thak, Sung-In;Yu, Bong-Geun;Son, Bong-Sei
    • Fire Science and Engineering
    • /
    • v.31 no.1
    • /
    • pp.58-62
    • /
    • 2017
  • There is a growing need for seismic resistance design. But it is controversial that standards of sway brace device in non-structural elements for buildings like pump waterway is vary widely. Therefore, in this study to get a valid range of sway brace device in seismic resistance design, using load test of sway brace device. As a result, load of safe range from 0 to 18.5 kN and under 29.4 kN, no structural fault of sway brace device. And using internet of things get a data of seismic resistance design from sensor node like accelerometer, GPS, tilt sensor and temperature sensor through steps of sampling and prediction. These results will be acceptable for monitoring system for seismic resistance in non-structural elements.

Path Loss Exponent Estimation for Indoor Wireless Sensor Positioning

  • Lu, Yu-Sheng;Lai, Chin-Feng;Hu, Chia-Cheng;Huang, Yueh-Min;Ge, Xiao-Hu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.3
    • /
    • pp.243-257
    • /
    • 2010
  • Rapid developments in wireless sensor networks have extended many applications, hence, many studies have developed wireless sensor network positioning systems for indoor environments. Among those systems, the Global Position System (GPS) is unsuitable for indoor environments due to Line-Of-Sight (LOS) limitations, while the wireless sensor network is more suitable, given its advantages of low cost, easy installation, and low energy consumption. Due to the complex settings of indoor environments and the high demands for precision, the implementation of an indoor positioning system is difficult to construct. This study adopts a low-cost positioning method that does not require additional hardware, and uses the received signal strength (RSS) values from the receiver node to estimate the distance between the test objects. Since many objects in indoor environments would attenuate the radio signals and cause errors in estimation distances, knowing the path loss exponent (PLE) in an environment is crucial. However, most studies preset a fixed PLE, and then substitute it into a radio propagation loss model to estimate the distance between the test points; such method would lead to serious errors. To address this problem, this study proposes a Path Loss Exponent Estimation Algorithm, which uses only four beacon nodes to construct a radio propagation loss model for an indoor environment, and is able to provide enhanced positioning precision, accurate positioning services, low cost, and high efficiency.

Dynamic Cell Leveling to Support Location Based Queries in R-trees (R-tree에서 위치 기반 질의를 지원하기 위한 동적 셀 레벨링)

  • Jung, Yun-Wook;Ku, Kyong-I;Kim, Yoo-Sung
    • Journal of Korea Spatial Information System Society
    • /
    • v.6 no.2 s.12
    • /
    • pp.23-37
    • /
    • 2004
  • Location Based Services(LBSs) in mobile environments become very popular recently. For efficient LBSs, spatial database management systems must need a spatial indexing scheme such as R-trees in order to manage the huge spatial database. However, it may need unnecessary disk accesses since it needs to access objects which are not actually concerned to user's location-based queries. In this paper, to support the location-based queries efficiently, we propose a CLR-tree(Cell Leveling R-tree) in which a dynamic cell is built up within the minimum bounding rectangle of R-trees' node. The cell level of nodes is compared with the query's cell level in location-based query processing and determines the minimum search space. Also, we propose the insertion, split, deletion, and search algorithms for CRL-trees. From the experimental results, we see that a CLR-tree is able to decrease $5{\sim}20%$ of disk accesses from those of R-trees. So, a CLR-tree can be used for fast accessing spatial objects to user's location-based queries in LBSs.

  • PDF