• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.388-394
• /
• 2007

In wireless network, we propose a predictive location update scheme which considers mobile user's(MU's) mobility patterns. MU's mobility patterns can be found from a movement history data. The prediction accuracy and model complexity depend on the degree of application of history data. The more data we use, the more accurate the prediction is. As a result, the location management cost is reduced, but complexity of the model increases. In this paper, we classify MU's mobility patterns into four types. For each type, we find the respective optimal number of application of history data, and predictive location area by using the simulation. The optimal numbers of four types are shown to be different. When we use more than three application of history data, the simulation time and data storage are shown to increase very steeply.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1610-1613
• /
• 2002

This paper analyses the performance of PE-IPDL technique fer the wireless mobile position location, which have been considered as a major candidate for 3GPP position location due to its capability in mitigating the hearability problem and DOP problem. To improve the location performance of PE-IPDL, this paper introduces the high-resolution estimation technique for the first arrival multipath delay, and simulation results verify its superiority. For a systematic analysis of above location method, its performances are exploited by obeying the CODIT channel model specially bad urban channel environment. Simulation results verify its efficiency of enhancing the degree of accuracy in positioning.

• Journal of information and communication convergence engineering
• /
• v.10 no.3
• /
• pp.269-275
• /
• 2012

In this paper, we proposed a novel location estimation algorithm based on the concept of space-time signature matching in a moving target environment. In contrast to previous fingerprint-based approaches that rely on received signal strength (RSS) information only, the proposed algorithm uses angle, delay, and RSS information from the received signal to form a signature, which in turn is utilized for location estimation. We evaluated the performance of the proposed algorithm in terms of the average probability of error and the average error distance as a function of target movement. Simulation results confirmed the effectiveness of the proposed algorithm for location estimation even in moving target environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.211-214
• /
• 2009

This paper describes a location privacy control system. Also, we propose a model of location privacy control for national usage and system. This research is applicable to location privacy protection in commercial location-based services in wireless telecommunications, T-Money transtoration card system, GIS platform and provide system of variety service.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.597-611
• /
• 2009

With the advent of ubiquitous computing society, many advanced technologies have enabled wireless sensor networks which consist of small sensor nodes. However, the sensor nodes have limited computing resources such as small size memory, low battery life, short transmission range, and low computational capabilities. Thus, decreasing energy consumption is one of the most significant issues in wireless sensor networks. In addition, numerous applications for wireless sensor networks are recently spreading to various fields (health-care, surveillance, location tracking, unmanned monitoring, nuclear reactor control, crop harvesting control, u-city, building automation etc.). For many of them, supporting security functionalities is an indispensable feature. Especially in case wireless sensor networks should provide a sufficient variety of security functions, sensor nodes are required to have more powerful performance and more energy demanding features. In other words, simultaneously providing security features and saving energy faces a trade-off problem. This paper presents a novel energy-efficient security architecture in an IEEE 802.15.4-based wireless sensor network called the Hybrid Adaptive Security (HAS) framework in order to resolve the trade off issue between security and energy. Moreover, we present a performance analysis based on the experimental results and a real implementation model in order to verify the proposed approach.

• 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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.6
• /
• pp.225-236
• /
• 2003

In this paper, we propose a wireless scheduling algorithm to provide the Internet delay proportional differentiated services in wireless networks. For considering network environments that have burst and location-dependent channel errors, our proposed WDPS(Wireless Delay Proportional Service) scheduling algorithm adaptively serves packets in class queues based on the delivered delay performance for each class. The remarkable characteristics of WDPS scheduler are supporting a fair relative delay service, providing graceful throughput and delay compensation, and avoiding class queue blocking problem. Through simulations, we show that the algorithm achieves the desirable properties to provide delay proportional services in wireless networks.

• Journal of Positioning, Navigation, and Timing
• /
• v.9 no.2
• /
• pp.149-149
• /
• 2020

• IE interfaces
• /
• v.18 no.4
• /
• pp.382-389
• /
• 2005

Location management is very important issue in wireless communication system to trace mobile users' exact location. In this study, we propose a dynamic location area management scheme which determines the size of dynamic location area considering each user's characteristics. In determining the optimal location area size, we consider the measurement data as well as the historical data, which contains call arrival rate and average speed of each mobile user. In this mixture of data, the weight of historical data is derived by linear searching method which guarantees the minimal cost of location management. We also introduce the regularity index which can be calculated by using the autocorrelation of historical data itself. Statistical validation shows that the regularity index is the same as the weight of measurement data. As a result, the regularity index is utilized to incorporate the historical data into the measurement data. By applying the proposed scheme, the location management cost is shown to decrease. Numerical examples illustrate such an aspect of the proposed scheme.

• Journal of Korea Multimedia Society
• /
• v.25 no.8
• /
• pp.1069-1074
• /
• 2022

IP mobility can be handled in different layers of the protocol. Mobile IP has been proposed to handle the mobility of Internet hosts in the network layer. Recently, a new method based on the SIGMA mobility architecture has been proposed to support mobility management with reduced packet loss and latency. The location management structure is not suitable for frequent mobile handover due to the high mobility of the user with this transport layer solution. In this paper, we propose a location management optimization method in a mobile communication network by applying hierarchical location management using MMPs(Mobility Management Points) for transport layer mobility management. Therefore, we propose an efficient hierarchical mobility management structure even between heterogeneous wireless networks using MMPs for the probability that a mobile terminal can change multiple location areas between two messages and calls. The proposed method shows reduction in location update cost and data retrieval cost using MMPs, and as opposed to mobility appearing in time intervals with the minimum cost required to reach 90% of the stabilized cost, the mobility location update search, location It was found that the message processing cost per area was reduced.