• Journal of the Korea Society for Simulation
• /
• v.29 no.3
• /
• pp.73-82
• /
• 2020

In the fourth industrial revolution, wireless sensor networks (WSNs) are an important element of collecting and analyzing data in a variety of environments without human intervention. This sensor network is greatly affected by topology and routing protocols. Routing protocols, which affect energy consumption, are executed after deploying sensor nodes. Once built, they are difficult to change. Before the WSN is deployed, a routing protocol is carefully selected in view of various environments and the performance of the protocol is evaluated. In this paper, we propose a model to simulate multiple routing protocols using a discrete event system specification (DEVS). The DEVS-based proposed model simulates various situations without changes and structures of the its model as algorithms of the routing protocols are implemented in its coordinators model. To verify normal behaviors of the proposed model, the number of report delivery and the energy consumption of the sensor network were compared using representative protocols LEACH and Dijkstra. As a result, it was confirmed that the proposed model executes normally in both routing protocols.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.85-89
• /
• 2006

센서네트워크에는 한 가지 종류의 센서만을 사용하는 것이 아니라 여러 가지 종류의 센서를 하나의 네트워크에 연결하여 한 번에 여러 종류의 센서의 질의를 수행할 수 있어야 한다. 이 경우에 다양한 센서가 부착된 네트워크에서 한 가지 종류의 센서에 대한 질의를 수행할 경우 해당되는 센서를 포함하지 않는 센서에 대해서도 질의를 수행해야 한다. 본 논문에서는 여러 종류의 센서가 부착된 센서네트워크에서 라우팅 테이블을 이용하여 질의를 최적화하는 방법을 제안한다. 센서노드의 라우팅 테이블에는 그 센서가 질의명령어를 보내고 받아야 하는 센서노드에 대한정보를 포함한다. 자식노드에 명령어를 보낼 경우 하위노드에서 질의하는 센서의 종류가 없을 경우에도 명령어를 보내야 한다. 이 경우 하위 자식노드에 원하는 센서의 종류에 관한 정보를 포함하면 센서의 종류에 따라서 불필요한 명령어의 수행을 줄일 수 있도록 하였다. 이 방법은 ATmega128 CPU를 장착한 Nano-Q+ 시스템에서 구현되었다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.11
• /
• pp.2187-2192
• /
• 2016

A data-centric routing protocol considering a data aggregation technique at relay nodes is required to increase the lifetime of wireless sensor networks. An energy-efficient data-centric routing algorithm is proposed by considering a tradeoff between acquisition time and energy consumption in the wireless sensor network. First, the proposed routing scheme decides the sink node among all sensor nodes in order to minimize the maximum distance between them. Then, the proposed routing extends its tree structure in a way to minimize the link cost between the connected nodes for reducing energy consumption while minimizing the maximum distance between sensor nodes and a sink node for rapid information gathering. Simulation results show that the proposed data-centric routing algorithm has short information acquisition time and low energy consumption; thus, it achieves high energy efficiency in the wireless sensor network compared to conventional routing algorithms.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.2
• /
• pp.48-62
• /
• 2006

In recent years, wireless sensor networks(WSNs) have emerged as a new fast-growing application domain for wireless distributed computing and embedded systems. Recent Progress in computer and communication technology has made it possible to organize wireless sensor networks composed tiny sensor nodes. Furthermore, ad-hoc network protocols do not consider the characteristics of wireless sensor nodes, making existing ad-hoc network protocols unsuitable for the wireless sensor networks. First, we propose power-aware routing protocols based on energy-centered routing metrics. Second, we describe power management techniques for wireless sensor nodes using the spatial locality of sensed data. Many nodes can go into a power-down mode without sacrificing the accuracy of sensed data. Finally, combining the proposed techniques, we describe an overall energy-efficient protocol for data collection. Experimental results show that the proposed routing protocol can extend the routing path lifetime more than twice. The average energy consumption per sensing period is reduced by up to 30%.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2007.06a
• /
• pp.59-64
• /
• 2007

