• Title/Summary/Keyword: Sensor nodes

Search Result 2,025, Processing Time 0.034 seconds

RPIDA: Recoverable Privacy-preserving Integrity-assured Data Aggregation Scheme for Wireless Sensor Networks

  • Yang, Lijun;Ding, Chao;Wu, Meng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.5189-5208
    • /
    • 2015
  • To address the contradiction between data aggregation and data security in wireless sensor networks, a Recoverable Privacy-preserving Integrity-assured Data Aggregation (RPIDA) scheme is proposed based on privacy homomorphism and aggregate message authentication code. The proposed scheme provides both end-to-end privacy and data integrity for data aggregation in WSNs. In our scheme, the base station can recover each sensing data collected by all sensors even if these data have been aggregated by aggregators, thus can verify the integrity of all sensing data. Besides, with these individual sensing data, base station is able to perform any further operations on them, which means RPIDA is not limited in types of aggregation functions. The security analysis indicates that our proposal is resilient against typical security attacks; besides, it can detect and locate the malicious nodes in a certain range. The performance analysis shows that the proposed scheme has remarkable advantage over other asymmetric schemes in terms of computation and communication overhead. In order to evaluate the performance and the feasibility of our proposal, the prototype implementation is presented based on the TinyOS platform. The experiment results demonstrate that RPIDA is feasible and efficient for resource-constrained sensor nodes.

Wireless structural health monitoring of stay cables under two consecutive typhoons

  • Kim, Jeong-Tae;Huynh, Thanh-Canh;Lee, So-Young
    • Structural Monitoring and Maintenance
    • /
    • v.1 no.1
    • /
    • pp.47-67
    • /
    • 2014
  • This study has been motivated to examine the performance of a wireless sensor system under the typhoons as well as to analyze the effect of the typhoons on the bridge's vibration responses and the variation of cable forces. During the long-term field experiment on a real cable-stayed bridge in years 2011-2012, the bridge had experienced two consecutive typhoons, Bolaven and Tembin, and the wireless sensor system had recorded data of wind speeds and vibration responses from a few survived sensor nodes. In this paper, the wireless structural health monitoring of stay cables under the two consecutive typhoons is presented. Firstly, the wireless monitoring system for cable-stayed bridge is described. Multi-scale vibration sensor nodes are utilized to measure both acceleration and PZT dynamic strain from stay cables. Also, cable forces are estimated by a tension force monitoring software based on vibration properties. Secondly, the cable-stayed bridge with the wireless monitoring system is described and its wireless monitoring capacities for deck and cables are evaluated. Finally, the structural health monitoring of stay cables under the attack of the two typhoons is described. Wind-induced deck vibration, cable vibration and cable force variation are examined based on the field measurements in the cable-stayed bridge under the two consecutive typhoons.

A Fault-tolerant Scheme for Clustering Routing Protocols (클러스터 기반 라우팅 프로토콜을 위한 결함허용기법)

  • Min, Hong;Kim, Bong-Jae;Jung, Jin-Man;Kim, Seuk-Hyun;Yoon, Jin-Hyuk;Cho, Yoo-Kun;Heo, Jun-Young;Yi, Sang-Ho;Hong, Ji-Man
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.6
    • /
    • pp.668-672
    • /
    • 2010
  • In wireless sensor networks, a fault-tolerant scheme that detects the failure of sensor nodes and improves the reliability of collected information must be considered. Resource-constraint sensor nodes expose vulnerability and cannot use existing checkpointing schemes that do not consider a feature of sensor networks. In this paper, we propose a fault-tolerant scheme for clustering routing protocols that support the recovery of a head node.

