• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.1
• /
• pp.62-77
• /
• 2010

Emerging applications with high data rates will need to transport bulk data reliably in wireless sensor networks. ARQ (Automatic Repeat request) or Forward Error Correction (FEC) code schemes can be used to provide reliable transmission in a sensor network. However, the naive ARQ approach drops the whole frame, even though there is a bit error in the frame and the FEC at the bit level scheme may require a highly complex method to adjust the amount of FEC redundancy. We propose a bulk data transmission scheme based on erasure-resilient code in this paper to overcome these inefficiencies. The sender fragments bulk data into many small blocks, encodes the blocks with LT codes and packages several such blocks into a frame. The receiver only drops the corrupted blocks (compared to the entire frame) and the original data can be reconstructed if sufficient error-free blocks are received. An incidental benefit is that the frame error rate (FER) becomes irrelevant to frame size (error recovery). A frame can therefore be sufficiently large to provide high utilization of the wireless channel bandwidth without sacrificing the effectiveness of error recovery. The scheme has been implemented as a new data link layer in TinyOS, and evaluated through experiments in a testbed of Zigbex motes. Results show single hop transmission throughput can be improved by at least 20% under typical wireless channel conditions. It also reduces the transmission time of a reasonable range of size files by more than 30%, compared to a frame ARQ scheme. The total number of bytes sent by all nodes in the multi-hop communication is reduced by more than 60% compared to the frame ARQ scheme.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.1
• /
• pp.37-48
• /
• 2011

Sensor networks monitor the environment, collect sensed data, and relay the data back to a collection point. Although sensor nodes have very limited hardware resources, they require an operating system that can provide efficient resource management and various application environments. In addition, the wireless sensor networks require the code update previously deployed to patch bugs in program and to improve performance of kernel service routines and application programs. This paper presents EPRCU (Easy to Perform Remote Code Update), a new operating system for wireless sensor nodes, which has enhanced functionalities to perform remote code update. To achieve an efficient code update, the EPRCU provides dynamic memory allocation and program memory management. It supports the event-driven kernel, which uses priority-based scheduling with the application of aging techniques. Therefore, the proposed operating system is not only easy to perform wireless communication with the remote code update but also suitable for various sensor network applications.

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

Since being constructed without any infrastructure-based network, ad hoc network has been received much attention as a key technology for ubiquitous networks. Due to high bit error rate and dynamically changing network topology in ad hoc network, the routing protocol that provides stable multi-hop communication path is the one of the key issues to address. The previously proposed ad hoc routing protocols have their limitations on network overhead, stability, and scalability. In this paper, we consider hybrid wireless network, which can overcome shortcomings of ad hoc network, and propose a novel routing protocol called zone master-based routing protocol. We verify with computer simulations that the proposed routing protocol outperforms other existing routing protocols in the various wireless environments.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.967-973
• /
• 2014

A continuous object is large phenomenon diffusing continuously. Therefore, a large number of sources is a major problem in researches for continuous object. Existing studies for continuous object detecting focus on reducing communication cost generated by the sources. But, they only deal with the static sink located in fixed position. In this paper, we propose the location update scheme for mobile sinks in continuous object detecting. Generally, to receive data, a mobile sink should notice its current location to sources. Previous studies for location update of mobile sinks consider individual object. So they need a lot of energy for location update when a mobile sink notices its current location toward many sources of a continuous object independently. Proposed scheme exploits regional locality of the sources involved one continuous object. The regional locality makes the location update of mobile sinks efficient. Our simulation results show that the proposed scheme superior to existing schemes in terms of energy efficiency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.2
• /
• pp.319-328
• /
• 2013

