• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3515-3538
• /
• 2015

Data accuracy can be increased by detecting and removing the incorrect data generated in wireless sensor networks. By increasing the data accuracy, network lifetime can be increased parallel. Network lifetime or operational time is the time during which WSN is able to fulfill its tasks by using microcontroller with on-chip memory radio transceivers, albeit distributed sensor nodes send summary of their data to their cluster heads, which reduce energy consumption gradually. In this paper a powerful algorithm using proactive fuzzy system is proposed and it is a mixture of fuzzy logic with comparative correlation techniques that ensure high data accuracy by detecting incorrect data in distributed wireless sensor networks. This proposed system is implemented in two phases there, the first phase creates input space partitioning by using robust fuzzy c means clustering and the second phase detects incorrect data and removes it completely. Experimental result makes transparent of combined correlated fuzzy system (CCFS) which detects faulty readings with greater accuracy (99.21%) than the existing one (98.33%) along with low false alarm rate.

• International Journal of Computer Science & Network Security
• /
• 제23권8호
• /
• pp.159-167
• /
• 2023

Objective: • To detect black hole and warm hole attacks in wireless sensor networks. • To give a solution for energy depletion and security breach in wireless sensor networks. • To address the security problem using strategic decision support system. Methods: The proposed stackelberg game is used to make the spirited relations between multi leaders and multi followers. In this game, all cluster heads are acts as leaders, whereas agent nodes are acts as followers. The game is initially modeled as Quadratic Programming and also use backtracking search optimization algorithm for getting threshold value to determine the optimal strategies of both defender and attacker. Findings: To find optimal payoffs of multi leaders and multi followers are based on their utility functions. The attacks are easily detected based on some defined rules and optimum results of the game. Finally, the simulations are executed in matlab and the impacts of detection of black hole and warm hole attacks are also presented in this paper. Novelty: The novelty of this study is to considering the stackelberg game with backtracking search optimization algorithm (BSOA). BSOA is based on iterative process which tries to minimize the objective function. Thus we obtain the better optimization results than the earlier approaches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1276-1295
• /
• 2023

Sensor networks are now an essential aspect of wireless communication, especially with the introduction of new gadgets and protocols. Their ability to be deployed anywhere, especially where human presence is undesirable, makes them perfect choices for remote observation and control. Despite their vast range of applications from home to hostile territory monitoring, limited battery power remains a limiting factor in their efficacy. To analyze and transmit data, it requires intelligent use of available battery power. Several studies have established effective routing algorithms based on clustering. However, choosing optimal cluster heads and similarity measures for clustering significantly increases computing time and cost. This work proposes and implements a simple two-phase technique of route creation and maintenance to ensure route reliability by employing nature-inspired ant colony optimization followed by the fuzzy decision engine (FDE). Benchmark methods such as PSO, ACO and GWO are compared with the proposed HRCM's performance. The objective has been focused towards establishing the superiority of proposed work amongst existing optimization methods in a standalone configuration. An average of 15% improvement in energy consumption followed by 12% improvement in latency reduction is observed in proposed hybrid model over standalone optimization methods.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2007년도 춘계학술발표대회
• /
• pp.870-872
• /
• 2007

Sensor networks have been widely applied for data collection. Due to the energy limitation of the sensor nodes and the most energy consuming data transmission, we should allocate as much work as possible to the sensors, such as data compression and aggregation, to reduce data transmission and save energy. Querying extreme values is a general query type in wireless sensor networks. In this paper, we propose a novel querying method called Two-Level Filter (TLF) for querying extreme values in wireless sensor networks. We first divide the whole sensor network into domains using the Distributed Data Aggregation Model (DDAM). The sensor nodes report their data to the cluster heads using push method. The advantages of two-level filter lie in two aspects. When querying extreme values, the number of pull operations has the lower boundary. And the query results are less affected by the topology changes of the wireless sensor network. Through this method, the sensors preprocess the data to share the burden of the base station and it combines push and pull to be more energy efficient.

• Restorative Dentistry and Endodontics
• /
• 제32권3호
• /
• pp.180-190
• /
• 2007

