• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.262-268
• /
• 2007

The efficient node-energy utilization in wireless sensor networks has been studied because sensor nodes operate with limited power based on battery. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing total energy consumption of the overall network. Since a large number of sensor nodes are densely deployed and collect data by cooperation in wireless sensor network, keeping more sensor nodes alive as possible is important to extend the lifetime of the sensor network. In this paper, we submit an efficient energy aware routing protocol based on AODV ad hoc routing protocol for wireless sensor networks to increase its lifetime without degrading network performance. The proposed protocol is designed to avoid traffic congestion on minor specific nodes at data transfer and to make the node power consumption be widely distributed to increase the lifetime of the network. The performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of network lifetime and end-to-end delay.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.2
• /
• pp.304-310
• /
• 2010

Chronic pain and herniated disk is a common disease that 80% of adults are experienced. There diseases rates of caused by the physical shock, such as the traffic accident, and the accidental fall is about 10%. And the most of these diseases is caused by having habitual incorrect position. People know that incorrect position would cause to accumulate continuous stress, but it is not easy to correct position. Because it does not recognize incorrect position repeated habitual consequently. This system collects data of user position after sensors that could measure position attach on use and presumes correct position used by position presumption algorithms. Its system purpose is continuing incorrect position could be aware to user and lead to change to correct position to prevent habituation of incorrect position. If habitual of correct position continues through accurate measurement and repeating cognitive learning, it would help for children and chronic patience.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.12
• /
• pp.2272-2293
• /
• 2011

Communication technology of future networks is predicted to provide a large variety of services including WiFi service in vehicular network. In this paper, we assume that vehicles are embedded with WiMAX antenna and in-vehicle terminals receive WiMAX traffic through WiFi interface. This assumption will impose severe performance degradation due to interference among mobile BSSs when WiFi access points (APs) are densely located. Existing interference avoidance techniques cannot properly resolve the above problems and do not cope with dynamically moving vehicular scenario since they focus only on the fixed network topology. In this paper, we propose a mobility-aware interference avoidance scheme for WiFi services. The proposed scheme computes the interference duration by exploiting mobility vector and location information of neighboring APs. If the interference duration is not negligible, our scheme searches for another channel in order to avoid interference. However, if the interference duration is negligible, our scheme continues to use the channel to reduce switching overhead. To measure the effectiveness of the proposed scheme against other existing techniques, we evaluated performance by using OPNET simulator. Through the simulation, we obtained about 60% reduction in the maximum interference frequency and about 67% improvement in throughput. Furthermore, our scheme provides fair channel usage.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.188-194
• /
• 2007

We propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. We will have developed an algorithm that will design multi-hierarchy Layered networks to simulate a desired system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3916-3936
• /
• 2014

Smartphone applications like games, image processing, e-commerce and social networking are gaining exponential growth, with the ubiquity of cellular services. This demands increased computational power and storage from mobile devices with a sufficiently high bandwidth for mobile internet service. But mobile nodes are highly constrained in the processing and storage, along with the battery power, which further restrains their dependability. Adopting the unlimited storage and computing power offered by cloud servers, it is possible to overcome and turn these issues into a favorable opportunity for the growth of mobile cloud computing. As the mobile internet data traffic is predicted to grow at the rate of around 65 percent yearly, even advanced services like 3G and 4G for mobile communication will fail to accommodate such exponential growth of data. On the other hand, developers extend popular applications with high end graphics leading to smart phones, manufactured with multicore processors and graphics processing units making them unaffordable. Therefore, to address the need of resource constrained mobile nodes and bandwidth constrained cellular networks, the computations can be migrated to resourceful servers connected to cloud. The server now acts as a bridge that should enable the participating mobile nodes to offload their computations through Wi-Fi directly to the virtualized server. Our proposed model enables an on-demand service offloading with a decision support system that identifies the capabilities of the client's hardware and software resources in judging the requirements for offloading. Further, the node's location, context and security capabilities are estimated to facilitate adaptive migration.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1083-1096
• /
• 2008

