• 한국산학기술학회논문지
• /
• 제16권5호
• /
• pp.3421-3425
• /
• 2015

센서 네트워크에서 센서 노드의 구성은 연속적인 단일한 지역에 분포하기도 하지만 네트워크의 특성에 따라 여러 분리된 지역에 노드들이 분포하여 네트워크를 운영할 수 있다. 여러 지역에 분포된 센서 노드에 대한 자료 수집은 기존의 연속적인 지역의 자료 수집과는 특성이 달라질 수 있다. 따라서 분산된 지역에 의한 센서 네트워크의 운영은 기존의 연속적인 네트워크와는 다르게 운영될 수 있다. 본 논문에서는 분산된 지역에서 분포된 센서 노드에 대한 데이터 수집 방안에 대해 기술한다. 분산된 지역의 노드들은 이동 싱크와의 즉각적인 연결이 불가능할 수 있으므로 노드의 운영방안에 대해 고려하여야 한다. 이동 싱크와의 즉각적인 연결 방안에서는 실시간 데이터 전송이 가능하겠지만 분산 지역에서의 싱크 연결은 이동 싱크의 이동 특성을 고려하여야 한다. 본 논문에서는 시뮬레이션 결과를 통하여 제안 방안을 분석하고자 한다. 시뮬레이션 결과에서 분산 센서 네트워크에서 주기적 데이터 수집 방안이 임계치 방안에 의한 데이터 수집보다 전체 운영시간이 더 길게 나타냄을 보이고 있다.

• 정보과학회 논문지
• /
• 제41권11호
• /
• pp.958-966
• /
• 2014

무선 센서 네트워크는 분산처리 환경을 제공해준다. 센서 노드들은 계산 능력, 네트워크 대역폭, 전력 등이 제한된 환경에서 배치되고 스스로 네트워크를 구성하여 수집된 데이터들을 싱크노드로 전송한다. 이런 전형적인 무선 센서 네트워크에서는 네트워크 패킷들 간의 충돌이 발생하며 이로 인해 네트워크 수명이 단축된다. 클러스터링과 네트워크 내부처리는 네트워크 내부의 패킷을 줄여 문제점을 해결한다. 제한된 에너지를 가진 센서 노드가 가능한 오랫동안 동작하게 하는 것이 큰 이슈이기 때문에 많은 연구들이 에너지 절약에 중점을 두고 진행되고 있다. 하지만 본 논문에서는 프로세싱 타임라인에 기반을 둔 협력 처리 모델을 제안한다. 이 모델은 처리의 검증, 총 실행시간의 예측, 무선 센서 네트워크에서 분산 처리에 필요한 최적의 노드 개수의 결정 등을 포함한다. 제안된 모델의 정확성을 실험을 통해 나타내고, 사례 연구로 이 모델이 분산처리 어플리케이션에 사용가능함을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3480-3500
• /
• 2017

Accurate locating for the mobile target remains a challenge in various applications of wireless sensor networks (WSNs). Unfortunately, most of the typical localization algorithms perform well only in the WSN with densely distributed sensor nodes. The non-localizable problem is prone to happening when a target moves into the WSN with sparsely distributed sensor nodes. To solve this problem, we propose a collaborative and predictive localization algorithm (CPLA). The Gaussian mixture model (GMM) is introduced to predict the posterior trajectory for a mobile target by training its prior trajectory. In addition, the collaborative and predictive schemes are designed to solve the non-localizable problems in the two-anchor nodes locating, one-anchor node locating and non-anchor node locating situations. Simulation results prove that the CPLA exhibits higher localization accuracy than other tested predictive localization algorithms either in the WSN with sparsely distributed sensor nodes or in the WSN with densely distributed sensor nodes.

• 센서학회지
• /
• 제28권5호
• /
• pp.277-283
• /
• 2019

In this paper, we propose a distributed fusion estimation for sensor networks using a receding horizon strategy. Communication channels were modelled as Markov jump systems, and a posterior probability distribution for communication channel characteristics was calculated and incorporated into the filter to allow distributed fusion estimation to handle path loss observation situations automatically. To implement distributed fusion estimation, a Kalman-Consensus filter was then used to obtain the average consensus, based on the estimates of sensors randomly distributed across sensor networks. The advantages of the proposed algorithms were then verified using a large-scale sensor network example.

• 한국컴퓨터정보학회논문지
• /
• 제26권11호
• /
• pp.93-99
• /
• 2021

