• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2004.06a
• /
• pp.8-13
• /
• 2004

무선 센서 망을 구성하는 각 노드는 크기가 작고 가진 에너지 또한 매우 적기 때문에 오랜 시간 동안 노드가 활동하기 위해서는 에너지 소모를 최소로 하는 것이 관건이다. 무선 센서 망은 애드 혹 망과 매우 유사하지만, 통신, 전력소모 그리고 계산능력 측면에서 제약을 받는다. 각 노드들은 응용계층에서는 적은 양의 데이터를 생성하고, 느린 속도로 전송되는 특징을 가진다. 각각의 노드들은 소스(source)와 싱크(sink)가 될 수 있는 일반적인 애드 혹 환경과는 달리 하나의 기지국(base station)이 싱크의 역할을 하고 싱크를 제외한 노드들은 소스의 역할을 하게 된다. 또한 무선 센서 망은 설치된 후 지속적으로 주변을 관찰하고 고정된 상태로 있는 것이 대부분이다. 기존 애드 혹 망에서 라우팅 프로토콜은 이러한 무선 센서 망의 특징을 만족할 수 없다. 본 논문에서는 무선 센서 망의 통신 형태의 특징을 고려하여 트리 기반 라우팅 프로토콜을 확장한 에너지 측면에서 효율적인 라우팅 프로토콜을 제안한다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.29-36
• /
• 2016

A wireless passive sensor network is a network which, by letting separate RF sources supply energy to sensor nodes, is able to live an eternal life without batteries. Against expectations about an eternal life, however, a wireless passive sensor network still has many problems; scarcity of energy, non-simultaneity of energy reception and data transmission and inefficiency in resource allocation. In this paper, we focus on a wireless passive sensor network providing a packet service which is tolerable to packet losses but requires timely delivery of packets. Perceiving the practical constraints, we then consider a contending-type MAC scheme, rooted in framed and slotted ALOHA, for supporting many sensor nodes to deliver packets to a sink node. Next, we investigate the network-wide throughput achieved by the MAC scheme when the packets transmitted by geographically scattered sensor nodes experience path losses hence capture phenomena. Especially, we derive an exact formula of network-wide throughput in a closed form when 2 sensor nodes reside in the network. By controlling design parameters, we finally optimize the contending-type MAC scheme as to attain the maximum network-wide throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.338-348
• /
• 2009

The Wireless Sensor Network (WSN) has recently attracted considerable attention due to the low price and ease to deploy it. In particular, in a hostile or harsh regions where sensors cannot be deployed manually, WSNs can be established just by dropping sensors from the air. In this case, however, most likely sensors are not placed at optimal positions, although the location of sensors does have a drastic impact on the WSN performance. Moreover, randomized deployment algorithm can leave holes in terms of coverage in the sensing area. This paper proposes a sensor relocation scheme where mobile sensors move to patch up the holes by appropriate coverage. Simulation results show that the proposed algorithm outperforms prior existing schemes in terms of coverage and lifespan of WSNs.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.166-170
• /
• 2007

전형적인 무선 센서망은 센서들과 싱크로 구성된다. 그리고 사용자는 싱크로부터 원하는 정보를 요구 혹은 획득한다. 그 개체들은 무선 센서 망에서 이동성 환경을 각각 독립적으로 제공할 수 있다. 그에 비해, 기존 연구들은 센서 노드, 싱크, 그리고 이벤트 이동성만을 고려한다. 그러나, 또 하나의 이동성을 제공하는 가능한 개체로서 정보 요구자(사용자)가 있다. 정보 요구자 노드는 센서 망 내부에서 이동하면서 싱크에게 원하는 정보를 요구할 수 있다. 본 논문은 기존에 제안된 이동성 모델들을 분석하고, 새로운 이동성 모델인 정보 요구자 이동성 모델을 제안한다.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2010.04a
• /
• pp.658-661
• /
• 2010

본 논문에서는 교량의 볼트 체결부, 응력집중부 등 손상의 발생이 유력한 위치에 부착된 압전센서-무선 임피던스 센서노드를 통해 구조물의 건전성을 지속적으로 모니터링 하는 시스템을 소개하였다. 임피던스 기반 건전성 모니터링에 있어서 구조물에 발생하는 손상에 따라 민감하게 반응하는 주파수 성분이 달라지기 때문에, 이러한 주파수 영역을 자동으로 결정함과 동시에 손상에 관한 정보를 획득하기 위하여 인공신경망 기법을 적용하였다. 제안된 기법은 기존에 구축되어 있는 데이터베이스를 기반으로 구조물에 발생한 손상의 종류 및 손상의 정도를 판단하는 것을 목적으로 한다. 무선 임피던스 센서노드-인공신경망 기반 손상탐색 통합 시스템은 실제 강교량에서 발생한 볼트풀림, 균열 등 국부적인 손상의 진단을 위하여 적용되었으며, 그 유효성을 입증하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.4
• /
• pp.793-797
• /
• 2004