데이타 중심 센서 네트워크에서는 측정된 데이타의 값에 따라 데이타를 저장하는 센서 노드가 결정되기 때문에 같은 값을 갖는 데이타가 빈번하게 발생하면 이를 저장하는 센서 노드에 부하가 집중되어 에너지가 빠르게 고갈되는 문제가 있다. 또한 센서 네트워크가 확장되면 데이타 저장 및 질의 처리시 목적 센서 노드로의 라우팅 거리가 멀어져 통신 비용이 증가되는 문제가 있다. 그러나 기존 연구들은 데이타 저장의 효율적인 관리에만 치우쳐 이와 같은 문제를 효율적으로 해결하지 못하고 있다. 본 논문에서는 이러한 문제를 해결하기 위해 비균등 네트워크 분할(Non-Uniform Network Spilt: NUNS) 기법을 제안한다. NUNS는 센서 네트워크를 센서 노드 개수와 분할된 영역 크기 차이가 최소가 되도록 비균등 크기의 Partition으로 분할하고 각 Partition에서 발생한 데이타를 그 Partition 내의 센서 노드가 저장 관리함으로써 센서 노드의 데이타 저장 부하를 분산시키고, 센서 네트워크의 확장에 따른 통신 비용을 줄인다. 그리고 NUNS는 각 Partition을 분할된 영역 크기 차이가 최소가 되도록 센서 노드 개수만큼 비균등하게 Zone으로 분할함으로써 센서 노드가 없는 Zone으로 인해 센서 노드에 부하가 집중되는 것을 막고 불필요한 라우팅 비용을 줄인다.

• The Journal of the Korea Contents Association
• /
• v.6 no.5
• /
• pp.35-41
• /
• 2006

Conventional studies for SPIN protocols of wireless sensor networks are not enough to cover energy consumption and migration of sensor nodes. This study proposes a dynamic routing protocol based on the SPIN considering energy consumption and the migration, and also shows the effectiveness of the proposed routing protocol.

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

The efficient node-energy utilization in wireless sensor networks has been studied because sensor nodes operate with limited power based on battery. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing total energy consumption of the overall network. Since a large number of sensor nodes are densely deployed and collect data by cooperation in wireless sensor network, keeping more sensor nodes alive as possible is important to extend the lifetime of the sensor network. In this paper, we submit an efficient energy aware routing protocol based on AODV ad hoc routing protocol for wireless sensor networks to increase its lifetime without degrading network performance. The proposed protocol is designed to avoid traffic congestion on minor specific nodes at data transfer and to make the node power consumption be widely distributed to increase the lifetime of the network. The performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of network lifetime and end-to-end delay.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.649-651
• /
• 2018

Since the ubiquitous sensor network is not connected to external power source and operated by its own battery, it is required to maximize the network life using the efficient energy utilization. In a conventional hop count based routing protocol, most sensor nodes are designed with a constant transmission power. In this paper, we propose a routing protocol that prolongs the network lifetime by balancing the power consumption among the nodes by controlling the transmit power according to the residual power of the nodes, and compared the performance of the proposed routing protocol through computer simulations.

• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.358-363
• /
• 2005

본 논문에서는 전력 제어를 통해 에너지 소비를 최소화하여 네트워크 수명을 극대화 시킬 수 있는 효율적인 라우팅 방안을 제안하였다. 제안한 프로토콜에서 센서 노드들은 여러 개의 단위 전력을 가지고 있어 독립적인 라우팅 테이블을 형성하게 된다. 이를 토대로 가장 에너지 소비가 적은 경로를 설정하여 데이터를 전송하게 된다. 또한 특정 노드가 더 이상 기능을 하지 못하는 경우에도 적응적으로 경로를 재설정하여 데이터를 전송할 수 있도록 설계하였다. 이렇게 제안한 프로토콜과 기존의 방식과의 비교 실험을 통해 제안한 라우팅 방식의 성능을 효율적 에너지 소비 측면에서 분석하였다. 그 결과 논문에서 제안한 프로토콜의 성능이 기존의 방식과 비교하여 향상되었음을 확인하였다.

• Journal of KIISE:Information Networking
• /
• v.37 no.6
• /
• pp.453-458
• /
• 2010

In the paper, we propose an energy efficient sensor network management scheme. In the proposed scheme, the modified game theory and ${\varepsilon}$-constraint techniques are sophisticatedly combined to establish energy efficient routing paths. Simulation results indicate that the proposed scheme can strike an appropriate performance balance between conflicting requirements while other existing schemes cannot offer such an attractive performance.