• Title/Summary/Keyword: Route Location

Search Result 408, Processing Time 0.032 seconds

A Novel Route Discovery Scheme Equipped with Two Augmented Functions for Ad Hoc Networks

  • Lee Hae-Ryong;Shin Jae-Wook;Na Jee-Hyeon;Jeong Youn-Kwae;Park Kwang-Roh;Kim Sang-Ha
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.3 no.1
    • /
    • pp.15-24
    • /
    • 2004
  • 'The delay and control overhead during route discovery for destinations outside ad hoc networks are major obstacle to achieving scalability in the Internet. To solve this issue, we propose a novel route discovery scheme equipped with two augmented functions. In this paper, the Internet gateway maintains an address cache of Internet nodes frequently accessed from the ad hoc network and replies with an extended Route Response (RREP) message to the Route Request (RREQ) message based on its routing table and the address cache called EXIT(EXternal node Information Table). These augmented functions make the source node determine the location of the destination as fast as possible. Through simulations, the proposed route discovery scheme using both EXIT and extended RREP message shows considerable' reduction in both route discovery time and control message overhead.

  • PDF

Finding Frequent Route of Taxi Trip Events Based on MapReduce and MongoDB (택시 데이터에 대한 효율적인 Top-K 빈도 검색)

  • Putri, Fadhilah Kurnia;An, Seonga;Purnaningtyas, Magdalena Trie;Jeong, Han-You;Kwon, Joonho
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.4 no.9
    • /
    • pp.347-356
    • /
    • 2015
  • Due to the rapid development of IoT(Internet of Things) technology, traditional taxis are connected through dispatchers and location systems. Typically, modern taxis have embedded with GPS(Global Positioning System), which aims for obtaining the route information. By analyzing the frequency of taxi trip events, we can find the frequent route for a given query time. However, a scalability problem would occur when we convert the raw location data of taxi trip events into the analyzed frequency information due to the volume of location data. For this problem, we propose a NoSQL based top-K query system for taxi trip events. First, we analyze raw taxi trip events and extract frequencies of all routes. Then, we store the frequency information into hash-based index structure of MongoDB which is a document-oriented NoSQL database. Efficient top-K query processing for frequent route is done with the top of the MongoDB. We validate the efficiency of our algorithms by using real taxi trip events of New York City.

Particle Swarm Optimization for Snowplow Route Allocation and Location of Snow Control Material Storage (Particle Swarm Optimization을 이용한 제설차량 작업구간 할당 및 제설전진기지 위치 최적화)

  • Park, U-Yeol;Kim, Geun-Young;Kim, Sun-Young;Kim, Hee-Jae
    • Journal of the Korea Institute of Building Construction
    • /
    • v.17 no.4
    • /
    • pp.369-375
    • /
    • 2017
  • This study suggests PSO(Particle Swarm Optimization) algorithm that optimizes the snowplow route allocation and the location of the snow control material storage to improve the efficiency in snow removal works. The modified PSO algorithm for improving the search capacity is proposed, and this study suggests the solution representation, the parameter setting, and the fitness function for the given optimization problems. Computational experiments in real-world case are carried out to justify the proposed method and compared with the traditional PSO algorithms. The results show that the proposed algorithms can find the better solution than the traditional PSO algorithms by searching for the wider solution space without falling into the local optima. The finding of this study is efficiently employed to solve the optimization of the snowplow route allocation by minimizing the workload of each snowplow to search the location of the snow control material storage as well.

User Route analysis of using GPS on a Mobile Device and Moving Route Recommendation System (모바일장치의 GPS를 이용한 사용자 이동경로 분석 및 이동경로 추천 시스템)

  • Kim, Sun-Yong;Park, Bum-Jun;Jung, Jai-Jin
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.2
    • /
    • pp.135-141
    • /
    • 2011
  • Mobile communication technology in the field of ubiquitous computing is one of important technologies. The development of GPS technology in mobile communications technology and PDA, the vast majority of mobile devices such as smart phones also being equipped with GPS functionality. This user where they are located where they are based on the number of through services were able to receive information. In this paper, mounted on a mobile device user's location using GPS capabilities to track the migration routes and the accumulated user to determine the migratory path of the system used to recommend the proposed route of the proposed method and system Designs. The services offered by tracking the location of the user to move the user to route data to create and upload to the server. Upload a migration path to move data from where they currently reside to the user is recommended to go to your destination. The services offered by the users do not know where to travel or go to your destination, etc. If you do not remember the path can be useful.

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.