A Priority Based Transmission Control Scheme Considering Remaining Energy for Body Sensor Network

  • Encarnacion, Nico;Yang, Hyunho
    • Smart Media Journal
    • /
    • v.4 no.1
    • /
    • pp.25-32
    • /
    • 2015
  • Powering wireless sensors with energy harvested from the environment is coming of age due to the increasing power densities of both storage and harvesting devices and the electronics performing energy efficient energy conversion. In order to maximize the functionality of the wireless sensor network, minimize missing packets, minimize latency and prevent the waste of energy, problems like congestion and inefficient energy usage must be addressed. Many sleep-awake protocols and efficient message priority techniques have been developed to properly manage the energy of the nodes and to minimize congestion. For a WSN that is operating in a strictly energy constrained environment, an energy-efficient transmission strategy is necessary. In this paper, we present a novel transmission priority decision scheme for a heterogeneous body sensor network composed of normal nodes and an energy harvesting node that acts as a cluster head. The energy harvesting node's decision whether or not to clear a normal node for sending is based on a set of metrics which includes the energy harvesting node's remaining energy, the total harvested energy, the type of message in a normal node's queue and finally, the implementation context of the wireless sensor network.

A Study on the Intrusion Detection System's Nodes Scheduling Using Genetic Algorithm in Sensor Networks (센서네트워크에서 유전자 알고리즘을 이용한 침입탐지시스템 노드 스케줄링 연구)

  • Seong, Ki-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.10
    • /
    • pp.2171-2180
    • /
    • 2011
  • Security is a significant concern for many sensor network applications. Intrusion detection is one method of defending against attacks. However, standard intrusion detection techniques are not suitable for sensor networks with limited resources. In this paper, propose a new method for selecting and managing the detect nodes in IDS(intrusion detection system) for anomaly detection in sensor networks and the node scheduling technique for maximizing the IDS's lifetime. Using the genetic algorithm, developed the solutions for suggested optimization equation and verify the effectiveness of proposed methods by simulations.

The Method of Reducing the Delay Latency to Improve the Efficiency of Power Consumption in Wireless Sensor Networks

  • Ho, Jang;Son, Jeong-Bong
    • 한국정보컨버전스학회:학술대회논문집
    • /
    • 2008.06a
    • /
    • pp.199-204
    • /
    • 2008
  • Sensor nodes have various energy and computational constraints because of their inexpensive nature and ad-hoc method of deployment. Considerable research has been focused at overcoming these deficiencies through faster media accessing, more energy efficient routing, localization algorithms and system design. Our research attempts to provide a method of improvement MAC performance in these issues. We show that traditional carrier-sense multiple access(CSMA) protocols like IEEE 802.11 do not handle the first constraint adequately, and do not take advantage of the second property, leading to degraded latency and throughput as the network scales in size, We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is a randomized CSMA protocol, but unlike previous legacy protocols, does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, it carefully decides a fixed-size contention window, non-uniform probability distribution of transmitting in each slot within the window. We show that it can offer up to several times latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely used simulator ns-2. We, finally show that proposed MAC scheme comes close to meeting bounds on the best latency achievable by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to latency.

  • PDF

Packet-Level Scheduling for Implant Communications Using Forward Error Correction in an Erasure Correction Mode for Reliable U-Healthcare Service

  • Lee, Ki-Dong;Kim, Sang-G.;Yi, Byung-K.
    • Journal of Communications and Networks
    • /
    • v.13 no.2
    • /
    • pp.160-166
    • /
    • 2011
  • In u-healthcare services based on wireless body sensor networks, reliable connection is very important as many types of information, including vital signals, are transmitted through the networks. The transmit power requirements are very stringent in the case of in-body networks for implant communication. Furthermore, the wireless link in an in-body environment has a high degree of path loss (e.g., the path loss exponent is around 6.2 for deep tissue). Because of such inherently bad settings of the communication nodes, a multi-hop network topology is preferred in order to meet the transmit power requirements and to increase the battery lifetime of sensor nodes. This will ensure that the live body of a patient receiving the healthcare service has a reduced level of specific absorption ratio (SAR) when exposed to long-lasting radiation. We propose an efficientmethod for delivering delay-intolerant data packets over multiple hops. We consider forward error correction (FEC) in an erasure correction mode and develop a mathematical formulation for packet-level scheduling of delay-intolerant FEC packets over multiple hops. The proposed method can be used as a simple guideline for applications to setting up a topology for a medical body sensor network of each individual patient, which is connected to a remote server for u-healthcare service applications.