Wireless sensor networks use battery-operated computing and sensing devices. And It can be expected to be deployed in an ad hoc networs. MAC is different from traditional wireless MACs such as IEEE 802.11 in almost every way. so self-configuration and power saving in sensor network are very important goals, while per-node fairness and latency are less important. In this paper, so we use a given prototype for efficient energy conservation to reduce power consumtion that is one of the important character in sensor network and compare energy consumption and collision with IEEE 802.11 MAC. finally we conclude the paper and analyze it.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.182-185
• /
• 2004

Wireless sensor networks use battery-operated computing and sensing devices. And It can be expected to be deployed in an ad hoc networs. MAC is different from traditional wireless MACs such as IEEE 802.11 in almost every way. so self-configuration and power saving in sensor network are very important goals, while per-node fairness and latency are less important. In this paper, so we use a given prototype for efficient energy conservation to reduce power consumtion that is one of the important character in sensor network and compare energy consumption and collision with IEEE 802.11 MAC. Finally we conclude the paper and analyze it.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.206-214
• /
• 2016

Recently, radio frequency energy transfer (RFET) attracts more and more interests for powering sensor nodes in the wireless sensor network (WSN). In the conventional WSN, reducing energy consumption of sensor nodes is of primary importance. On the contrary, in the WSN with RFET, reducing energy consumption is not an important issue. However, in the WSN with RFET, the energy harvesting rate of each sensor node depends on its location, which causes the unbalanced available energy among sensor nodes. Hence, to improve the performance of the WSN with RFET, it is important to develop network protocols considering this property. In this paper, we study this issue with jointly considering routing, scheduling, and power control in the WSN with RFET. In addition, we study this issue with considering two different objectives: 'Max-min' with which we tries to maximize the performance of a sensor node having the minimum performance and 'Max-min fairness' with which we tries to achieve max-min fairness among sensor nodes. We show that our solutions can improve network performance significantly and we also discuss the differences between 'Max-min' and 'Max-min fairness'.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.621-628
• /
• 2009

Wireless sensor networks (WSNs) have been considered as a promising method for reliably monitoring both civil and military environments under hazardous or dangerous conditions. Due to the special property and difference from the traditional wireless network, the lifetime of the whole network is the most important aspect. The bottleneck nodes widely exist in WSNs and lead to decrease the lifetime of the whole network. In order to find out the bottleneck nodes, the traditional centralized bottleneck detection method MINCUT has been proposed as a solution for WSNs. However they are impractical for the networks that have a huge number of nodes. This paper first proposes a distributed algorithm called DBND (Distributed Bottleneck Node detection) that can reduce the time for location information collection, lower the algorithm complexity and find out the bottleneck nodes quickly. We also give two simple suggestions of how to solve the bottleneck problem. The simulation results and analysis show that our algorithm achieves much better performance and our solutions can relax the bottleneck problem, resulting in the prolonging of the network lifetime.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.53-61
• /
• 2008

Consider a typical wireless sensor network in which stem nodes form the backbone network of mesh topology while each stem node together with leaf nodes in its vicinity forms a subnetwork of star topology. In such a wireless sensor network, we must heed the following when we design a MAC scheme supporting the packet delivery from a leaf node to a stem node. First, leaf nodes are usually battery-powered and it is difficult to change or recharge their batteries. Secondly, a wireless sensor network is often deployed to collect and update data periodically. Late delivery of a data segment by a sensor node causes the sink node to defer data processing and the data segment itself to be obsolete. Thirdly, extensive signaling is extremely limited and complex computation is hardly supported. Taking account of these facts, a MAC scheme must be able to save energy and support timeliness in packet delivery while being simple and robust as well. In this paper, we propose a version of ALOHA as a MAC scheme for a wireless sensor network. While conserving the simplicity and robustness of the original version of ALOHA, the proposed version of ALOHA possesses a distinctive feature that a sensor node decides between stop and continuation prior to each delivery attempt for a packet. Such a decision needs a stopping rule and we suggest a Bayes stopping rule. Note that a Bayes stopping rule minimizes the Bayes risk which reflects the energy, timeliness and throughput losses. Also, a Bayes stopping rule is practical since a sensor node makes a decision only using its own history of delivery attempt results and the prior information about the failure in delivery attempt. Numerical examples confirm that the proposed version of ALOHA employing a Bayes stopping rule is a useful MAC scheme in the severe environment of wireless sensor network.