• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.7
• /
• pp.442-453
• /
• 2007

A model-based integrated development tool for the development of USN application programs is proposed in this paper. The proposed tool has been implemented as a plug-in for Eclipse platform. The tool consists of Graphical User Interface, Modeler, Configuration Information Generator, Validity Checker, Source Code Generator and Templates Storage. Developers can implement USN applications from models of sensor networks using the tool. The developer can implement USN applications by automatic generation of execution code of each node in the sensor network after he/she designs a model of the sensor network. The configuration information of each node is automatically generated from the validated USN model. Then, the execution code is automatically generated using the configuration information and the predefined templates. Through the tool of this paper, developers can easily implement valid USN applications even if they do not know the details of low-level information. Also, a large number of application programs can be generated at once because application programs are generated from sensor network model instead of models of applications. Accordingly, the development effort of USN applications will be decreased and developers can consistently construct USN applications from USN models using the proposed tool.

• Journal of Korea Water Resources Association
• /
• v.31 no.6
• /
• pp.779-793
• /
• 1998

In this study, for the purpose of water supply planning, we propose a sophisticated multi-period mixed integer programming model that can coordinate the behavior of multi-reservoir operation, minimizing unnecessary spill. It can simulate the system with operating rules which are self- generated by the optimization engine in the algorithm. It is an optimization model in structure, but it indeed simulates the coordinating behavior of multi-reservoir operation. It minimizes the water shortfalls in demand requirements, maintaining flood reserve volume, minimizing unnecessary spill, maximizing hydropower generation release, keeping water storage levels high for efficient hydroelectric turbine operation. This optimization model is a large scale mixed integer programming problem that consists of 3.920 integer variables and 68.658 by 132.384 node-arc incidence matrix for 28 years of data. In order to handle the enormous amount of data generated by a big mathematical model, the utilization of DBMS (data base management system)seems to be inevitable. It has been tested with the Han River multi-reservoir system in Korea, which consists of 2 large multipurpose dams and 3 hydroelectric dams. We demonstrated successfully that there is a good chance of saving substantial amount of water should it be put to use in real time with a good inflow forecasting system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.623-628
• /
• 2009

The emergence of compact and low-power wireless communication sensors and actuators in the technology supporting the ongoing miniaturization of processing and storage allows for entirely the new kinds of embedded systems. These systems are distributed and deployed in environments where they may have been designed into a particular control method, and are often very dynamic. Collection of devices can communicate to achieve a higher level of coordinated behavior. Wireless sensor nodes deposited in various places provide light, temperature, and activity measurements. Wireless sensor nodes attached to circuits or appliances sense the current or control the usage. Together they form a dynamic and multi-hop routing network connecting each node to more powerful networks and processing resources. Wireless sensor networks are a specific-application and therefore they have to involve both software and hardware. They also use protocols that relate to both applications and the wireless network. Wireless sensor networks are consumer devices supporting multimedia applications such as personal digital assistants, network computers, and mobile communication devices. Wireless sensor networks are becoming an important part of industrial and military applications. The characteristics of modem embedded systems are the capable of communicating adapting the different operating environments. In this paper, We designed and implemented sensor network system which shows through host PC sensing temperature and humidity data transmitted for wireless sensor nodes composed wireless temperature and humidity sensor and designs sensor nodes using embedded system with the intention of studying USN.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3182-3194
• /
• 2000

It is strongly beliefed that Video on Demand(VOD) will become one of the most promising services in Broadband Integrated Services Digital Network(B-ISDN) for the nest generation VOD service can be classified into two types of services 'Near VOD(NVOD) and Interactive VOD(IVOD). For both services, some video servers should be installed at some nodes(especially, at the root node for NVOD service) in the tree structued VOD network,so that each node with video server stores video programs and distribules stored programs to customers. We consider thre kinds of cost.a program transmission cost, a program storage cost, and a video server installation cost. There exists a trade-off relationship among those three costs according to locationsl of video servers and the kinds of programs stord at each video server. Given a tree structured VOD network, and the total number of programs being served in the network, the resource allocation problem in a VOD network providing both IVOD and NVOD services is to determine where to install video servers for IVOD service, which and how many programs should be stored at each video server for both IVOD and NVOD services, so as to minunize the total cost which is the sum of three costs for both IVOD and NVOD services. In this paper we develop an efficient cynamic programming algorithm for solving the problem. We also implement the algorithm based on a service policy assumed in this paper.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.620-630
• /
• 2006

