• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.179-186
• /
• 2008

The converge of location-aware devices, GIS functionalities and the increasing accuracy and availability of positioning technologies pave the way to a range of new types of location-based services. The field of spatiotemporal data mining where relationships are defined by spatial and temporal aspect of data is encountering big challenges since the increased search space of knowledge. Therefore, we aim to propose algorithms for mining spatiotemporal patterns in mobile environment in this paper. Moving patterns are generated utilizing two algorithms called All_MOP and Max_MOP. The first one mines all frequent patterns and the other discovers only maximal frequent patterns. Our proposed approach is able to reduce consuming time through comparison with DFS_MINE algorithm. In addition, our approach is applicable to location-based services such as tourist service, traffic service, and so on.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.217-219
• /
• 2006

4G mobile networks are expected to support various multimedia services over IP networks and also satisfy high spectral efficiency requirement. In cellular systems including 4G networks, hotspot cells can occur when available wireless resources at some location are not enough to sustain the needs of users. The hotspot cell can potentially lead to blocked and dropped calls, which can deteriorate the service quality for users. In a 4G mobile network, a band of users enjoying multimedia services can move around, which may generate heavy flows of traffic load. This situation can generate the hotspot cell which has a short life span of only a few minutes. In this paper, we propose a handover-based scheme which can effectively manage hotspot cells in 4G mobile networks. With the scheme, the current serving cell can recognize the load status of the target cell in advance before handover execution. Adaptive handover time control according to the amount of traffic load of cells can effectively and flexibly manage the hotspot cell in the network. And, through our hotspot cell management scheme, acceptable service quality can be supported as users continuously maintain connections with the network. In the simulation results, we find that our scheme generates smaller number of hotspot cells and supports higher service quality than the compared schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3474-3497
• /
• 2016

Network Function Virtualization (NFV) and Software Defined Networking (SDN) are recently considered as very promising drivers of the evolution of existing middlebox services, which play intrinsic and fundamental roles in today's networks. To address the virtual service deployment issues that caused by introducing NFV or SDN to networks, this paper proposes an optimal solution by combining quantum genetic algorithm with cooperative game theory. Specifically, we first state the concrete content of the service deployment problem and describe the system framework based on the architecture of SDN. Second, for the service location placement sub-problem, an integer linear programming model is built, which aims at minimizing the network transport delay by selecting suitable service locations, and then a heuristic solution is designed based on the improved quantum genetic algorithm. Third, for the service amount placement sub-problem, we apply the rigorous cooperative game-theoretic approach to build the mathematical model, and implement a distributed algorithm corresponding to Nash bargaining solution. Finally, experimental results show that our proposed method can calculate automatically the optimized placement locations, which reduces 30% of the average traffic delay compared to that of the random placement scheme. Meanwhile, the service amount placement approach can achieve the performance that the average metric values of satisfaction degree and fairness index reach above 90%. And evaluation results demonstrate that our proposed mechanism has a comprehensive advantage for network application.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.41-51
• /
• 2003