이 연구는 강화형 미세입자 복합레진인 Micronew에 Biscover 레진전색제를 적용한 후 칫솔마모시험을 시행하여 복합레진 표면의 조도와 현미경적 변화를 비교함으로써 레진전색제를 복합레진 표면에 재적용할 시기를 알아보고자 하였다. 분리 가능한 알루미늄 판과 복합레진을 이용하여 $8\times3\times2mm$ 크기의 복합레진 시편 200개를 제작하였다. 복합레진 시편의 양쪽표면을 Sof-Lex disc로 거친 입자에서 중간 입자까지 마무리한 후 실온의 증류수에 24시간 동안 보관하였다. 시편은 disc로 마무리만 시행한 F군 (n = 10)과 마무리 후 레진전색제인 Biscover를 적용한 B군 (n = 190)으로 분류하였다. B군은 다시 칫솔질을 가하지 않은 B-IM군 (n = 10)과 칫솔질을 가한 군 (n = 180, B-1군에서 B-18 군)으로 분류하였다. 칫솔질을 가한 군은 칫솔마모검사기의 수조에 페리오 치약과 증류수를 무게 비 50 : 50으로 혼합하여 부은 다음, 홈이 파진 알루미늄 블록에 각 군의 시편을 위치시키고 칫솔을 고정장치에 부착하여 전, 후 왕복운동을 가하여 칫솔질을 가하였다. 칫솔질은 B-1 군에서 B-18군 까지 각각 900회씩 증가시켜 16,200회 까지 시행하였다 표면조도측정기를 사용하여 각 군의 복합레진 표면의 평균 표면조도 값 (Ra)을 산출한 후 통계적으로 분석하였고, 주사전자현미경하에서 각 군의 대표적인 시편 1개를 관찰하여 다음과 같은 결과를 얻었다. 1. F군의 Ra는 $0.898{\pm}0.145{\mu}m$, B-IM군의 Ra는 $0.289{\pm}0.142{\mu}m$를 나타냈으며, B-1 군에서 B-18 군까지의 Ra는 점차적으로 증가하여 B-1 군에서 $0.299{\pm}0.48{\mu}m$, B-18 군에서 $0.642{\pm}0.313{\mu}m$까지 나타났다. 2. Ra 최종 군집중심은 군집 1 $(B-IM\simB-7)$에서 $0.361{\mu}m$, 군집 2 $(B-8\simB-14)$에서 $0.511{\mu}m$, 군집 3 $(B-15\simB-18)$에서 $0.624{\mu}m$를 나타내어 각 군집의 Ra 최종 군집중심 간에 통계학적으로 유의한 차이를 나타내었다. (F = 49.705, p = 0.000) 3. B-IM군의 Ra 증감율은 F 군에 비해 210.72%감소되었으며, B-8 군과 B-15군의 Ra 증감율은 B-IM군에 비해 각각 35.49%와 51.35% 증가되었다. 4. FE-SEM 관찰에서 B-IM 군은 매우 평활한 복합레진 표면을 나타내었고, B-8 군은 전체적으로 평활한 복합레진 표면을 보였지만 표면에 수직으로 아주 얕은 흠집을 나타내었다. B-15 군은 복합레진 표면의 중앙에서 B-8군보다 더 넓고 불규칙한 수직의 흠집을 나타내었고, B-18군은 복합레진 표면 전체에 넓은 흠집을 나타내었다.

• 전자공학회논문지
• /
• 제50권4호
• /
• pp.252-258
• /
• 2013

WSN (Wireless sensor network)은 에너지 제한적인 네트워크이기에 노드의 에너지 효율성이 중요한 문제이다. 라운드 단위로 동작하는 클러스터링은 노드의 먼 거리 통신을 피할 수 있기에 네트워크 수명을 증가시키는 효율적인 방법이며 그 성능은 라운드 시간에 좌우된다. 짧은 라운드 시간은 잦은 클러스터 재구성을 발생시키고 반면 긴 라운드 시간은 클러스터 헤드의 에너지 소비를 증가시킨다. 그래서 현존하는 클러스터링 기법들은 네트워크 초기 변수들을 기반으로 적절한 라운드 시간을 결정한다. 하지만 무선 센서 네트워크는 운용 특성 상 노드가 추가될 수도 혹은 사라질 수도 있는 동적인 네트워크이기에 네트워크 전체 수명에 대해 네트워크 구성 초기 파라미터를 계속 적용하는 것은 적절치 못하다. 본 논문에서는 현재 필드에 살아있는 노드의 수를 기반으로 라운드 시간을 계산하는 방법을 제안하여 노드 수가 변화할 수 있는 동적인 네트워크에 적응하도록 하였다. 성능 분석 결과 기존에 비해 노드의 에너지 소비량이 감소하였으며 수신되는 데이터 손실도 감소함을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2577-2596
• /
• 2013

