• Journal of Korean Society for Geospatial Information Science
• /
• v.23 no.3
• /
• pp.31-39
• /
• 2015

This paper presents the static and kinematic positioning accuracy by the real-time GPS positioning modes of the low-cost GPS receivers using NTRIP-based augmentation service. For this, acquires both the raw measurements data of the field tests by LEA 6T GPS module of u-blox AG, and correction communication via NTRIP caster with RTKLIB as an open source program for GNSS solution. With computing the positions of the check points and road tracks by six kinds of GPS positioning modes which are Single, SBAS, DGPS, PPP, RTK, and TCP/IP_RTK, compared these results to the reference position of the check points. The position error average and rmse of the static test by GPS L1 RTK surveying showed $N=0.002m{\pm}0.001m$, $E=0.004m{\pm}0.001m$ in horizontal plane, and $h=-0.116m{\pm}0.003m$ in vertical, these results are very closed to the coordinates with the geodetic receiver. Especially, in case of the kinematic test with obstacles located on both sides of road, the computed track with ambiguity fixing showed very similar trajectory considerably from VRS network RTK mode. And also, evaluate and verify the performance of the TCP/IP_RTK mode developed based on TCP/IP protocol.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.2
• /
• pp.27-37
• /
• 2009

Sensor nodes forming a sensor network have limited energy capacity such as small batteries and when these nodes are placed in a specific field, it is important to research minimizing sensor nodes' energy consumption because of difficulty in supplying additional energy for the sensor nodes. Clustering has been in the limelight as one of efficient techniques to reduce sensor nodes' energy consumption in sensor networks. However, energy saving results can vary greatly depending on election of cluster heads, the number and size of clusters and the distance among the sensor nodes. /This research has an aim to find the optimal set of clusters which can reduce sensor nodes' energy consumption. We use a Genetic Algorithm(GA), a stochastic search technique used in computing, to find optimal solutions. GA performs searching through evolution processes to find optimal clusters in terms of energy efficiency. Our results show that GA is more efficient than LEACH which is a clustering algorithm without evolution processes. The two-dimensional GA (2D-GA) proposed in this research can perform more efficient gene evolution than one-dimensional GA(1D-GA)by giving unique location information to each node existing in chromosomes. As a result, the 2D-GA can find rapidly and effectively optimal clusters to maximize lifetime of the sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10B
• /
• pp.1222-1232
• /
• 2011

RFID/USN core technologies for ubiquitous computing, It is possible to use variety of sensors, direct processors, and wireless network technology that easily collect the actual physical environment and can monitor information remotely. Especially the healthcare industry and services combined with U-Healthcare that have international competitiveness in the medical field. But the USN, standard management system of RFID such as EPCglobal architecture framework, the lack of interoperability issues and the global sensor network implementation. In this paper, a system for managing sensor nodes of the USN, USN of SIP-based management system (UMS) is proposed. UMS support Session Initiation Protocol (SIP), provide session management and mobility capabilities, that is based on Internet standard protocol. UMS architecture of the existing SIP architecture, added USN User Agent (UUA) and the USN Name Server (UNS) that the location of sensor nodes should be possible to trace. UUA on behalf of the limited capacity of the location of the sensor nodes to perform the registration process, UNS to track the location of the sensor nodes to provide name resolution services. The proposed management system has the advantage of internet applications such as Web services interoperability and easy to recycle existing resources with other SIP-based because it uses the Internet standard protocol SIP. In this paper we propose is based on the UMS blood temperature management system is verified through the scenario.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.60-71
• /
• 2006

Group key agreement protocols are designed to allow a group of parties communicating over a public network to securely and efficiently establish a common secret key, Over the years, a number of solutions to the group key agreement protocol have been proposed with varying degrees of complexity, and the research relating to group key agreement to securely communicate among a group of members in integrated wired and wireless networks has been recently proceeded. Both features of wired computing machines with the high-performance and those of wireless devices with the low-power are considered to design a group key agreement protocol suited for integrated wired and wireless networks. Especially, it is important to reduce computational costs of mobile devices which have the limited system resources. In this paper, we present an efficient group key agreement scheme which minimizes the computational costs of mobile devices and is well suited for this network environment and prove its security.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.151-164
• /
• 2009

The importance of sensor networks as a base of ubiquitous computing realization is being highlighted, and espicially the security is recognized as an important research isuue, because of their characteristics.Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop security Intrusion Detection System (IDS) that can survive malicious attacks from "insiders" who have access to keying materials or the full control of some nodes, taking their charateristics into consideration. In this perper, we design a distributed and adaptive IDS architecture on sensor networks, respecting both of energy efficiency and IDS efficiency. Utilizing a modified HEED algorithm, a clustering algorithm, distributed IDS nodes (dIDS) are selected according to node's residual energy and degree. Then the monitoring results of dIDSswith detection codes are transferred to dIDSs in next round, in order to perform consecutive and integrated IDS process and urgent report are sent through high priority messages. With the simulation we show that the superiorities of our architecture in the the efficiency, overhead, and detection capability view, in comparison with a recent existent research, adaptive IDS.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.705-714
• /
• 2001