The spatiotemporal database concerns about the time-varying spatial attributes. One of the important research areas is related to the support of various location-based services in motile communication environments. It is known that database systems may be difficult to manage the accurate geometric locations of moving objects due to their continual changes of locations. However, this requirement is necessary in various spatiotemporal applications including mobile communications, traffic control and military command and control (C2) systems. In this paper we propose the $B^{st}$-tree that utilizes the concept of multi-version B-trees. It provides an indexing method (or the historical and future range query Processing on moving object's trajectories. Also we present a dynamic version management algorithm that determines the appropriate version evolution induced by the mobility patterns to keep the query performance. With experiments we .;hi)w that our indexing approach is a viable alternative in this area.

• Journal of the Society of Disaster Information
• /
• v.20 no.2
• /
• pp.339-350
• /
• 2024

Purpose: This study analyzes accessibility of 10 hydrogen charging stations in Seoul and identifies areas that were difficult to access. The purpose is to re-analyze accessibility by adding a new location in terms of equity and safety of location placement, and then draw implications by comparing the improvement effects. Method: By applying the location-allocation model and the service area model based on network analysis of the ArcGIS program, areas with weak access were identified. The location selection method applied the 'Minimize Facilities' method in consideration of the need for rapid arrival to insufficient hydrogen charging stations. The limit distance for arrival within a specific time was analyzed by applying the average vehicle traffic speed(23.1km/h, Seoul Open Data Square) in 2022 to three categories: 3,850m(10minutes), 5,775m(15minutes), 7,700m(20minutes). In order to minimize conflicts over the installation of hydrogen charging stations, special standards of the Ministry of Trade, Industry and Energy applied to derive candidate sites for additional installation of hydrogen charging stations among existing gas stations and LPG/CNG charging stations. Result: As a result of the analysis, it was confirmed that accessibility was significantly improved by installing 5 new hydrogen charging stations at relatively safe gas stations and LPG/CNG charging stations in areas where access to the existing 10 hydrogen charging stations is weak within 20 minutes. Nevertheless, it was found that there are still areas where access remains difficult. Conclusion: The location allocation model is used to identify areas where access to hydrogen charging stations is difficult and prioritize installation, decision-making to select locations for hydrogen charging stations based on scientific evidence can be supported.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.593-600
• /
• 2005

Recently, RFID system is a main technology to realize ubiquitous computing environments. Because RFID system that is an automatic identification technology using radio frequency is a system to read and write the data of the entity. Therefore, many companies are interested in RFID system to reduce supply chain management and inventory control cost. However, for providing secure service, RFID authentication technology secure against tracking by an adversary is researched first. In this paper, we proposed security level based RFID authentication protocol providing reduce computational and communicational workload in the back-end database. The proposed protocol is secure against reply attack, spoofing attack, traffic analysis, and location privacy, since the proposed protocol based on the security of the hash function.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.19-30
• /
• 2008

Recently, the query processing algorithm in the field of spatial network database(SNDB) has been attracted by many Interests. But, there is little research on route-based queries. Since the moving objects move only in spatial networks, the efficient route-based query processing algorithms, like in-route nearest neighbor(IRNN), are essential for Location-based Service(LBS) and Telematics application. However, the existing IRNN query processing algorithm has a problem that it does not consider traffic jams in the road network. In this thesis, we propose an IRNN query processing algorithm which considers space restriction. Finally, we show that space-constrained IRNN query processing algorithm is efficient compared with the existing IRNN algorithm.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.325-336
• /
• 2005

Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be 'inserted' in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately $\100%$ improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.2
• /
• pp.53-59
• /
• 2009

Integrating a field of transportation and IT is becoming a novel solution to social and economic problems which was previously focused on the investment in infrastructures. It also created new areas of industry such as ITS and telematics. Especially, vehicle communication is being considered very important and DSRC is also important in the field of rational ITS in recent. DSRC OBE has come into wide use through ETCS. In the field of traffic signal control, the research to implement an optimal traffic signal control system using a real-time information of good quality is being carried out and also the study of WISDOM was successfully completed. This paper shows the development of Dynamic-Dilemma zone warning service utilizing WISDOM and the evaluation of a reliability and a practicality through the field test. While the proposed Dynamic-Dilemma warning system transmits an information of signal time optimized by WISDOM, the OBE which receives this information makes dilemma zone based on its location and speed and gives warning to a driver.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.959-975
• /
• 2011

Wireless mesh networks enlarge the wireless coverage area by interconnecting relatively stationary wireless routers (mesh routers). As wireless mesh networks are envisioned to provide high-bandwidth broadband Internet service to a large community of users, the Internet gateway, which acts as a central point of Internet attachment for the mesh networks, is likely to suffer heavily from the scramble for shared wireless resources because of aggregated traffic toward the Internet. It causes performance decrement on end-to-end transmissions. We propose a scheme to balance the load in a mesh network based on link quality variation to different Internet gateways. Moreover, under the mesh coverage, mobile nodes can move around and connect to nearby mesh routers while still keeping the connections to the Internet through the best gateway in terms of link quality. In this structure, gateways perform the balancing procedure through wired links. Information about gateways and mobile node's location is distributed appropriately so that every mesh router can quickly recognize the best gateway as well as the positions of mobile nodes. This distributed information assists mobile nodes to perform fast handoff. Significant benefits are shown by the performance analysis.