• Journal of the Korea Society of Computer and Information
• /
• v.9 no.1
• /
• pp.87-93
• /
• 2004

In the design of mobile wireless communication network, BSC(Base Station Location), BSC(Base Station Controller) and MSC(Mobile Switching Center) are the most important parameters. Designing base station location, the cost must be minimized by combining various, complex parameters. We can solve this Problem by combining optimization algorithm, such as Simulated Annealing, Tabu Search, Genetic Algorithm, Random Walk Algorithm that have been used extensively for global optimization. This paper shows the 4 kinds of algorithm to be applied to the optimization of base station location for communication system and then compares, analyzes the results and shows optimization process of algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.665-683
• /
• 2011

Wireless sensor networks (WSN) consist of a large amount of sensor nodes distributed in a certain region. Due to the limited battery power of a sensor node, lots of energy-efficient schemes have been studied. Clustering is primarily used for energy efficiency purpose. However, clustering in WSNs faces several unattained issues, such as ensuring connectivity and scheduling inter-cluster transmissions. In this paper, we propose a location-based spiral clustering (LBSC) algorithm for improving connectivity and avoiding inter-cluster collisions. It also provides reliable location aware routing paths from all cluster heads to a sink node during cluster formation. Proposed algorithm can simultaneously make clusters in four spiral directions from the center of sensor field by using the location information and residual energy level of neighbor sensor nodes. Three logical addresses are used for categorizing the clusters into four global groups and scheduling the intra- and inter-cluster transmission time for each cluster. We evaluated the performance with simulations and compared it with other algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.7
• /
• pp.1715-1722
• /
• 2010

In this paper we consider methods for selecting the next tracing node that take advantage of the history of traced positions during the packet-tracing. In the meantime, the proposed routing strategy that counters the tracing is to design the routing path is such a way that nodes on it are not close to the nodes whose location privacy is needed and zigzag or back-and-forth movements hardly take place. In simulations, the ratios of successful tracing were largely improved. It was shown that our routing scheme allows more data packets to be delivered to the destination while, enticing the tracer to move more long distances in the presence of multiple assets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.213-224
• /
• 2009

Most of existing routing methods in wireless sensor networks to counter the local eavesdropping-based packet-tracing deal with a single asset and suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. Recently, the author proposed a routing method, GSLP-w(GPSR-based Source-Location Privacy with crew size w), that enhances location privacy of the packet-originating node(i.e., active source) in the presence of multiple assets, yet taking a path of not too long. In this paper, we present a refined routing(i.e., next-hop selection) procedure of it and empirically study privacy strength and delivery latency with varying the crew size w(i.e., the number of packets being sent per path). It turns out that GSLP-w offers the best privacy strength when the number of packets being sent per path is randomly chosen from the range [$1,h_{s-b}/4$] and that further improvements on the privacy are achieved by increasing the random walk length TTLrw or the probability prw that goes into random walk(where, $h_{s-b}$ is the number of hops of the shortest path between packet-originating node s and sink b).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.846-849
• /
• 2008

In recent years there has been growing interest in wireless sensor networks (WSNs) for a variety of indoor applications. In this paper, we present the RSSI-based localization in indoor environments. In order to evaluate the relationship between distance and RSSI, the log-normal path loss shadowing model is used. By tagging users with a sensor node and deploying a number of nodes at fixed position in the building, the RSSI can be used to determine the position of tagged user. This system operates by recording and processing signal strength information at the base stations. It combines Euclidean distance technique with signal strength matrix obtained during real-time measurement to determine the location of user. The experimental results presented the ability of this system to estimate user's location with a accuracy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.847-856
• /
• 2013

This paper presents an AP placement technique considering indoor location-awareness and examines its performance. The proposed AP placement technique is addressed from three performance metrics: location-awareness and AP-based wireless network performance as well as its cost. The proposed AP placement technique consists of meta-heuristic algorithms that yield a near optimal AP configuration for given performance metrics, and deterministic algorithms that improve the fast convergence of the near optimal AP configuration. The performance of the AP placement technique presented in this paper is measured under the environments simulating indoor space, and numerical results obtained by experimental evaluation yield the fast convergence of a near-optimal solution to a given performance metric.

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

• The Journal of Information Technology
• /
• v.5 no.4
• /
• pp.165-171
• /
• 2002

We propose Dynamic Circle Location Register (DCLR) scheme where each visiting location register (VLR) has a given fixed circle registration area around itself and has IDs of other VLRs in this circle area. Whenever a terminal moves to another registration area (RA), system computes whether the terminal is located in the current DCLR area and sends the recent location information of terminal to the old or new DCLR according to computing results. Also, according to change DCLR circle dynamically, we can track terminal location by querying DCLR of the current terminal when a call originates. The our scheme solves the HLR bottleneck due to the terminals frequent RA crossings and distributes the registration traffic to each of the local signaling transfer point (LSTP) area in wireless communications (WC)

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.2
• /
• pp.181-188
• /
• 2013

In this paper, we present a system design for location determination inside the ship. Since the GPS signal can not be received in the interior of the large vessel, we use the vessel wireless AP (Access Point) RSSI (received signal strength indication) to accurately measure the position. We convert the RSSI for the 3 AP's into distance through the Friis formula and get the location through triangulation. The signal strength varies irregularly due to noise making it difficult to obtain the exact location. Thus Kalman filter is used to real-time position correction, that is store in a server database.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.11 no.1
• /
• pp.1-9
• /
• 2012

In this paper, we proposed a method of improving the location estimation error existing in RTLS (Real Time Location Service) system for the individual mobility. As ubiquitous age comes, interest for indoor location tracking system is getting more increased. However, existing indoor location tracking system does not correspond actively to frequent changes in indoor environment, and there is a problem that correct location measurement of moving object is difficult due to NLOS (non-line-of-sight) property of indoor environment. Purpose of this paper is to propose an environment accommodation location tracking system that improves the location precision of moving object and grasps location of the object effectively, which is essential an element effectively to provide service and satisfy various users' request.