The computing systems of today expanded business trade and distributed business process Internet. More and more systems are developed from components with exactly reusability, independency, and portability. Component based development is focused on advanced concepts rater than passive manipulation or source code in class library. The primary component construction in CBD. However, lead to an additional cost for reconstructing the new component with CBD model. It also difficult to serve component information with rapidly and exactly, which normalization model are not established, frequency user logging in Web caused overload. A lot of difficult issues and aspects of Component Based Development have to be investigated to develop good component-based products. There is no established normalization model which will guarantee a proper treatment of components. This paper elaborates on some of those aspects of web application to adapt user requirement with exactly and rapidly. Distributed components in this paper are used in the most tiny size on network and suggest the network-addressable interface based on business domain. We also discuss the internal and external specifications for grasping component internal and external relations of user requirements to be analyzed. The specifications are stored on Servlets after dividing the information between session and entity as an EJB (Enterprise JavaBeans) that are reusable unit size in business domain. The reusable units are used in business component through query to get business component. As a major contribution, we propose a systems model for registration, auto-arrange, search, test, and download component, which covers component reusability and component customization.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2587-2596
• /
• 1999

Recently, by the extension of skills like LAN, the wireless telecommunication network and the satelite services make it possible for the mobile computer users to access a database. A method to use the replicated database on a server to get new data without missing any information has been being studied. So far we have used the Static Replica Allocation(SRA) for the replication which is the method of the replication on the server. This method is to replicate the data on the replica server after a moving host is transferred to a cell. Since the network of the SRA is very good, and if there are few moving users, no trouble will happen. But if there is no moving users in a cell, the data will not be shared. Therefore, this paper is about the study of the method of relocation after replicating the data to the cells for the users(User Select Replica Allocation : USRA). We also analyze the access rate and the possibility which are closely related to the moving frequency of the mobile hosts and the numbers of the cells. As a result, We show that the 120% lower access cost and the 40%∼50% gains are achieved from the low mobility

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.411-423
• /
• 2004

In Korea, Eureka-147 DAB (Digital Audio Broadcasting) temporarily decided as the standard system for digital audio broadcasting was evolved into DMB (Digital Multimedia Broadcasting) to complement the technical vulnerability in mobile reception of terrestrial DTV. According to introducing video service in T-DMB (Terrestrial DMB), 'Terrestrial DMB Experimental Broadcasting for Video Service', a national project of the MIC (Ministry of Information and Communication), was done for verifying the possibility of video service via T-DMB. The main objective of the project is computing the effective field strength and coverage for making a plan to build T-DMB broadcasting network and developing transmitting and receiving equipment. In case of digital broadcasting, it is absolutely essential to measure BER (Bit Error Rate) and electric field strength in order to evaluate coverage and quality of received signal. In this paper, we implement an integrated mobile measurement system for T-DMB. For this purpose, we propose efficient data structure and algorithm for BER measurement. By adding GPS (Global Positioning System) and electric field strength measurement parts into BER measurement part, we complete the integrated mobile measurement system, and then verify it by experiments and field tests. The developed system was used in a national project, 'Terrestrial DMB Experimental Broadcasting for Video Service' and measurement results will be used as fundamental data for building T-DMB broadcasting network.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.6
• /
• pp.580-586
• /
• 2017

The establishment of big data service environment requires both cloud-based network technology and clustering technology to improve the efficiency of information access. These cloud-based networks and clustering environments can provide variety of valuable information in real-time, which can be an intensive target of attackers attempting illegal access. In particular, attackers attempting IP spoofing can analyze information of mutual trust hosts constituting clustering, and attempt to attack directly to system existing in the cluster. Therefore, it is necessary to detect and respond to illegal attacks quickly, and it is demanded that the security policy is stronger than the security system that is constructed and operated in the existing single system. In this paper, we investigate routing pattern changes and use them as detection information to enable active correspondence and efficient information service in illegal attacks at this network environment. In addition, through the step-by -step encryption based on the routing information generated during the detection process, it is possible to manage the stable service information without frequent disconnection of the information service for resetting.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.631-640
• /
• 2003

Because of multi-hop wireless communication, P2P applications in ad hoc networks suffer poor performance. We Propose neighbor caching strategy to overcome this shortcoming and show it is more efficient than self caching that nodes store data in theirs own cache individually. A node can extend its caching storage instantaneously with neighbor caching by borrowing the storage from idle neighbors, so overcome multi-hop wireless communications with data source long distance away from itself. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The node that uses the ranking based prediction can select the neighbor that has high possibility to keep data for a long time and avoid caching the low ranked data. Therefore the ranking based prediction improves the throughput of neighbor caching. In the simulation results, we observe that neighbor caching has better performance, as large as network size, as long as idle time, and as small as cache size. We also show the ranking based prediction is an adaptive algorithm that adjusts times of data movement into the neighbor, so makes neighbor caching flexible according to the idleness of nodes