Route Tracking of Moving Magnetic Sensor Objects and Data Processing Module in a Wireless Sensor Network (무선 센서 네트워크에서의 자기센서기반 이동경로 추적과 데이터 처리 모듈)

  • Kim, Hong-Kyu;Moon, Seung-Jin
    • The KIPS Transactions:PartC
    • /
    • v.14C no.1 s.111
    • /
    • pp.105-114
    • /
    • 2007
  • In sensor network processing environments, current location tracking methods have problems in accuracy on receiving the transmitted data and pinpointing the exact locations depending on the applied methods, and also have limitations on decision making and monitoring the situations because of the lack of considering context-awareness. In order to overcome such limitations, we proposed a method which utilized context-awareness in a data processing module which tracks a location of the magnetic object(Magnetic Line Tracer) and controlled introspection data based on magnetic sensor. Also, in order to prove its effectiveness we have built a wireless sensor network test-bed and conducted various location tracking experiments of line tracer using the data and resulted in processing of context-aware data. Using the new data, we have analyzed the effectiveness of the proposed method for locating the information database entries and for controlling the route of line tracer depending on context-awareness.

Design and Implementation of A Location-based Energy-Efficient Routing Protocol using Quantity of Energy Consumed (에너지 사용량을 이용한 위치 기반 에너지 효율적인 라우팅 프로토콜 설계 및 구현)

  • Jang, You-Jin;Kim, Yong-Ki;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.12 no.1
    • /
    • pp.1-9
    • /
    • 2010
  • Recently, wireless sensor networks(WSNs) technology has been considered as one of the most critical issues in the ubiquitous computing age. The sensor nodes have limited battery power, so they should consume low energy through their operation for the long-lasting lifetime. Therefore, it is essential to use energy efficient routing protocol. For this, we propose a location-based energy-efficient routing protocol which constructs the energy efficient route by considering the quantity of Energy consumed. In addition, we propose a route reconstruction algorithm to handle the disconnection of message transmission. Finally, we show from performance analysis using TOSSIM that our protocol outperforms the existing location based routing protocols in terms of energy efficiency.

A Study on Location Recognition and Route Guide System for Service Robots (로봇을 위한 위치 인식 및 경로 안내 시스템에 관한 연구)

  • Kim, Yong-Min;Choe, In-Chan
    • 전자공학회논문지 IE
    • /
    • v.47 no.1
    • /
    • pp.12-21
    • /
    • 2010
  • In this paper, we suggest Location Recognition System using Sensor Network; it distinguishes locations. Furthermore, this paper proposes Intelligent Navigation System which presents the proper route for the user. INS evaluates the user's preference, tendency and environmental state using Sensor Network Module and current driving information. This system also uses Soft-computing method to learn and infer the person’s preference and tendency. This paper defines Intelligent Assistance Module (IAM) which is a connector in between a user and a robot; it is portable. All in all, we created a basic intelligent robot, Location Recognition System, and Environment Sensor Modules; we verified the proposed algorithm through computer simulations.

In-Route Nearest Neighbor Query Processing Algorithm with Time Constraint in Spatial Network Databases (공간 네트워크 데이터베이스에서 시간제약을 고려한 경로 내 최근접 질의처리 알고리즘)

  • Kim, Yong-Ki;Kim, Sang-Mi;Chang, Jae-Woo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.2
    • /
    • pp.196-200
    • /
    • 2008
  • Recently, the query processing algorithm in spatial network database (SNDB) has attracted many interests. However, there is little research on route-based query processing algorithm in SNDB. Since the moving objects moves only in spatial networks, the route-based algorithm is very useful for LBS and Telematics applications. In this paper, we analyze In-Route Nearest Neighbor (IRNN) query, which is an typical one of route-based queries, and propose a new IRNN query processing algorithm with time constraint. In addition, we show from our performance analysis that our IRNN query processing algorithm with time constraint is better on retrieval performance than the existing IRNN query processing one.

Geomulticast: Location based Multicast Routing Protocol using Route Stability in Mobile Ad-hoc Wireless Networks (지오멀티캐스트: 모바일 Ad-hoc 무선 네트워크에서 경로 안정성을 이용한 위치기반 멀티캐스트 라우팅 프로토콜)

  • Ha, Sue Hyung;Le, The Dung;An, Beongku
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.7
    • /
    • pp.191-201
    • /
    • 2013
  • In this paper, we propose a location based multicast routing protocol, called Geomulticast, in mobile ad-hoc wireless networks. The main features and contributions of the proposed geomulticast are as follows. First, support data transmission to only the specific mobile nodes within a target area. Second, establish stable routing route by using mobility information of nodes. Third, reduce control overhead, power for construction of routing route by using geomulticast guided line information. Fourth, present a theoretical model for establishing stable route. The performance evaluation of the proposed geomulticast is executed by using OPNET simulation and theoretical analysis, and the results of simulation and theoretical analysis have similar patterns. And we can see that data packets are efficiently transmitted to specific user groups within a specific area.