• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.266-274
• /
• 2003

One of the major issues in current on-demand routing protocols for ad hoc networks is the high resource consumed by route discovery traffic. In these protocols, flooding is typically used by the source to broadcast a route request (RREQ) packet in search of a route to the destination. Such network-wide flooding potentially disturbs many nodes unnecessarily by querying more nodes than is actually necessary, leading to rapid exhaustion of valuable network resources such as wireless bandwidth and battery power. In this paper, a simple optimization technique for efficient route discovery is proposed. The technique proposed herein is location-based and can be used in conjunction with the existing Location-Aided Routing (LAR) scheme to further reduce the route discovery overhead. A unique feature of our technique not found in LAR and most other protocols is the selective use of unicast instead of broadcast for route request/query transmission made possible by a novel reuse of routing and location information. We refer to this new optimization as the UNIQUE (UNIcast QUEry) technique. This paper studies the efficacy of UNIQUE by applying it to the route discovery of the Dynamic Source Routing (DSR) protocol. In addition, a comparative study is made with a DSR protocol optimized with only LAR. The results show that UNIQUE could further reduce the overall routing overhead by as much as 58% under highly mobile conditions. With less congestion caused by routing traffic, the data packet delivery performance also improves in terms of end-to-end delay and the number of data packets successfully delivered to their destinations.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.232-239
• /
• 2011

This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.939-955
• /
• 2010

With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, $A^*$ algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.

• Science of Emotion and Sensibility
• /
• v.8 no.3
• /
• pp.253-263
• /
• 2005

In this study, the basic purpose was to identify the characteristics of the perception response of the elements that have an influence on the information search process for an assessment of product preference. Also, the relationship between the characteristics and the preference of products were reviewed in terms of the experience of the use of products. For this, photos of mobile phones and proposal-type products were selected and the experimental stimulant and experiments were conducted in two steps. In the first experiment, observations were made on the photos of the proposed products and they were arranged in the order of preference. In the second experiment, the part with the first attention in the preference assessment was marked by using the product photos that were previously selected and ranking them from 1 to 10. Two conclusions were obtained from the results of the experiment. First, the experimental memory information with the experience of the use of the products activates an interpretational response to the various constitutional elements included in the object for conception in the process of a preference rating. Second, no product use experience induces the reaction that perceptually accepts the esthetical elements included in the object for perception, regardless of preference.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.3
• /
• pp.371-378
• /
• 2016

We have studied on the maritime navigation with functions of navigation route search and maritime safety information for small-size fishery ships, fishing boats, yachts, and boats in coastal seas. We have designed a smart phone application which is more exact information on marine obstacles of islands, aquafarms, and rocks by using land navigation techniques. Our navigation system is relatively easy to be used for costal navigation and may be a substitute for expensive ECDIS(Electronic Chart Display and Information System). Our system consists of maritime navigation databases to manage necessary maritime data and a mobile application to support maritime navigation for operators. We believe that our research findings can improve safety navigation in coastal seas by supporting lower cost, no time-consuming installation and maintenance, and easy-to-use operations.

• Journal of Digital Convergence
• /
• v.11 no.3
• /
• pp.407-413
• /
• 2013

For Ubiquitous service, there are some method researched. To IT convergence study tourism the convergence of IT and tourism in recent years has emerged as a discipline in the future. Tourist information is information about tourism products as tourists tourism decision-making needed to say. Information presented information anytime, anywhere, using a contact-type media, mobile and efficient tourist information content and generate content using Smart App store to the database is needed. This paper, by taking advantage of the Smart App Places to generate content and Smart Things to query, modify, search, tourism information, tourism policy and tourists can be analyzed, and the average inclination and these efficient tourism information content and that can be utilizedmodels are proposed. This u-Smart is a tourist information system. Build the biggest advantages of the meta-meta-model in real time by utilizing Smart App disposition of existing tourism information and tourist and tourism rating database. Helps to generate patterned by digital tourism policy tourism information content.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1474-1479
• /
• 2015

With mobile devices showing marked improvement in performance in the age of the Internet of Things (IoT), there is demand for rapid processing of the extensive amount of multimedia big data. However, because research on image searching is focused mainly on increasing accuracy despite environmental changes, the development of fast processing of high-resolution multimedia data queries is slow and inefficient. Hence, we suggest a new distributed image search algorithm that ensures both high accuracy and rapid response by using feature extraction of distributed images based on MapReduce, and solves the problem of memory scalability based on BIRCH indexing. In addition, we conducted an experiment on the accuracy, processing time, and scalability of this algorithm to confirm its excellent performance.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.3
• /
• pp.55-63
• /
• 2010

On Handoff, existing AP search has chosen one of various APs according to signal strength. However IEEE 802.11 uses Medium Access method with CSMA/CA(Carrier Sensing Multiple Access /Collision Avoidance) that competes to obtain a channel by sharing common medium. For that reason, network performance is heavily affected by the number of nodes and network congestion aside from signal strength. Consequently, in this paper we propose the method that choose one AP which ensures more improved network performance and set up a link, reflecting AP network information in Handoff area, on Handoff in the process of AP selection. We also demonstrate through simulation that it gets maximum performance even in the wireless network which many users concurrently access to, and it has considerable effects on aspects of resources and network management by distribution of users.

• Spatial Information Research
• /
• v.16 no.1
• /
• pp.65-77
• /
• 2008

There have been many studies and technologies that define a current location of a moving vehicle with GPS(Global Positioning System). However, the navigation system with GPS has troubles to search an optimized route considering data such as realtime parking status and road conditions. Moreover, the GPS systems show malfunction in the downtown with very tall buildings, underground parking lot and the inside of buildings. On the contrary, the RFID systems are able to reflect real-time status of parking lots and roads in the downtown. This paper proposes a system of guiding path for parking lots to consider real-time constraints based on RFID. The results obtained from the implemented system show smooth guiding of a new route after immediately sensoring the change of the information of parking lots and roads: if a parking lot that a vehicle is heading to is fully occupied, the system re-searches a new route for a neighbor parking lot and immediately transfers it to customer's mobile, and if the designated route is under construction, the system guides a detour path. The proposed method will be useful for advanced integrated parking control system.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.3
• /
• pp.458-464
• /
• 2015

This paper proposes a portable 3-D scanning technique using a laser pointer. 3-D scanning is a process that acquires surface information from an 3-D object. There have been many studies on 3-D scanning. The methods of 3-D scanning are summarized into some methods based on multiple cameras, line lasers, and light pattern recognition. However, those methods has major disadvantages of their high cost and big size for portable appliances such as smartphones and digital cameras. In this paper, a 3-D scanning system using a low-cost and small-sized laser pointer are introduced to solve the problems. To do so, we propose a 3-D localization technique for a laser point. The proposed method consists of two main parts; one is a fast recognition of input images to obtain 2-D information of a point laser and the other is calibration based on the least-squares technique to calculate the 3-D information overall. To verified our method, we carry out experiments. It is proved that the proposed method provides 3-D surface information although the system is constructed by extremely low-cost parts such a chip laser pointer, compared to existing methods. Also, the method can be implemented in small-size; thus, it is enough to use in mobile devices such as smartphones.