• Journal of Communications and Networks
• /
• 제17권6호
• /
• pp.602-608
• /
• 2015

In this paper, the limited error tracking problem is investigated for distributed leader-following wireless sensor networks (LFWSNs), where all sensors share data by the local communications, follower sensors are influenced by leader sensors directly or indirectly, but not vice versa, all sensor nodes track a reference state that is determined by the states of all leader sensors, and tracking errors are limited. In a LFWSN, the communicating graph is mainly expressed by some complete subgraphs; if we fix subgraphs that are composed of all leaders while all nodes in complete subgraphs of followers run on the sleeping-awaking method, then the fixed leaders and varying followers topology is obtained, and the switching topology is expressed by a Markov chain. It is supposed that the measurements of all sensors are corrupted by additive noises. Accordingly, the limited error tracking protocol is proposed. Based on the theory of asymptotic boundedness in mean square, it is shown that LFWSN keeps the limited error tracking under the designed protocol.

• Smart Structures and Systems
• /
• 제5권6호
• /
• pp.681-697
• /
• 2009

Limited, noisy data in vibration testing is a hindrance to the development of structural damage detection. This paper presents a method for optimizing sensor placement and performing damage detection using finite element model updating. Sensitivity analysis of the modal flexibility matrix determines the optimal sensor locations for collecting information on structural damage. The optimal sensor locations require the instrumentation of only a limited number of degrees of freedom. Using noisy modal data from only these limited sensor locations, a method based on model updating and changes in the flexibility matrix successfully determines the location and severity of the imposed damage in numerical simulations. In addition, a steel cantilever beam experiment performed in the laboratory that considered the effects of model error and noise tested the validity of the method. The results show that the proposed approach effectively and robustly detects structural damage using limited, optimal sensor information.

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

Sensors used in Wireless Sensor Networks (WSN) have mostly limited capacity which affects the performance of their applications. One of the data-gathering methods is to use mobile sinks to visit these sensors so that they can save their limited battery energies from forwarding data packages to static sinks. The main disadvantage of employing mobile sinks is the delay of data collection due to relative low speed of mobile sinks. Since sensors have very limited memory capacities, whenever a mobile sink is too late to visit a sensor, that sensor's memory would be full, which is called a 'memory overflow', and thus, needs to be purged, which causes loss of collected data. In this work, a method is proposed to generate mobile sink tours, such that the number of overflows and the amount of lost data are minimized. Moreover, the proposed method does not need either the sensor locations or sensor memory status in advance. Hence, the overhead stemmed from the information exchange of these requirements are avoided. The proposed method is compared with a previously published heuristic. The simulation experiment results show the success of the proposed method over the rival heuristic with respect to the considered metrics under various parameters.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.766-769
• /
• 2005

In a ubiquitous environment made up of multiple sensors, most sensors participate in communications with limited battery, and the sensor node isn't able to participate in communications when all the battery is used up. When an existing authentication method is used for the sensor node which has to participate in a long term communication with limited battery, it creates a problem by making the length of network maintenance or sensor node's operation time relatively shorte. Therefore, a network structure where RM (Register Manager) node and AM (Authentication Manager) node are imported to solve the energy consumption problem during a communication process is presented in this thesis. This offers a low power protocol based on safety through a mutual authentication during communications. Through registration and authentication manager nodes, each sensor nodes are ensured of safety and the algorithm of key's generation, encryption/descramble and authentication is processed with faster operation speed. So the amount of electricity used up during the communications between sensor nodes has been evaluated. In case of the amount of electrical usage, an average of $34.783\%$ for the same subnet and 36.855 for communications with two different subnets, are reduced. The proposed method is a protocol which maintains the limited battery for a long time to increase the effectiveness of energy usage in sensor nodes and can also increase the participation rate of communication by sensor nodes.

• Journal of Information Processing Systems
• /
• 제7권1호
• /
• pp.29-42
• /
• 2011

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

