• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.188-200
• /
• 2006

Once a continuous query, which is commonly used in sensor networks, is issued, the query is executed many times with a certain interval and the results of those query executions are collected to the base station. Since this comes many communication messages continuously, it is important to reduce communication cost for collecting data to the base station. In sensor networks, in-network processing reduces the number of message transmissions by partially aggregating results of an aggregate query in intermediate nodes, or merging the results in one message, resulting in reduction of communication cost. In this paper, we propose a routing tree for sensor nodes that qualify the given query predicate, called the query specific routing tree(QSRT). The idea of the QSRT is to maximize in-network processing opportunity. A QSRT is created seperately for each query during dissemination of the query. It is constructed in such a way that during the collection of query results partial aggregation and packet merging of intermediate results can be fully utilized. Our experimental results show that our proposed method can reduce message transmissions more than 18% compared to the existing one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.12
• /
• pp.1318-1327
• /
• 2012

With the recent increased risk of livestock disease spread and human infection, livestock disease control has become very important. Consequently, there has been an increased attention on an implantable real-time monitoring and traceability system for individual cattle. Therefore, we have developed a robust monitoring and traceability system based on an implantable MFAN/RFID sensor tag. Our design combines the MFAN technology that is capable of robust wireless communication within cattle sheds and the 900MHz RFID technology that is capable of wireless communication without battery. In MFAN/RFID implantable sensor tag monitoring system, UHF sensor tag is implanted under the skin and accurately monitors the body temperature and biological changes without being affected by external environment. In order to acquire power needed by the tag, we install a MFAN/RFID tranceiver on the neck of cattle. The MFAN coordinator passes through the MFAN node and the RFID-reader-combined MFAN/RFID transceiver and transmits/receives the data and power for the sensor tag. The data stored in the MFAN coordinator is transmitted via the internet to the livestock history monitoring system, where it is stored and managed. By developing this system, we hope to alleviate the problems related to livestock disease control.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.261-273
• /
• 2004

Advances in information and communication technologies have been creating new classes of applications in the area of databases. For example, in moving object databases, which track positions of a lot of objects, or stream databases, which process data streams from a lot of sensors, data Processed in such database systems are usually changed very rapidly and continuously. However, traditional database systems have a problem in processing these rapidly and continuously changing data because they suppose that a data item stored in the database remains constant until It is explicitly modified. The problem becomes more serious in the R-tree, which is a typical index structure for multidimensional data, because modifying data in the R-tree can generate cascading node splits or merges. To process frequent updates more efficiently, we propose a novel update technique for the R-tree, which we call the leaf-update technique. If a new value of a data item lies within the leaf MBR that the data item belongs, the leaf-update technique changes the leaf node only, not whole of the tree. Using this leaf-update manner and the leaf-access hash table for direct access to leaf nodes, the proposed technique can reduce update cost greatly. In addition, the leaf-update technique can be adopted in diverse variants of the R-tree and various applications that use the R-tree since it is based on the R-tree and it guarantees the correctness of the R-tree. In this paper, we prove the effectiveness of the leaf-update techniques theoretically and present experimental results that show that our technique outperforms traditional one.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1939-1946
• /
• 2012

USNs (Ubiquitous Sensor Networks) such as IEEE 802.15.4 ZigBee network share ISM (Industrial, Scientific, and Medical) frequency band with WiFi networks. Once both networks operate in a region, packet collision may happen because of frequency overlapping. To assure this possibility, we conducted experiments where WiFi and ZigBee communication networks had been installed in an area. As a result of the test, successful data transmission rate were reduced due to the frequency overlapping between a WiFi communication channel and a ZigBee communication band. To cope with this problem, we propose a collision avoidance algorithm. In the proposed algorithm, if frequency collision is sensed, new communication channel with different frequency band is allocated to each node. Performance of the proposed frequency collision avoidance algorithm was tested and the results were described.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.119-126
• /
• 2017

Developing the TCP/IP standard IBA which is higher organization of IETF decided to attach the TCP/IP protocol stack to small things, such as sensor. This means small object is also considered as on of the communication node, it has symbolic meaning that expand smart object has all five layer. Under this background, IoT/WoT configure the intelligent network between objects based on the internet to communication was introduced. Things has own IP address on IoT environment and are smart object that a lot of people communicate over the internet on Application Layer. In other words, IoT is that smart object are commercialized space. According to the interest of IoT, IETF establish CoAP for use as IoT protocol. CoAP is expected that standard protocols created by things is connected to the Internet protocol that can be used within a constrained environment. Accordingly, in this paper, we proposed Middleware API that can manage and collect the data of objects that connected CoAP network.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.267-280
• /
• 2005

