• Title/Summary/Keyword: Time-based location update

Search Result 62, Processing Time 0.025 seconds

An Implementation of Travel Information Service Using VoiceXML and GPS (VoiceXML과 GPS를 이용한 여행정보 서비스의 구현)

  • Oh, Jae-Gyu;Kim, Sun-Hyung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.6
    • /
    • pp.1443-1448
    • /
    • 2007
  • In this paper, we implement a distributed computing environment-based travel information service that can use web(internet) and speech interface at the same time and can apply location information, using voice and web browser-based VoiceXML and GPS, to escape the limitations of traditional web(internet)-based travel information services. Because of IVR(Interactive Voice Response) of traditional call center has operated to a pre-installation scenario, it takes much a service time and has the inconveniences that must repeat speech recording according to the revised scenarios in case change response contents. However, suggested VoiceXML and GPS-based travel information service system has advantages that reorganization of system setups is easy, because it consists of the method to update server after make individual conversation scenarios by file format(document), and can provide usefully various travel information in environmental restriction conditions such as the back regions environment, according as our prototype find user's present location using GPS information and then provide various travel information service by this information.

  • PDF

TPKDB-tree : An Index Structure for Efficient Retrieval of Future Positions of Moving Objects (TPKDB 트리 : 이동 객체의 효과적인 미래 위치 검색을 위한 색인구조)

  • Seo Dong Min;Bok Kyoung Soo;Yoo Jae Soo;Lee Byoung Yup
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.624-640
    • /
    • 2004
  • Recently, with the rapid development of location-based techniques, index structures to efficiently manage moving objects have been required. In this paper, we propose a new spatio-temporal index structure that supports a future position retrieval and minimizes a update cost. The proposed index structure combines an assistant index structure that directly accesses current positions of moving objects with KDB-tree that is a space partitioning access method. The internal node in our proposed index structure keeps time parameters in order to support the future position retrieval and to minimize a update cost. Moreover, we propose new update and split methods to maximize the space utilization and the search performance. We perform various experiments to show that our proposed index structure outperforms the existing index structure.

Improving Transmission Performance of Real Time Traffic in HMIPv6 (HMIPv6에서 실시간 트래픽의 전송 성능 향상 방안)

  • Park, Won-Gil;Kim, Byung-Gi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11B
    • /
    • pp.960-968
    • /
    • 2006
  • HMIPv6 improved the handover management of basic MIPv6 by introducing the new protocol agent MAP. In this new protocol, MAP instead of the Mobile Node intercepts all packets and redirects the packets to CoA of the Mobile Node. However, this process may degrade the network performance due to the centralization phenomenon of registration occurring in the hierarchical MAP structure. ffe propose two schemes to improve real time traffic performance. First proposal is a MAP selection mettled in which MAP is selected based on traffic characteristics. And we also propose differentiated traffic processing scheme with multi-level queues when Home Agent or Correspondent Nodes process Binding Update messages. Performances of the proposed scheme are analyzed. Analysis result shows that our model has good performance in the respect of location update cost and total cost of Mobile Nodes.

Route Optimization Scheme for Mobile Content Sources in Content Centric Networking

  • Lee, Jihoon;Rhee, Eugene
    • Journal of information and communication convergence engineering
    • /
    • v.18 no.1
    • /
    • pp.22-27
    • /
    • 2020
  • Content centric networking (CCN) is regarded as promising internet architecture because it can provide network efficiency in terms of bandwidth consumption by separating contents from a specific network location and decrease network congestion events. However, the application of a CCN does not widely consider the side effects of mobile devices, particularly mobile content sources. For content source mobility, a full routing update is required. Therefore, in this study, a route optimization scheme is proposed for mobile content sources in a CCN environment to provide low communication overhead, short download time, and low resource consumption. The proposed scheme establishes a direct path between content requesters and a mobile content source for the exchange of interest and data packets using interest-piggybacked data packets. Based on the inherent CCN naming characteristics, the content source does not know the name prefix of the content consumer, and thus the proposed optimized CCN scheme utilizes the content router in the home domain of the content source.

A Study on Optimizing User-Centered Disaster and Safety Information Application Service

  • Gaeun Kim;Byungjoo Park
    • International journal of advanced smart convergence
    • /
    • v.12 no.4
    • /
    • pp.35-43
    • /
    • 2023
  • This paper emphasizes that information received in disaster situations can lead to disparities in the effectiveness of communication, potentially causing damage. As a result, there is a growing demand for disaster and safety information among citizens. A user-centered disaster and safety information application service is designed to address the rapid dissemination of disaster and safety-related information, bridge information gaps, and alleviate anxiety. Through the Open API (Open Application Programming Interface), we can obtain clear information about the weather, air quality, and guidelines for disaster-related actions. Using chatbots, we can provide users with information and support decision-making based on their queries and choices, utilizing cloud APIs, public data portal open APIs, and solution knowledge bases. Additionally, through Mashup techniques with the Google Maps API and Twitter API, we can extract various disaster-related information, such as the time and location of disaster occurrences, update this information in the disaster database, and share it with users.