• 전기학회논문지P
• /
• 제56권1호
• /
• pp.28-36
• /
• 2007

Sensor networks are usually composed of tens or thousands of tiny devices with limited resources. Because of their limited resources, many researchers have studied on the energy management in the WSNs(Wireless Sensor Networks), especially taking into account communications efficiency. For effective data transmission and sensor fault detection in sensor network environment, a new remote monitoring system based on PCA(Principle Component Analysis) and AANN(Auto Associative Neural Network) is proposed. PCA and AANN have emerged as a useful tool for data compression and identification of abnormal data. Proposed system can be effectively applied to sensor network working in LEA2C(Low Energy Adaptive Connectionist Clustering) routing algorithms. To verify its applicability, some simulation studies on the data obtained from real WSNs are executed.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.627-628
• /
• 2008

This paper proposes an indoor air Quality monitoring system for measuring various indoor air qualities using IEEE 802.15.4 based wireless sensor network. For indoor air quality monitoring, sensor nodes include carbon monoxide sensor and dust sensor were used. The wireless network by deployed sensor nodes has limited energy, computing, communication capabilities and memory sizes. In this paper, the query process in indoor air quality monitoring was designed to improve the limited sensor node resources such as battery consumption and networking.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.357-360
• /
• 2007

An asset tracking using wireless sensor network is concerned with geographical locations of sensor nodes. The limited size of sensor nodes makes them attractable for tracking service, at the same time their size causes power restrictions, limited computation power, and storage restrictions. Due to such constrained capabilities, the wireless sensor network basically assumes the failure of sensor nodes. This causes a set of concerns in designing asset tracking system on wireless sensor network and one of the most critical factors is location uncertainty of sensor nodes. In this paper, we classify the location uncertainty problem in asset tracking system into following cases. First, sensor node isn't read at all because of sensor node failure, leading to misunderstanding that asset is not present. Second, incorrect location is read due to interference of RSSI, providing unreliable location of asset. We implemented and installed our asset tracking system in a real environment and continuously monitored the status of asset and measured error rate of location of sensor nodes. We present experimental results that demonstrate the location uncertainty problem in asset tracking system using wireless sensor network.

• 한국멀티미디어학회논문지
• /
• 제19권5호
• /
• pp.910-917
• /
• 2016

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to the sink node to pass collected data. However, the communication distance of the sensor nodes at low cost and at low power is not long, it requires a data transfer through the multi-hop to transmit data to the sink node. In the existing cluster-based sensor network studies, cluster process and route selection process are performed separately in order to configure the routing path to the sink node. In this paper, in order to use the energy of the sensor nodes that have limited resources efficiently, a cluster-based multi-hop routing protocol which merges the clustering process and routing process is proposed. And the proposed method complements the problem of uneven cluster creation that may occur in probabilistic cluster methods and increases the energy efficiency of whole sensor nodes.

• 한국지능시스템학회논문지
• /
• 제17권6호
• /
• pp.760-765
• /
• 2007

센서 네트워크 시스템은 한정된 자원을 갖는 센서노드들을 광대한 영역에 설치하여 새로운 정보를 수집하고 모니터링하는 기능을 한다. 센서 노드와 센서의 고장(Sensor node faulty or Sensor faulty)은 열악한 설치 환경이나 제한된 리소스에 의해 종종 발생되는데 이들 고장은 네트워크 내에서 요구되는 양질의 서비스 제공에 많은 문제를 가져온다. 본 논문에서는 센서 노드의 고장 검출 알고리즘으로 알려져 있는 Consensus 알고리즘과 센서노드에서 사용되는 센서의 고장을 검출할 수 있는 localized faulty sensor detection 알고리즘을 혼합하여 시스템에 안정된 서비스를 제공할 수 있는 방법을 제안하며 실제 시뮬레이션과 제작된 실험장치에 적용함으로써 그 유용성을 확인하고자 한다.