In this paper, we implement and verify XMIP integrating IETF Mobile IP and the Explicit Multicast mechanism for a great number of small group multicast communications. U a source node sends Xcast packets explicitly inserting destination nodes into the headers, each Xcast router decides routes and forwards the packets toward each destination node based on unicast routing table without the support of multicast trees. n is a straightforward and simple multicast mechanism just based on a unicast routing table without maintaining multicast states because of the inheritance from the Explicit Multicast mechanism. This research modifies and extends the functionality of IETF Mobile IP's mobility agents, such as HA/FA to HA+/FA+ respectively, considering interworking with Xcast networks. Xcast packets captured by HA+ are forwarded into X-in-X tunnel interfaces for each FA+ referred to the binding table of HA.. This X-in-X tunneling mechanism can effectively solve the traffic concentration problem of IETF Mobile IP multicast services. Finally WLAN-based testbed is built and a multi-user Instant messenger system is developed as a Xcast application for finally verify the feasibility of the implemented XMIP/Xcast protocols.

• Journal of Information Technology and Architecture
• /
• v.11 no.2
• /
• pp.157-173
• /
• 2014

As Air Base Defence, Anti-Aircraft Defence and Nuclear-Biological-Chemical Protection model considered as ground operation models in Republic of Korea Air Force are designed as the voice-centered system between participant nodes, there is a problem communicating accurately. In recent years, the military is developing a command and control capability using data communication technology to solve the problem. Therefore, this paper proposes new model to maximize efficiency of performance improvement through the Data Communication-based Future Air Base Defence Model. We refer to a research paper that is related existing and developed new model. and then we really experimented under WiBro Network that is constructed to Air Base for maintenance control. Based on the analysis and the test result of new Air Base Defence Model, we have concluded that the performance improvement effect is reached.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.308-316
• /
• 2015

In this paper, we carried out performance comparison of four routing protocols that had been proposed for mobile ad hoc networks using the NS-3 network simulator. Those four routing protocols consist of two proactive routing protocols, DSDV(destination-sequenced distance vector) and OLSR(optimized link state routing), and two reactive routing protocols, AODV(ad-hoc on-demand distance vector) and DSR(dynamic source routing). Two performance metrics, system throughput and packet delivery ratio, are adopted and performance evaluation was carried out in a square communication area where each communicating mobile node moves independently. Numerical results show that the AODV routing protocol provides the best performance among those four routing protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.3
• /
• pp.277-288
• /
• 2013

3GPP LTE-Advanced (Third Generation Partnership Project Long Term Evolution-Advanced) as a next generation mobile communication standard introduced small base stations such as femto cells or pico cells, and D2D (Device-to-Device) communications between mobiles in the proximity in order to satisfy the needs of rapidly growing wireless data traffic. A diverse range of topics has been studied to solve various interference situations which may occur within a single cell. In particular, an introduction of a small base station along with D2D communication raises important issues of how to increase the channel capacity and frequency efficiency in HetNets (Heterogeneous Networks). To this end, we propose in this paper methods to manage the interference between the macro cell and other small cells in the HetNet to improve the frequency efficiency. The proposed CCN (Cluster Coordinator Node)-assisted ICI (Inter-Cell Interference) avoidance methods exploit the CCN to control the interference in HetNet comprising of an MeNB (Macro enhanced Node-B) and a large number of small cells. A CCN which is located at the center of a number of small cells serves to avoid the interference between macro cell and small cells. We propose methods of resource allocation to avoid ICI for user equipments within the CCN coverage, and evaluate their performance through system-level computer simulations.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.974-984
• /
• 1995

This paper presents a design of a high performance MULVEC (MULtithreaded architecture for the VEctor Computations), as a building block of massively parallel Processing systems. The MULVEC comes from the synthesis of the dataflow model and the extant super sclar RISC microprocesso r. The MULVEC reduces, using status fields, the number of synchronizations in the case of repeated vector computations within the same thread segment, and also reduces the amount of the context switching, network traffic, etc. After be nchmark programs are simulated on the SPARC station 20(super scalar RISC microprocessor)the performance (execution time of programs and the utilization of processors) of MULVEC and the performance(execution time of a program) of *Taccording the different numbers of node are analyzed. We observed that the execution time of the program in MULVEC is faster than that in * T about 1-2 times according the number of nodes and the number of the repetitions of the loop.