Implementation of a Top-down Clustering Protocol for Wireless Sensor Networks (무선 네트워크를 위한 하향식 클러스터링 프로토콜의 구현)

  • Yun, Phil-Jung;Kim, Sang-Kyung;Kim, Chang-Hwa
    • Journal of Information Technology Services
    • /
    • v.9 no.3
    • /
    • pp.95-106
    • /
    • 2010
  • Many researches have been performed to increase energy-efficiency in wireless sensor networks. One of primary research topics is about clustering protocols, which are adopted to configure sensor networks in the form of hierarchical structures by grouping sensor nodes into a cluster. However, legacy clustering protocols do not propose detailed methods from the perspective of implementation to determine a cluster's boundary and configure a cluster, and to communicate among clusters. Moreover, many of them involve assumptions inappropriate to apply those to a sensor field. In this paper, we have designed and implemented a new T-Clustering (Top-down Clustering) protocol, which takes into considerations a node's density, a distance between cluster heads, and remained energy of a node all together. Our proposal is a sink-node oriented top-down clustering protocol, and can form uniform clusters throughout the network. Further, it provides re-clustering functions according to the state of a network. In order to verify our protocol's feasibility, we have implemented and experimented T-Clustering protocol on Crossbow's MICAz nodes which are executed on TinyOS 2.0.2.

Performance and Energy Consumption Analysis of 802.11 with FEC Codes over Wireless Sensor Networks

  • Ahn, Jong-Suk;Yoon, Jong-Hyuk;Lee, Kang-Woo
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.265-273
    • /
    • 2007
  • This paper expands an analytical performance model of 802.11 to accurately estimate throughput and energy demand of 802.11-based wireless sensor network (WSN) when sensor nodes employ Reed-Solomon (RS) codes, one of block forward error correction (FEC) techniques. This model evaluates these two metrics as a function of the channel bit error rate (BER) and the RS symbol size. Since the basic recovery unit of RS codes is a symbol not a bit, the symbol size affects the WSN performance even if each packet carries the same amount of FEC check bits. The larger size is more effective to recover long-lasting error bursts although it increases the computational complexity of encoding and decoding RS codes. For applying the extended model to WSNs, this paper collects traffic traces from a WSN consisting of two TIP50CM sensor nodes and measures its energy consumption for processing RS codes. Based on traces, it approximates WSN channels with Gilbert models. The computational analyses confirm that the adoption of RS codes in 802.11 significantly improves its throughput and energy efficiency of WSNs with a high BER. They also predict that the choice of an appropriate RS symbol size causes a lot of difference in throughput and power waste over short-term durations while the symbol size rarely affects the long-term average of these metrics.

Inter-Process Correlation Model based Hybrid Framework for Fault Diagnosis in Wireless Sensor Networks

  • Zafar, Amna;Akbar, Ali Hammad;Akram, Beenish Ayesha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.536-564
    • /
    • 2019
  • Soft faults are inherent in wireless sensor networks (WSNs) due to external and internal errors. The failure of processes in a protocol stack are caused by errors on various layers. In this work, impact of errors and channel misbehavior on process execution is investigated to provide an error classification mechanism. Considering implementation of WSN protocol stack, inter-process correlations of stacked and peer layer processes are modeled. The proposed model is realized through local and global decision trees for fault diagnosis. A hybrid framework is proposed to implement local decision tree on sensor nodes and global decision tree on diagnostic cluster head. Local decision tree is employed to diagnose critical failures due to errors in stacked processes at node level. Global decision tree, diagnoses critical failures due to errors in peer layer processes at network level. The proposed model has been analyzed using fault tree analysis. The framework implementation has been done in Castalia. Simulation results validate the inter-process correlation model-based fault diagnosis. The hybrid framework distributes processing load on sensor nodes and diagnostic cluster head in a decentralized way, reducing communication overhead.