In this paper, we present an Energy-Aware Self-Stabilizing Distributed Clustering protocol based on message-passing model for Ad Hoc networks. The latter does not require any initialization. Starting from an arbitrary configuration, the network converges to a stable state in a finite time. Our contribution is twofold. We firstly give the formal proof that the stabilization is reached after at most n+2 transitions and requires at most $n{\times}log(2n+{\kappa}+3)$ memory space, where n is the number of network nodes and ${\kappa}$ represents the maximum hops number in the clusters. Furthermore, using the OMNeT++ simulator, we perform an evaluation of our approach. Secondly, we propose an adaptation of our solution in the context of Wireless Sensor Networks (WSNs) with energy constraint. We notably show that our protocol can be easily used for constructing clusters according to multiple criteria in the election of cluster-heads, such as nodes' identity, residual energy or degree. We give a comparison under the different election metrics by evaluating their communication cost and energy consumption. Simulation results show that in terms of number of exchanged messages and energy consumption, it is better to use the Highest-ID metric for electing CHs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.504-521
• /
• 2016

Recently, energy harvesting technology has been integrated into wireless sensor networks to ameliorate the nodes' energy limitation problem. In theory, the wireless sensor node equipped with an energy harvesting module can work permanently until hardware failures happen. However, due to the change of power supply, the traditional hierarchical network routing protocol can not be effectively adopted in energy harvesting wireless sensor networks. In this paper, we improve the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol to make it suitable for the energy harvesting wireless sensor networks. Specifically, the cluster heads are selected according to the estimation of nodes' harvested energy and consumed energy. Preference is given to the nodes with high harvested energy while taking the energy consumption rate into account. The utilization of harvested energy is mathematically formulated as a max-min optimization problem which maximizes the minimum energy conservation of each node. We have proved that maximizing the minimum energy conservation is an NP-hard problem theoretically. Thus, a polynomial time algorithm has been proposed to derive the near-optimal performance. Extensive simulation results show that our proposed routing scheme outperforms previous works in terms of energy conservation and balanced distribution.

• 정보처리학회논문지C
• /
• 제13C권1호
• /
• pp.103-112
• /
• 2006

센서 네트워크에서 센서 노드는 제한된 배터리 용량을 가지기 때문에 에너지 효율적인 라우팅을 통한 네트워크 수명의 최대화가 매우 중요하다. 따라서 많은 라우팅 프로토콜들이 개발되었으며 이는 크게 평면 라우팅과 계층적 라우팅으로 분류된다. 최근 계층적 라우팅 방안에 초점을 맞추고 많은 연구가 이루어지고 있으며 대표적인 방안으로 LEACH가 있다. 본 논문에서는 LEACH의 문제점을 분석하고 이를 보완하기 위한 새로운 라우팅 방안으로 ENTER (ENergy efficient Two-tiEr Routing protocol)를 제안한다. ENTER는 LEACH에서 사용된 분산 알고리즘을 통해 클러스터를 형성하며 클러스터 헤드간에 경로를 형성하여 싱크 노드로 통합된 데이터를 전송함으로써 에너지 손실을 줄이고 네트워크 수명을 증가시킨다. 시뮬레이션을 통해 LEACH와 ENTER의 성능을 비교하였으며, 제안된 ENTER가 더 효율적으로 에너지를 이용함으로써 네트워크 수명이 증가함을 알 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권8호
• /
• pp.2188-2208
• /
• 2023

Quality of Service (QoS) is a critical feature of Wireless Sensor Networks (WSNs) with routing algorithms. Data packets are moved between cluster heads with QoS using a number of energy-efficient routing techniques. However, sustaining high scalability while increasing the life of a WSN's networks scenario remains a challenging task. Thus, this research aims to develop an energy-balancing component that ensures equal energy consumption for all network sensors while offering flexible routing without congestion, even at peak hours. This research work proposes a Gravitational Blackhole Search Optimised splay tree routing framework. Based on the splay tree topology, the routing procedure is carried out by the suggested method using three distinct steps. Initially, the proposed GBSO decides the optimal route at initiation phases by choosing the root node with optimum energy in the splay tree. In the selection stage, the steps for energy update and trust update are completed by evaluating a novel reliance function utilising the Parent Reliance (PR) and Grand Parent Reliance (GPR). Finally, in the routing phase, using the fitness measure and the minimal distance, the GBSO algorithm determines the best route for data broadcast. The model results demonstrated the efficacy of the suggested technique with 99.52% packet delivery ratio, a minimum delay of 0.19 s, and a network lifetime of 1750 rounds with 200 nodes. Also, the comparative analysis ensured that the suggested algorithm surpasses the effectiveness of the existing algorithm in all aspects and guaranteed end-to-end delivery of packets.