• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권5호
• /
• pp.265-277
• /
• 2008

In spite of previous common assumptions about the incompatibility of public key cryptography (PKC) schemes with wireless sensor networks (WSNs), recent works have shown that they can be utilized for such networks in some manner. The major challenge of employing a PKC-based scheme in a wireless sensor network is posed by the resource limitations of the tiny sensors. Considering this sensor feature, in this paper we propose an efficient PKC-based security architecture with relatively lower resource requirements than those of previously proposed PKC schemes for WSN. In addition, our scheme aims to provide robust security in the network. Our security architecture comprises two basic components; a key handshaking scheme based on simple, linear operations and the derivation of a decryption key by a receiver node. Our architecture enables node-to-base-station and node-to-node secure communications. Analysis and simulation results show that our proposed architecture ensures a good level of security for network communications, and can be effectively implemented with the limited computational, memory, and energy budgets of current-generation sensor nodes.

• International Journal of Internet, Broadcasting and Communication
• /
• 제12권3호
• /
• pp.32-38
• /
• 2020

The deployment of geographically distributed wireless sensors has greatly elevated the capability of monitoring structural health in social-overhead capital (SOC) public infrastructures. This paper deals with the utilization of a distributed mobility management (DMM) approach for the deployment of wireless sensing devices in a structural health monitoring system (SHM). Then, a wireless sensing mechanism utilizing low-energy adaptive clustering hierarchy (LEACH)-based clustering algorithm for smart sensors has been analyzed to support the seamless data transmission of structural health information which is essentially important to guarantee public safety. The clustering of smart sensors will be able to provide real-time monitoring of structural health and a filtering algorithm to boost the transmission of critical information over heterogeneous wireless and mobile networks.

• 한국통신학회논문지
• /
• 제32권5B호
• /
• pp.247-256
• /
• 2007

본 논문에서는 무선 센서 네트워크를 위한 위치 정보의 시간차를 이용한 라우팅 프로토콜(Geo-Back)을 제안한다. Geo-Back은 기존의 위치 기반 라우팅 알고리즘과 달리 주기적인 이웃 노드들의 위치 정보 혹은 하나의 홉 내에 있는 이웃 노드들 수의 정보를 이용하지 않고, 오직 소스와 목적지 노드의 위치 정보만을 이용하며, 최적의 back-off 시간 메커니즘을 사용하여 패킷 전송을 결정한다. 빈번한 토폴로지 변화 환경 하에서, 제안하는 Geo-Back 프로토콜은 업데이트를 위한 브로드캐스트 알고리즘을 사용하지 알고 빠르게 목적지까지 전송하기 위한 최적의 다음 홉을 찾을 수 있으며, 분석 결과 밀집 환경의 무선 센서 네트워크에서 확장성과 향상된 성능을 확인 하였다.

• 한국멀티미디어학회논문지
• /
• 제19권2호
• /
• pp.360-374
• /
• 2016

Since WSNs (Wireless Sensor Networks) applied to their application areas such as smart home, smart factory, environment monitoring, etc., depend on sensor data, the sensor data is the most important among WSN components. The resources of each node consisting of WSN are extremely limited in energy, hardware and so on. Due to these limitation, communication failure probabilities become much higher and the communication failure causes data loss to occur. For this reason, this paper proposes 2MC (Maximum/Minimum Compression) that is a method to compress sensor data by selecting circular queue-based maximum/minimum sensor data values. Our proposed method reduces sensor data losses and value errors when they are recovered. Experimental results of 2MC method show the maximum/minimum 35% reduction efficiency in average sensor data accumulation error rate after the 3 times compression, comparing with CQP (Circular Queue Compression based on Period) after the compressed data recovering.

• 한국컴퓨터정보학회논문지
• /
• 제24권5호
• /
• pp.1-9
• /
• 2019

In this paper, we propose the algorithms which determine 1) the efficient anchor-node visiting route of mobile sink in terms of energy supply and 2) the efficient energy amount to be charged to each anchor node, by using the information of each anchor node and the mobile sink. Wireless sensor networks (WSNs) using mobile sinks can be deployed in more challenging environments such as those that are isolated or dangerous, and can also achieve a balanced energy consumption among sensors which leads to prolong the network lifetime. Most mobile sinks visit only some anchor nodes which store the data collected by the nearby sensor nodes because of their limited energy. The problem of these schemes is that the lifetime of the anchor nodes can be shorten due to the increased energy consumption, which rapidly reduces the overall lifetime of WSN. This study utilizes a mobile sink capable of wireless power transmission to solve this problem, so a mobile sink can gather data from anchor nodes while charging energy to them. Through the performance verification, it is confirmed that the number of blackout nodes and the amount of collected data are greatly improved regardless of the size of the network.