센서 네트워크는 네트워크 응용 목적에 따라 적합하게 설계되어야 하며, 이에 따라서 유효한 응용 기능을 지원할 수 있다. 특정 네트워크 환경을 고려하지 않은 일반적인 전략을 사용하는 것보다 적합한 네트워크 모델의 설계를 기반으로 네트워크 수명시간을 극대화 시킬 수 있다. 본 논문에서는 분산 무선 센서 네트워크에서 이동 싱크에 대한 비결정형 에이전트 방식을 제안한다. 센서 네트워크 지역은 여러 분산 구역으로 나누어질 수 있다. 그러므로 이러한 네트워크에 대해 만족스러운 네트워크 관리를 구현하기 위하여 특정 네트워크 모델에 따른 적합한 방식이 요구된다. 본 논문에서는 제안한 방식에 대한 분석과 시뮬레이션 결과의 평가를 제공한다.

• 한국멀티미디어학회논문지
• /
• 제13권6호
• /
• pp.911-923
• /
• 2010

In wireless sensor networks (WSNs), cluster based data routing protocols have the advantages of reducing energy consumption and link maintenance cost. Unfortunately, most of clustering protocols have been designed for uniformly distributed sensor networks. However, some urgent situations do not allow thousands of sensor nodes being deployed uniformly. For example, air vehicles or balloons may take the responsibility for deploying sensor nodes hence leading a normally distributed topology. In order to improve energy efficiency in such sensor networks, in this paper, we propose a new cluster formation algorithm named DAEEC (Density Aware Energy-Efficient Clustering). In this algorithm, we define two kinds of clusters: Low Density (LD) clusters and High Density (HD) clusters. They are determined by the number of nodes participated in one cluster. During the data routing period, the HD clusters help the neighbor LD clusters to forward the sensed data to the central base station. Thus, DAEEC can distribute the energy dissipation evenly among all sensor nodes by considering the deployment density to improve network lifetime and average energy savings. Moreover, because the HD clusters are densely deployed they can work in a manner of our former algorithm EEVAR (Energy Efficient Variable Area Routing Protocol) to save energy. According to the performance analysis result, DAEEC outperforms the conventional data routing schemes in terms of energy consumption and network lifetime.

• Journal of Communications and Networks
• /
• 제11권4호
• /
• pp.350-358
• /
• 2009

In a wireless sensor network (WSN) setting, this paper presents a distributed decision-making framework and illustrates its application in an online structural health monitoring (SHM) system. The objective is to recover a damage severity vector, which identifies, localizes, and quantifies damages in a structure, via distributive and collaborative decision-making among wireless sensors. Observing the fact that damages are generally scarce in a structure, this paper develops a nonlinear 0-norm minimization formulation to recover the sparse damage severity vector, then relaxes it to a linear and distributively tractable one. An optimal algorithm based on the alternating direction method of multipliers (ADMM) and a heuristic distributed linear programming (DLP) algorithm are proposed to estimate the damage severity vector distributively. By limiting sensors to exchange information among neighboring sensors, the distributed decision-making algorithms reduce communication costs, thus alleviate the channel interference and prolong the network lifetime. Simulation results in monitoring a steel frame structure prove the effectiveness of the proposed algorithms.

• Journal of information and communication convergence engineering
• /
• 제5권4호
• /
• pp.300-304
• /
• 2007

Wireless sensor networks represent a new and exciting communication paradigm which could have multiple applications in future wireless communication. Therefore, performance analysis of such a wireless sensor network paradigm is needed in complex wireless channel. Wireless networks could be an important means of providing ubiquitous communication in the future. In this paper, the BER performance of uniform distributed wireless sensor networks is evaluated in non-Gaussian noise channel. Using an analytical approach, the impact of Av. BER performance relating the coherent BPSK system at the end of a multi-hop route versus the spatial density of sensor nodes and impulsive noise parameters A and $\Gamma$ is evaluated.

• 한국군사과학기술학회지
• /
• 제14권1호
• /
• pp.123-131
• /
• 2011

In this paper, modeling and design of a distributed detection system are considered for an active sonar sensor network. The sensor network has a parallel configuration and it consists of a fusion center and a set of receiver nodes. A system with two receiver nodes is considered to investigate a theoretical aspect of design. To be specific, AND rule and OR rule are considered as the fusion rules of the sensor network. For the fusion rules, it is shown that a threshold rule of each sensor node has uniformly most powerful properties. Optimum threshold for each sensor is obtained that maximizes the probability of detection given probability of false alarm. Numerical experiments were also performed to investigate the detection characteristics of a distributed detection system with multiple sensor nodes. The experimental results show how signal strength, false alarm probability, and the distance between nodes in a sensor field affect the system detection performances.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.667-676
• /
• 2014

Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.