• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1068-1077
• /
• 2014

In this paper, we propose a novel method for path setup that optimizes energy consumptions for wireless sensor network. Existing studies usually generate paths according to Random way point approach so that it requires unnecessary energy consumptions for estimating location of the mobile sink node and transmission paths of packets. To address this problem, we propose a method that creates paths for mobile sink node using the Hilbert curve. Moreover, our method adjusts the path of the mobile sink node according to the density of sensor nodes to minimize data transmission delay. In our experiments, the proposed method outperforms existing work such as TTDD and CBPER by up to 50 times in terms of energy efficiency.

• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.150-156
• /
• 2010

Audio watermarking is the process of embedding inaudible information in an audio signal and has been widely used for copyright protection. In this research, we use the audio watermarking not for copyright protection but for the transmission of side information for user convenience, presenting an algorithm suitable for this purpose. Our new algorithm includes watermark embedding/extraction methods during acoustic transmission through the air that employ energy modulation of the audio signal and an efficient two-step synchronization method. The proposed algorithm is evaluated in experiments of conveying information from audio speakers to a mobile phone. The results show that reliable transmission is possible within a 5m range, which is an improvement achieved by our algorithm as compared to the existing one.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.513-522
• /
• 2008

Efficient data dissemination is one of the important subjects for sensor networks. High accessibility of the sensed data can be kept by deploying the data centric storage approach in which data is stored over the nodes in the sensor network itself rather than external storages or systems. The advantage of this approach is its direct accessibility in a real-time without the severe burden on delay and power dissipation on the data path to the external storages or systems. However, if the queries from many users are concentrated to the few nodes with data, then the response time could be increased and it could lead to the reduction of network life time by rapid energy dissipation caused by concentrated network load. In this paper, we propose a adaptive data centric storage scheme based on proxy trajectory (APT) mechanism. We highlight the data centric storage mechanism by taking account of supporting large number of users, and make it feasible to provide high-performance accessibility when a non-uniform traffic pattern is offered. Storing data around the localized users by considering spatial data-access locality, the proxy trajectory of APT provides fast response for the users. The trajectory, furthermore, may help the mobile users to roams freely within the area they dwell.

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

The effective channel usage is important for delivering a large number of packets in a short time, and it enhances channel utilization in sensor networks. Channel utilization is a good metric to illustrate MAC protocol efficiency. This paper presents the MAC(Media Access Control) Protocol that combines the advantages of B-MAC(Berkeley-MAC) and TDMA(Time Division Multiple Access) to obtain high channel utilization. Basically, Using the backoff, CCA(Clear Channel Assessment) and LPL(Low Power Listen) mechanisms reduce collision and energy consumption, this protocol makes at the same time transmission method different depending on contention state and obtains high channel utilization. Through the simulation, this paper shows enhanced performance comparing with existing MAC Protocols.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.231-233
• /
• 2015

무선 센서 네트워크는 다수의 센서 노드와 하나의 싱크노드로 구성된다. 센서 네트워크상에 분포된 센서 노드들은 데이터 전송 중에 배터리 재충전이나 변경이 곤란하다. 센서들의 제한적 특성을 때문에 일반 유선 네트워크와 달리 에너지 효율적인 네트워크 설계를 요구한다. 이러한 문제를 해결하기 위해 계층적 클러스터 라우팅 프로토콜로서 LEACH 프로토콜을 분석하고, 센서들의 에너지 소모를 줄이고, 네트워크 수명을 연장하는 개선된 LEACH 라우팅 프로토콜을 제안한다. 최적 클러스터를 결정하는 기법을 이용하여 클러스터 수를 고려한 클러스터를 형성하고, 성능 분석은 MATALAB을 이용하여 시뮬레이션 하였으며, 본 개선된 프로토콜이 LEACH 프로토콜과 비교하여 우수함을 보였다.

• Journal of Convergence Society for SMB
• /
• v.1 no.1
• /
• pp.39-44
• /
• 2011