This paper proposes an energy-aware path management scheme, so-called the TBP(Threshold based Back-Pressure) algorithm, which is designed for lifetime extension of the energy-constrained wireless sensor networks. With the goal of fair energy consumptions, we extensively utilize the available paths between the source and the sink nodes. The traffic distribution feature of the TBP algorithm operates in two scales; the local and the whole routing area. The threshold and the back-pressure signal are introduced for implementing those operations. It is noticeable that the TBP algorithm maintains the scalability by defining both the threshold and the back-pressure signal to have their meanings locally confined to one hop only. Throughout several experiments, we observe that the TBP algorithm enhances the network-wide energy distribution. which implies the extension of the network lifetime. Additionally, both the delay and the throughput outcomes show remarkable improvements. This shows that the energy-aware path control scheme holds the effects of the congestion control.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.89-92
• /
• 2005

Centralized P2P system, Napster and Unstructured P2P system, Gnutella accomplish main current. Centralized system and unstructured system have a restriction in a scalability. To solve the this problem, structured system is appeared. CAN, Chord, Pastry and Tapestry are delegation of this system. Although structured system don't aware physical proximity of node because it uses Distribute Hash Table. In proposing system, a node can communicate with physical proximity of node using concept of LAN. Internet traffic is also decreased because communication in the Chord network divide in two(original network and sub network).

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.147-156
• /
• 2006

Recently, streaming service accounts for large part of internet traffic and it is becoming the most popular service. Because of P2P's scalability, P2P-based streaming system is proposed. There are frequent leave and join of a node. To overcome the group dynamics, Multiple Multicast Trees Methods were suggested. However, since they did not consider discrepancy in peers' capacity, it may cause the trees to be long and unstable. So we suggest Resilient Capacity-Aware Multicast Tree construction scheme (R-CAT) that promotes superior peer to upper position in the tree and construct more stable and short multicast trees. By simulation we can show that R-CAT cost more overhead packets for tree joining process, but it reduce the end-to-end delay of the resulting tree and the number of packets lost during the node joining and leaving processes much more than SplitStream.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.131-143
• /
• 2014

We propose a no-reference perceptual fog density and visibility prediction model in a single foggy scene based on natural scene statistics (NSS) and perceptual "fog aware" statistical features. Unlike previous studies, the proposed model predicts fog density without multiple foggy images, without salient objects in a scene including lane markings or traffic signs, without supplementary geographical information using an onboard camera, and without training on human-rated judgments. The proposed fog density and visibility predictor makes use of only measurable deviations from statistical regularities observed in natural foggy and fog-free images. Perceptual "fog aware" statistical features are derived from a corpus of natural foggy and fog-free images by using a spatial NSS model and observed fog characteristics including low contrast, faint color, and shifted luminance. The proposed model not only predicts perceptual fog density for the entire image but also provides local fog density for each patch size. To evaluate the performance of the proposed model against human judgments regarding fog visibility, we executed a human subjective study using a variety of 100 foggy images. Results show that the predicted fog density of the model correlates well with human judgments. The proposed model is a new fog density assessment work based on human visual perceptions. We hope that the proposed model will provide fertile ground for future research not only to enhance the visibility of foggy scenes but also to accurately evaluate the performance of defog algorithms.

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.18 no.4
• /
• pp.53-65
• /
• 2012

Purpose: With the increasing national interest in health, the number of health examination centers is growing rapidly, and it is growing as independent medical institutes separated from hospitals. With the growing functions and size of health examination institutes, considerations for testees, who are the most important users of the health examination centers, have taken the back seat. In particular, for health examination programs that take on a sequential traffic line, it is important to be aware of the space of each examination room, but the lack of a scientific evaluation method for this has resulted in great discomforts for testees using the health examination center. Method: Thus, this study proposes risk evaluation indices (RCF TCF, RC3, RR, ARR), and set a standard health examination program based on the national health examination program. This was applied to 11 different sized health examination centers to find their features, and together with identifying the trends of the indices, the following results were deduced. Result: 1) ARR showed a wide-range feature as the number of unit spaces increased, while RR were discovered regardless of the size, thus displaying local features. 2) The increase of ARR is affected more by internal factors in the health examination center than from outside factors. 3) By gender, when separating the basic health examination fields, the connective relation of the comprehensive health examination fields had a big effect on ARR. 4) By becoming larger, the fields of function become independent and the waiting space that results from it increases the number of total movement, so there is space for improvement in this.