• Journal of information and communication convergence engineering
• /
• 제16권3호
• /
• pp.135-141
• /
• 2018

Wireless sensor networks (WSN) are composed of a large number of sensor nodes. Battery-powered sensor nodes have limited coverage; therefore, it is more efficient to transmit data via multi-hop communication. The network lifetime is a crucial issue in WSNs and the multi-hop routing protocol should be designed to prolong the network lifetime. Prolonging the network lifetime can be achieved by minimizing the power consumed by the nodes, as well as by balancing the power consumption among the nodes. A power imbalance can reduce the network lifetime even if several nodes have sufficient (battery) power. In this paper, we propose a routing protocol that prolongs the network lifetime by balancing the power consumption among the nodes. To improve the balance of power consumption and improve the network lifetime, the proposed routing scheme adaptively controls the transmission range using a power control according to the residual power in the nodes. We developed a routing simulator to evaluate the performance of the proposed routing protocol. The simulation results show that the proposed routing scheme increases power balancing and improves the network lifetime.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권6호
• /
• pp.2518-2533
• /
• 2020

In wireless sensor networks, adversaries may physically capture sensor nodes on the fields, and use them to launch false positive attacks (FPAs). FPAs could be conducted by injecting forged or old sensing reports, which would represent non-existent events on the fields, with the goal of disorientating the base stations and/or reducing the limited energy resources of sensor nodes on the fields. Researchers have proposed various mitigation methods against FPAs, including the statistical en-route filtering scheme (SEF). Most of these methods are based on key pre-distribution schemes and can efficiently filter injected false reports out at relay nodes through the verification of in-transit reports using the pre-distributed keys. However, their filtering power may decrease as time goes by since adversaries would attempt to capture additional nodes as many as possible. In this paper, we propose an adaptive key distribution method that could maintain the security power of SEF in WSNs under such circumstances. The proposed method makes, if necessary, BS update or re-distribute keys, which are used to endorse and verify reports, with the consideration of the filtering power and energy efficiency. Our experimental results show that the proposed method is more effective, compared to SEF, against FPAs in terms of security level and energy saving.

• International journal of advanced smart convergence
• /
• 제3권2호
• /
• pp.1-5
• /
• 2014

Sensor nodes depend on batteries for energy source in Wireless Sensor Networks (WSNs). Low Energy Adaptive Clustering Hierarchy (LEACH) is a representative cluster-based routing protocol designed to ensure energy use efficiency whereas the virtual cluster exchange routing (VCR) information only with its closest node to build a network. In this paper, a protocol scheme was proposed wherein member nodes are designed to compare the currently sensed data with the previously sensed one and to switch to sleep mode when a match is achieved. The design is to help improve the transmission energy efficiency too.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2011년도 춘계학술대회
• /
• pp.390-392
• /
• 2011

배터리에 의해 동작하는 무선 센서로 이루어진 네트워크에서 에너지를 절약하는 메커니즘이 매우 중요하다. 본 연구에서는 클러스터 기반의 무선 센서 네트워크에서 각 센서 노드에서의 에너지 소모에 대한 모델링을 통해 에너지를 절약하면서 각 노드에서 요구되는 QoS를 인식하는 MAC 프로토콜의 조건에 대해 분석하였다. 제안된 방식을 통하여 기존에 제안된 프로토콜들의 장단점을 분석한 후에 이를 통해 무선 네트워크의 수명을 연장할 수 있는 방안을 제안하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권4호
• /
• pp.665-683
• /
• 2011

Wireless sensor networks (WSN) consist of a large amount of sensor nodes distributed in a certain region. Due to the limited battery power of a sensor node, lots of energy-efficient schemes have been studied. Clustering is primarily used for energy efficiency purpose. However, clustering in WSNs faces several unattained issues, such as ensuring connectivity and scheduling inter-cluster transmissions. In this paper, we propose a location-based spiral clustering (LBSC) algorithm for improving connectivity and avoiding inter-cluster collisions. It also provides reliable location aware routing paths from all cluster heads to a sink node during cluster formation. Proposed algorithm can simultaneously make clusters in four spiral directions from the center of sensor field by using the location information and residual energy level of neighbor sensor nodes. Three logical addresses are used for categorizing the clusters into four global groups and scheduling the intra- and inter-cluster transmission time for each cluster. We evaluated the performance with simulations and compared it with other algorithms.