Development of a Real-Time Mobile GIS using the HBR-Tree (HBR-Tree를 이용한 실시간 모바일 GIS의 개발)

  • Lee, Ki-Yamg;Yun, Jae-Kwan;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.6 no.1 s.11
    • /
    • pp.73-85
    • /
    • 2004
  • Recently, as the growth of the wireless Internet, PDA and HPC, the focus of research and development related with GIS(Geographic Information System) has been changed to the Real-Time Mobile GIS to service LBS. To offer LBS efficiently, there must be the Real-Time GIS platform that can deal with dynamic status of moving objects and a location index which can deal with the characteristics of location data. Location data can use the same data type(e.g., point) of GIS, but the management of location data is very different. Therefore, in this paper, we studied the Real-Time Mobile GIS using the HBR-tree to manage mass of location data efficiently. The Real-Time Mobile GIS which is developed in this paper consists of the HBR-tree and the Real-Time GIS Platform HBR-tree. we proposed in this paper, is a combined index type of the R-tree and the spatial hash Although location data are updated frequently, update operations are done within the same hash table in the HBR-tree, so it costs less than other tree-based indexes Since the HBR-tree uses the same search mechanism of the R-tree, it is possible to search location data quickly. The Real-Time GIS platform consists of a Real-Time GIS engine that is extended from a main memory database system. a middleware which can transfer spatial, aspatial data to clients and receive location data from clients, and a mobile client which operates on the mobile devices. Especially, this paper described the performance evaluation conducted with practical tests if the HBR-tree and the Real-Time GIS engine respectively.

  • PDF

Localization Algorithm for a Mobile Robot using iGS (iGS를 이용한 모바일 로봇의 실내위치추정 알고리즘)

  • Seo, Dae-Geun;Cho, Sung-Ho;Lee, Jang-Myung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.3
    • /
    • pp.242-247
    • /
    • 2008
  • As an absolute positioning system, iGS is designed based on ultrasonic signals whose speed can be formulated clearly in terms of time and room temperature, which is utilized for a mobile robot localization. The iGS is composed of an RFID receiver and an ultra-sonic transmitter, where an RFID is designated to synchronize the transmitter and receiver of the ultrasonic signal. The traveling time of the ultrasonic signal has been used to calculate the distance between the iGS system and a beacon which is located at a pre-determined location. This paper suggests an effective operation method of iGS to estimate position of the mobile robot working in unstructured environment. To expand recognition range and to improve accuracy of the system, two strategies are proposed: utilization of beacons belonging to neighboring blocks and removal of the environment-reflected ultrasonic signals. As the results, the ubiquitous localization system based on iGS as a pseudo-satellite system has been developed successfully with a low cost, a high update rate, and relatively high precision.

Improved Exploration Algorithm Using Reliability Index of Thinning Based Topological Nodes

  • Kwon, Tae-Bum;Song, Jae-Bok;Lee, Soo-Yong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.250-255
    • /
    • 2005
  • For navigation of a service robot, mapping and localization are very important. To estimate the robot pose, the map of the environment is required and it can be built by exploration or SLAM. Exploration is the fundamental task of guiding a robot autonomously during mapping such that it covers the entire environment with its sensors. In this paper, an efficient exploration scheme based on the position probability of the end nodes of a topological map is proposed. In this scheme, a topological map is constructed in real time using the thinning-based approach. The robot then updates the position probability of each end node maintaining its position at the current location based on the Bayesian update rule using the range data. From this probability, the robot can determine whether or not it needs to visit the specific end node to examine the environment around this node. Various experiments show that the proposed exploration scheme can perform exploration more efficiently than other schemes in that, in most cases, exploration for the entire environment can be completed without directly visiting everywhere in the environment.

  • PDF

Analytical Approach of New Random-walk Based Mobility Management Scheme in IP-based Mobile Networks

  • Song, Myungseok;Cho, Jun-Dong;Jeong, Jongpil
    • International Journal of Advanced Culture Technology
    • /
    • v.2 no.1
    • /
    • pp.1-13
    • /
    • 2014
  • In next-generation wireless networks, provisioning of IP-based network architecture and seamless transmission services are very important issues for mobile nodes. For this reason, a mobility management mechanism to support global roaming is highly regarded. These technologies bring a broader life by using a global roaming account through the connection of multiple devices or technology to mobile users; they also provide real-time multimedia services. This paper presents a comprehensive performance analysis of fast handover for hierarchical mobile IPv6 (F-HMIPv6), hierarchical mobile IPv6 (HMIPv6), Proxy Mobile IPv6 (PMIPv6), and fast Proxy Mobile IPv6 (FPMIPv6) using the fluid-flow model and random-walk model. As a result, the location update cost of the PMIPv6 and FPMIPv6 is better than that of HMIPv6 and F-HMIPv6. These results suggest that the network-based mobility management technology is superior to the hierarchical mobility management technology in the mobility environment.

A Localization Algorithm for Underwater Wireless Sensor Networks Based on Ranging Correction and Inertial Coordination

  • Guo, Ying;Kang, Xiaoyue;Han, Qinghe;Wang, Jingjing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.10
    • /
    • pp.4971-4987
    • /
    • 2019
  • Node localization is the basic task of underwater wireless sensor networks (UWSNs). Most of the existing underwater localization methods rely on ranging accuracy. Due to the special environment conditions in the ocean, beacon nodes are difficult to deploy accurately. The narrow bandwidth and high delay of the underwater acoustic communication channel lead to large errors. In order to reduce the ranging error and improve the positioning accuracy, we propose a localization algorithm based on ranging correction and inertial coordination. The algorithm can be divided into two parts, Range Correction based Localization algorithm (RCL) and Inertial Coordination based Localization algorithm (ICL). RCL uses the geometric relationship between the node positions to correct the ranging error and obtain the exact node position. However, when the unknown node deviates from the deployment area with the movement of the water flow, it cannot communicate with enough beacon nodes in a certain period of time. In this case, the node uses ICL algorithm to combine position data with motion information of neighbor nodes to update its position. The simulation results show that the proposed algorithm greatly improves the positioning accuracy of unknown nodes compared with the existing localization methods.