• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.448-450
• /
• 2007

Peer-to-Peer system has emerged as a popular model aiming at further utilizing Internet information and resources, complementing the available client-server services. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical location aware topology can cause serious performance degradation. In this paper, we consider the network distance between peers so that it helps peers select neighbors located at the nearest when they exchange queries for sharing of resources. To reduce the unnecessary signaling traffic and delay of query exchange, we propose a location aware topology based Hybrid P2P system. This system calculates the network distance which combines the direct measurement such as RTT (Round Trip Time) with geographic space of peers using IP address

• Proceedings of the SAREK Conference
• /
• 2006.06a
• /
• pp.405-410
• /
• 2006

This paper presents a control algorithm of supply and exhaust diffusers by recognizing a contaminant source location. CFD analysis has been conducted to calculate steady state airflow and concentration distributions in a model room, which has two supply and two exhaust openings on the ceiling. Calculations have been performed for five cases out of nine different ventilation modes by combining on/off control of the supply and exhaust openings. Local mean residual life times are obtained and compared at 9 internal points for each ventilation case. Depending on the contaminant source location, the ventilation system is operated at an optimum ventilation mode, which can results in maximum exhaust performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.611-618
• /
• 2009

Recently, an indoor location-aware technology has been focused on as a key technology for context awareness in ubiquitous computing environments. The conventional Cricket system was designed with a non-centralized architecture, which has advantages in terms of user privacy, deployment, scalability, decentralized administration, network heterogeneity, and low cost. In this paper, an indoor location system based on TDOA between RF and ultrasound signals is designed, which improves the Cricket system. A 2.4GHz frequency is employed for transmitting RF messages, which is in an ISM band. The beaconing frequency is doubled to enhance the channel utilization rate. The ultrasonic pulse duration is optimized to increase the coverage of ultrasonic signals. The function of calculating location coordinates is embedded in a listener. The location-update rate and location accuracy are also improved.

• Journal of Internet Computing and Services
• /
• v.7 no.3
• /
• pp.31-39
• /
• 2006

Ubiquitous and pervasive environment presents opportunities for a rich set of location aware applications such as car navigation and intelligent robots, interactive virtual games, logistics service, asset tracking etc. Typical indoor location systems require better accuracy than what current outdoor location systems provide, Outdoor location technologies such as GPS have poor indoor performance because of the harsh nature of indoor environments, In this paper we present a novel reducing interference location system that is particularly well suited to support context aware computing. The system, called EEM (Enhance Envelop Method) alms to combine the advantages of real time tracking systems that implement distributed environment with the suitability of infrastructure sensor network.

• Journal of Internet Computing and Services
• /
• v.5 no.2
• /
• pp.75-84
• /
• 2004

Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.619-631
• /
• 2006

With the advent of ubiquitous computing environments, it has become increasingly important for applications to take full advantage of context information, such as the user's location, to offer greater services to the user without any explicit request. In this paper, we propose context-aware active services on the basis of CAMUS (Context-Aware Middleware for URC Systems). CAMUS is a middleware for providing context-aware applications with development and execution methodology. Accordingly, the applications developed by CAMUS respond in a timely fashion to contexts. To evaluate, we apply proposed active services to TV application domain. Therefore, we implement and experiment the TV contents recommendation service agent, control service agent and TV task based on CAMUS. The context-aware TV task is to recommend programs and control of TV according to user preference, location and voice commands.

• Journal of Korea Multimedia Society
• /
• v.9 no.4
• /
• pp.460-469
• /
• 2006

Recently, a demand of adaptive multimedia service, which supports multimedia service migration according to user's location and characteristics of user device, is increased. In this paper, we propose a service migration system, which becomes aware of user device using intelligent agent. And we design and implement the ontology-based intelligent agent, which is aware of the context in its environment. Moreover, we implement a context reasoning system using location information.

• ETRI Journal
• /
• v.29 no.2
• /
• pp.169-178
• /
• 2007

With the advent of ubiquitous computing environments, it has become increasingly important for applications to take full advantage of contextual information, such as the user's location, to offer greater services to the user without any explicit requests. In this paper, we propose context-aware active services based on context-aware middleware for URC systems (CAMUS). The CAMUS is a middleware that provides context-aware applications with a development and execution methodology. Accordingly, the applications based on CAMUS respond in a timely fashion to contextual information. This paper presents the system architecture of CAMUS and illustrates the content recommendation and control service agents with the properties, operations, and tasks for context-aware active services. To evaluate CAMUS, we apply the proposed active services to a TV application domain. We implement and experiment with a TV content recommendation service agent, a control service agent, and TV tasks based on CAMUS. The implemented content recommendation service agent divides the user's preferences into common and specific models to apply other recommendations and applications easily, including the TV content recommendations.

• The Journal of Korea Robotics Society
• /
• v.7 no.2
• /
• pp.150-159
• /
• 2012

In this paper, we propose a cost-aware Rapidly-exploring Random Tree (RRT) path planning algorithm for mobile robots. A mobile robot is presented with a cost map of the field of interest and assigned to move from one location to another. As a robot moves, the robot is penalized by the cost at its current location according to the cost map. The overall cost of the robot is determined by the trajectory of the robot. The goal of the proposed cost-aware RRT algorithm is to find a trajectory with the minimal cost. The cost map of the field can represent environmental parameters, such as temperature, humidity, chemical concentration, wireless signal strength, and stealthiness. For example, if the cost map represents packet drop rates at different locations, the minimum cost path between two locations is the path with the best possible communication, which is desirable when a robot operates under the environment with weak wireless signals. The proposed cost-aware RRT algorithm extends the basic RRT algorithm by considering the cost map when extending a motion segment. We show that the proposed algorithm gives an outstanding performance compared to the basic RRT method. We also demonstrate that the use of rejection sampling can give better results through extensive simulation.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.831-838
• /
• 2001

Mobile information service aims to provide some degree of effective information for real life activities of mobile users. Due to the user mobility and actual realism, it becomes very important technical issue to support an adaptive information service methodology to current situations of the terminal and/or user. This paper deals with a prefetching scheme for location-aware, out of the various context-aware which can be considered in mobile information service. It makes use of the velocity-based mobility model to shape the terminal and/or user's mobility behavior. Based on the moving speed and direction, the prefetching zone is proposed to define the number of prefetched information, so as to limit effectively the prefetched information whilst to preserve the location-aware adaptability. Using a simulator, the proposed scheme has been evaluated in the effectiveness point of view. The idea in this paper is expected to be able to extended to the other mobile service contexts, such as service time, I/O types of mobile terminals, network bandwidth.