Recently, due to people's incontinent use all over the world, fossil fuels such as coal, oil, and natural gas were nearly to be exhausted and also causes serious environment pollutions. Therefore, there is a strong need to develop solar, wind, hydro, biomass, geothermal to replace fossil fuels to prevent suffering from above problems. Wish advances in sensor technology, such data is collected as a kind of stream data which arrives in an online manner so that it is characterized as high- speed, real-time and unbounded and it requires fast data processing to get the up-to-date results. Therefore, the traditional data processing techniques are not fit to deal with stream data. In this paper, we propose a kalman filter-based algorithm to process renewable stream data.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.9
• /
• pp.690-694
• /
• 2009

In this paper, we propose a hybrid MAC architecture for reducing energy consumption and maximizing network lifetime in wireless sensor networks. For this purpose, the hybrid MAC architecture is proposed for energy efficient by combining inter-cell TDMA and intra-cell CSMA scheme. Based on the ns-2 simulation result, we prove that the proposed architecture improves energy efficiency as compared with CSMA and TDMA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2A
• /
• pp.160-171
• /
• 2011

The one of the core technologies for ubiquitous computing is WSN. WSN detects the information from the environment around them based on the information perceived from the human and all things and manages the information by connecting to the network in realtime. In this environment, the existing research provides the mechanism that most of sensor nodes in the target area can set the transmission path using RGF. However, unrelated to the target area will be responsible for the energy consumption of nodes that are the problem. In this paper, we propose EEDCP protocol. It is designed to collect data from the specific region on sinks in WSN. EEDCP is the protocol that sets the transmission path for collection data inside the target area in WSN. And this paper is shown that the proposed scheme is more efficient in the energy efficiency and the occurrence rate of isolated nodes by comparison with the previous studies through simulation.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.783-790
• /
• 2009

The necessity of wireless sensor networks is increasing in the recent years. So many researches are studied in wireless sensor networks. The clustering algorithm provides an effective way to prolong the lifetime of the wireless sensor networks. The one-hop routing of LEACH algorithm is an inefficient way in the energy consumption of cluster-head, because it transmits a data to the BS(Base Station) with one-hop. On the other hand, other clustering algorithms transmit data to the BS with multi-hop, because the multi-hop transmission is an effective way. But the multi-hop routing of other clustering algorithms which transmits data to BS with multi-hop have a data bottleneck state problem. The unequal clustering algorithm solved a data bottleneck state problem by increasing the routing path. Most of the unequal clustering algorithms partition the nodes into clusters of unequal size, and clusters closer to the BS have small-size the those farther away from the BS. However, the energy consumption of cluster-head in unequal clustering algorithm is more increased than other clustering algorithms. In the thesis, I propose an energy efficient unequal clustering algorithm which decreases the energy consumption of cluster-head and solves the data bottleneck state problem. The basic idea is divided a three part. First of all I provide that the election of appropriate cluster-head. Next, I offer that the decision of cluster-size which consider the distance from the BS, the energy state of node and the number of neighborhood node. Finally, I provide that the election of assistant node which the transmit function substituted for cluster-head. As a result, the energy consumption of cluster-head is minimized, and the energy consumption of total network is minimized.

• The Journal of the Korea Contents Association
• /
• v.11 no.7
• /
• pp.70-79
• /
• 2011

The multi-path routing schemes that assigns labels to sensor nodes for the reliability of data transmission and the accuracy of an aggregation query over the sensor networks where data transfer is prone to defect have been proposed. However, the existing schemes have high costs for reassigning labels to nodes when the network topology is changed. In this paper, we propose a novel routing method that avoids duplicated data and reduces the update cost of a sensor node. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through the various experiments. Our experimental results show that our proposed method reduces about 95% the amount of the transmitted data for restoration to node failure and about 220% the amount of the transmitted data for query processing over the existing method on average.