Considerable number of major countries have put great efforts to leverage the efficiency of power consumption using Smart Grid in order to resolve the critical issues with drastical growing demands regarding electricity, the crisis of environmental pollution and so on. There has been increasing number of researches to construct Smart Grid in Korea as well. The threats of cyber terror attacks which might cause national crisises in terms of economy and society have been climbing up because of the fact that Smart Grid employs bi-directional communications embedding the cyber threats from existing/legacy communication networks. Consequently, it is required to build concrete response processes including investigation and analysis on cyber breaches into Smart Grid. However, the digital evidence acquisition techniques do not suffice to be deployed in Smart Grid systems despite of the fact that the techniques, against cyber breaches into well-known networks, have been studied in plenty of time. This work proposes a novel digital evidence acquisition scheme appropriate to Smart Grid systems through intensive investigation of the evidence acquisition requirements in Smart Grid and the historical evidence acquisition methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.4
• /
• pp.867-873
• /
• 1999

Camera calibration is a procedure which calculates internal and external parameters of a camera with the Down world coordinates of the control points. Accurate camera calibration is required for achieving accurate visual measurements. In this paper, we propose a simple and flexible camera calibration using neural networks which doesn't require a special knowledge of 3D geometry and camera optics. There are some applications which are not in need of the values of the internal and external parameters. The proposed method is very useful to these applications. Also, the proposed camera calibration has advantage that resolves the ill-condition as object plane is near parallel image plane. The ill-condition is frequently met in product inspection. For little more accurate calibration, acquired image is divided into two regions according to radial distortion of lens and neural network is applied to each region. Experimental results and comparison with Tsai's algorithm prove the validity of the proposed camera calibration.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.917-922
• /
• 2016

Recently, energy harvesting, in which energy is collected from RF signals, has been regarded as a promising technology to improve the lifetime of sensors by alleviating the lack of power supply problem. In this paper, we try to propose an efficient algorithm for simultaneous wireless information and power transfer. At first, we find the lower bound of water-level using the probability density function of channel, and derive the solution of power allocation in energy harvesting networks. In addition, we derive an efficient power splitting method for satisfying the minimum required harvested energy constraint. The simulation results confirm that the proposed scheme improves the average data rate while guaranteeing the minimum required harvested energy constraint, compared with the conventional scheme. In addition, the proposed algorithm can reduce the computational complexity remarkably with insignificant performance degradation less than 10%, compared to the optimal solution.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.1
• /
• pp.53-59
• /
• 2009

As a special type of Wireless Ad Hoc Networks, Wireless Mesh Networks (WMNs) have become the comer stone of research issues. Due to the limited operational environment of WMNs, an efficient connected dominating set (CDS) construction scheme is an important concern since it has been found extremely useful in broadcasting, routing and virtual backbone construction. In this paper, we propose a distributed Bandwidth-Interference aware CDS construction scheme to improve the network performance via two parameters such as node's number of neighbor and link bandwidth. Our CDS construction scheme selects the node that has more neighbors and enough bandwidth to support more end-devices in order to enhance overall network throughput and reliability. We confirm through simulations and show that our scheme constructs the CDS with the small subset of DS and the link that has better bandwidth.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2012.06a
• /
• pp.78-79
• /
• 2012

To improve moving vehicles' accuracy, one-way Network RTK which guarantees high accuracy and integrity regardless the distance from rovers to Reference Station(RS) is being considered. Correction of one-way Network RTK can be generated only after constructing RS network surrounding the rover, therefore a correction discontinuity is inevitably occurred when the RS set has been changed. The discontinuity is not eliminated by the DD(Double Difference) method, and our simulation shows that it causes 13cm(horizontal) and 48cm(vertical) position error. We suggest three solutions to reduce this discontinuity, which are identification of master RS with neighbor networks, duplication of communication module to receive corrections from other network, and ambiguity levelling between neighbor networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2237-2246
• /
• 2010

In this paper, the performance of a RCO-MAC protocol is evaluated using a different traffic model. Data frames are assumed to generate based on an exponential distribution from one source node and then directly to be stored into the input buffer in the source node. System throughput, average access delay and average system delay are used as a performance measure. Performance evaluation is carried out by the computer simulation. Numerical results show that the RCO-MAC scheme offers 18% higher system throughput than the rDCF scheme. In addition, the numerical results show that the RCO-MAC protocol also offers the better average system delay under any traffic load than that by the rDCF scheme, which was not obtained in the previous research due to the saturated traffic model.