Event-detection is an important application of sensor networks. Join operations can facilitate event-detection with a condition table predefined by a user. When join operations are used for event-detection, it is desirable, if possible, to do in-network join processing to reduce communication costs. In this paper, we propose an energy-efficient in-network join algorithm, called PBA. In PBA, each partition of a condition table is stored along the path from each node to the base station, and then in-network joins are performed on the path. Since each node can identify the parts to store in its storage by its level, PBA reduces the cost of disseminating a condition table considerably Moreover, while the existing method does not work well when the ratio of the size of the condition table to the density of the network is a little bit large, our proposed method PBA does not have such a restriction and works efficiently in most cases. The results of experiments show that PBA is efficient usually and especially provides significant cost reduction over existing one when a condition table is relatively large in comparison with the density of the network, or the routing tree of the network is high.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.6
• /
• pp.95-102
• /
• 2012

In this paper, we propose a method that can construct efficiently a P2P overlay multicast network composed of many heterogeneous peers in communication bandwidth, processing power and a storage size by selecting a peer in a distributed fashion using an ant-colony theory that is one of the computational intelligence methods. The proposed method considers not only the capacity of a peer but also the number of children peers supported by the peer and the hop distance between a multicast source and the peer when selecting a parent peer of a newly joining node. Thus, an P2P multicast overlay network is constructed efficiently in that the distances between a multicast source and peers are maintained small. In addition, the proposed method works in a distributed fashion in that peers use their local information to find a parent node. Thus, compared to a centralized method where a centralized server maintains and controls the overlay construction process, the proposed method scales well. Through simulations, we show that, by making a few high capacity peers support a lot of low capacity peers, the proposed method can maintain the size of overlay network small even there are a few thousands of peers in the network.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.1
• /
• pp.43-56
• /
• 2012

Wireless sensor networks consist of numerous small-sized nodes equipped with limited computing power and storage as well as energy-limited disposable batteries. In this networks, nodes are deployed in a large given area and communicate with each other in short distances via wireless links. For energy efficient networks, dynamic clustering protocol is an effective technique to achieve prolonged network lifetime, scalability, and load balancing which are known as important requirements. this technique has a characteristic that sensing data which gathered by many nodes are aggregated by cluster head node. In the case of cluster head node is exposed by attacker, there is no guarantee of safe and stable network. Therefore, for secure communications in such a sensor network, it is important to be able to encrypt the messages transmitted by sensor nodes. Especially, cluster based sensor networks that are designed for energy efficient, strongly recommended suitable key management and authentication methods to guarantee optimal stability. To achieve secured network, we propose a key management scheme which is appropriate for hierarchical sensor networks. Proposed scheme is based on polynomial key pool pre-distribution scheme, and sustain a stable network through key authentication process.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.271-281
• /
• 2006

Recently the need for Location-Based Service (LBS) has increased due to the development and widespread use of the mobile devices (e.g., PDAs, cellular phones, labtop computers, GPS, and RFID etc). The core technology of LBS is a moving-objects database that stores and manages the positions of moving objects. To search for information quickly, the database needs to contain an index that supports both real-time position tracking and management of large numbers of updates. As a result, the index requires a structure operating in the main memory for real-time processing and requires a technique to migrate part of the index from the main memory to disk storage (or from disk storage to the main memory) to manage large volumes of data. To satisfy these requirements, this paper suggests a unified index scheme unifying the main memory and the disk as well as migration policies for migrating part of the index from the memory to the disk during a restriction in memory space. Migration policy determines a group of nodes, called the migration subtree, and migrates the group as a unit to reduce disk I/O. This method takes advantage of bulk operations and dynamic clustering. The unified index is created by applying various migration policies. This paper measures and compares the performance of the migration policies using experimental evaluation.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.320-335
• /
• 2003

Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.495-498
• /
• 2008

This paper describes design of a real-time, wearable reflectance pulse oximetry which is based Wireless Sensor Network. For the purpose of continuously monitoring vital signs of a human, wearable reflectance pulse oximetry is built into a wrist type that can be obtained $SpO_2$ value of patient unobtrusively. This designed $SpO_2$ module is based on a low-power 8 bit ATmega128L microcontroller operating in 3V. Low power operating $SpO_2$ module was integrated to wireless sensor node for user's health monitoring. This paper is focused on the successful integration of all these components into wearable reflectance pulse oximetry and evaluates its ability to measure patient' $SpO_2$ value. Information from this sensor was wirelessly transmitted to a base-station for storage and display purposes.