Radiation detection and situation management by distributed sensor networks

International Nuclear Information System (INIS)

Jan, Frigo; Mielke, Angela; Cai, D. Michael

2009-01-01

Detection of radioactive materials in an urban environment usually requires large, portal-monitor-style radiation detectors. However, this may not be a practical solution in many transport scenarios. Alternatively, a distributed sensor network (DSN) could complement portal-style detection of radiological materials through the implementation of arrays of low cost, small heterogeneous sensors with the ability to detect the presence of radioactive materials in a moving vehicle over a specific region. In this paper, we report on the use of a heterogeneous, wireless, distributed sensor network for traffic monitoring in a field demonstration. Through wireless communications, the energy spectra from different radiation detectors are combined to improve the detection confidence. In addition, the DSN exploits other sensor technologies and algorithms to provide additional information about the vehicle, such as its speed, location, class (e.g. car, truck), and license plate number. The sensors are in-situ and data is processed in real-time at each node. Relevant information from each node is sent to a base station computer which is used to assess the movement of radioactive materials

Distributed Multi-Commodity Network Flow Algorithm for Energy Optimal Routing in Wireless Sensor Networks.

Directory of Open Access Journals (Sweden)

J. Trdlicka

2010-12-01

Full Text Available This work proposes a distributed algorithm for energy optimal routing in a wireless sensor network. The routing problem is described as a mathematical problem by the minimum-cost multi-commodity network flow problem. Due to the separability of the problem, we use the duality theorem to derive the distributed algorithm. The algorithm computes the energy optimal routing in the network without any central node or knowledge of the whole network structure. Each node only needs to know the flow which is supposed to send or receive and the costs and capacities of the neighboring links. An evaluation of the presented algorithm on benchmarks for the energy optimal data flow routing in sensor networks with up to 100 nodes is presented.

Distributed estimation based on observations prediction in wireless sensor networks

KAUST Repository

Bouchoucha, Taha; Ahmed, Mohammed F A; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2015-01-01

We consider wireless sensor networks (WSNs) used for distributed estimation of unknown parameters. Due to the limited bandwidth, sensor nodes quantize their noisy observations before transmission to a fusion center (FC) for the estimation process

Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.

Directory of Open Access Journals (Sweden)

Thirumoorthy Palanisamy

Full Text Available Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.

A Matrix-Based Proactive Data Relay Algorithm for Large Distributed Sensor Networks.

Science.gov (United States)

Xu, Yang; Hu, Xuemei; Hu, Haixiao; Liu, Ming

2016-08-16

In large-scale distributed sensor networks, sensed data is required to be relayed around the network so that one or few sensors can gather adequate relative data to produce high quality information for decision-making. In regards to very high energy-constraint sensor nodes, data transmission should be extremely economical. However, traditional data delivery protocols are potentially inefficient relaying unpredictable sensor readings for data fusion in large distributed networks for either overwhelming query transmissions or unnecessary data coverage. By building sensors' local model from their previously transmitted data in three matrixes, we have developed a novel energy-saving data relay algorithm, which allows sensors to proactively make broadcast decisions by using a neat matrix computation to provide balance between transmission and energy-saving. In addition, we designed a heuristic maintenance algorithm to efficiently update these three matrices. This can easily be deployed to large-scale mobile networks in which decisions of sensors are based on their local matrix models no matter how large the network is, and the local models of these sensors are updated constantly. Compared with some traditional approaches based on our simulations, the efficiency of this approach is manifested in uncertain environment. The results show that our approach is scalable and can effectively balance aggregating data with minimizing energy consumption.

Trade-offs in the distribution of neural networks in a wireless sensor network

NARCIS (Netherlands)

Holenderski, M.J.; Lukkien, J.J.; Tham, C.K.

2005-01-01

This article investigates the tradeoff between communication and memory usage in different methods of distributing neural networks in a Wireless Sensor Network. A structural approach is presented, categorized in two dimensions: horizontal and vertical decomposition. Horizontal decomposition turns

Scalable and Fully Distributed Localization in Large-Scale Sensor Networks

Directory of Open Access Journals (Sweden)

Miao Jin

2017-06-01

Full Text Available This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and a non-uniform nodal distribution. In contrast to current state-of-the-art connectivity-based localization methods, the proposed algorithm is highly scalable with linear computation and communication costs with respect to the size of the network; and fully distributed where each node only needs the information of its neighbors without cumbersome partitioning and merging process. The algorithm is theoretically guaranteed and numerically stable. Moreover, the algorithm can be readily extended to the localization of networks with a one-hop transmission range distance measurement, and the propagation of the measurement error at one sensor node is limited within a small area of the network around the node. Extensive simulations and comparison with other methods under various representative network settings are carried out, showing the superior performance of the proposed algorithm.

A Matrix-Based Proactive Data Relay Algorithm for Large Distributed Sensor Networks

Directory of Open Access Journals (Sweden)

Yang Xu

2016-08-01

Full Text Available In large-scale distributed sensor networks, sensed data is required to be relayed around the network so that one or few sensors can gather adequate relative data to produce high quality information for decision-making. In regards to very high energy-constraint sensor nodes, data transmission should be extremely economical. However, traditional data delivery protocols are potentially inefficient relaying unpredictable sensor readings for data fusion in large distributed networks for either overwhelming query transmissions or unnecessary data coverage. By building sensors’ local model from their previously transmitted data in three matrixes, we have developed a novel energy-saving data relay algorithm, which allows sensors to proactively make broadcast decisions by using a neat matrix computation to provide balance between transmission and energy-saving. In addition, we designed a heuristic maintenance algorithm to efficiently update these three matrices. This can easily be deployed to large-scale mobile networks in which decisions of sensors are based on their local matrix models no matter how large the network is, and the local models of these sensors are updated constantly. Compared with some traditional approaches based on our simulations, the efficiency of this approach is manifested in uncertain environment. The results show that our approach is scalable and can effectively balance aggregating data with minimizing energy consumption.

Cross-coherent vector sensor processing for spatially distributed glider networks.

Science.gov (United States)

Nichols, Brendan; Sabra, Karim G

2015-09-01

Autonomous underwater gliders fitted with vector sensors can be used as a spatially distributed sensor array to passively locate underwater sources. However, to date, the positional accuracy required for robust array processing (especially coherent processing) is not achievable using dead-reckoning while the gliders remain submerged. To obtain such accuracy, the gliders can be temporarily surfaced to allow for global positioning system contact, but the acoustically active sea surface introduces locally additional sensor noise. This letter demonstrates that cross-coherent array processing, which inherently mitigates the effects of local noise, outperforms traditional incoherent processing source localization methods for this spatially distributed vector sensor network.

Distributed Input and State Estimation Using Local Information in Heterogeneous Sensor Networks

Directory of Open Access Journals (Sweden)

Dzung Tran

2017-07-01

Full Text Available A new distributed input and state estimation architecture is introduced and analyzed for heterogeneous sensor networks. Specifically, nodes of a given sensor network are allowed to have heterogeneous information roles in the sense that a subset of nodes can be active (that is, subject to observations of a process of interest and the rest can be passive (that is, subject to no observation. Both fixed and varying active and passive roles of sensor nodes in the network are investigated. In addition, these nodes are allowed to have non-identical sensor modalities under the common underlying assumption that they have complimentary properties distributed over the sensor network to achieve collective observability. The key feature of our framework is that it utilizes local information not only during the execution of the proposed distributed input and state estimation architecture but also in its design in that global uniform ultimate boundedness of error dynamics is guaranteed once each node satisfies given local stability conditions independent from the graph topology and neighboring information of these nodes. As a special case (e.g., when all nodes are active and a positive real condition is satisfied, the asymptotic stability can be achieved with our algorithm. Several illustrative numerical examples are further provided to demonstrate the efficacy of the proposed architecture.

Distributed sensor and actuator reconfiguration for fault-tolerant networked control systems

NARCIS (Netherlands)

Herdeiro Teixeira, A.M.; Araujo, Jose; Sandberg, Henrik; Johansson, Karl H.

2017-01-01

In this paper, we address the problem of distributed reconfiguration of networked control systems upon the removal of misbehaving sensors and actuators. In particular, we consider systems with redundant sensors and actuators cooperating to recover from faults. Reconfiguration is performed while

A Distributed Routing Scheme for Energy Management in Solar Powered Sensor Networks

KAUST Repository

Dehwah, Ahmad H.

2017-10-11

Energy management is critical for solar-powered sensor networks. In this article, we consider data routing policies to optimize the energy in solar powered networks. Motivated by multipurpose sensor networks, the objective is to find the best network policy that maximizes the minimal energy among nodes in a sensor network, over a finite time horizon, given uncertain energy input forecasts. First, we derive the optimal policy in certain special cases using forward dynamic programming. We then introduce a greedy policy that is distributed and exhibits significantly lower complexity. When computationally feasible, we compare the performance of the optimal policy with the greedy policy. We also demonstrate the performance and computational complexity of the greedy policy over randomly simulated networks, and show that it yields results that are almost identical to the optimal policy, for greatly reduced worst-case computational costs and memory requirements. Finally, we demonstrate the implementation of the greedy policy on an experimental sensor network.

Distributed estimation based on observations prediction in wireless sensor networks

KAUST Repository

Bouchoucha, Taha

2015-03-19

We consider wireless sensor networks (WSNs) used for distributed estimation of unknown parameters. Due to the limited bandwidth, sensor nodes quantize their noisy observations before transmission to a fusion center (FC) for the estimation process. In this letter, the correlation between observations is exploited to reduce the mean-square error (MSE) of the distributed estimation. Specifically, sensor nodes generate local predictions of their observations and then transmit the quantized prediction errors (innovations) to the FC rather than the quantized observations. The analytic and numerical results show that transmitting the innovations rather than the observations mitigates the effect of quantization noise and hence reduces the MSE. © 2015 IEEE.

Distributed Similarity based Clustering and Compressed Forwarding for wireless sensor networks.

Science.gov (United States)

Arunraja, Muruganantham; Malathi, Veluchamy; Sakthivel, Erulappan

2015-11-01

Wireless sensor networks are engaged in various data gathering applications. The major bottleneck in wireless data gathering systems is the finite energy of sensor nodes. By conserving the on board energy, the life span of wireless sensor network can be well extended. Data communication being the dominant energy consuming activity of wireless sensor network, data reduction can serve better in conserving the nodal energy. Spatial and temporal correlation among the sensor data is exploited to reduce the data communications. Data similar cluster formation is an effective way to exploit spatial correlation among the neighboring sensors. By sending only a subset of data and estimate the rest using this subset is the contemporary way of exploiting temporal correlation. In Distributed Similarity based Clustering and Compressed Forwarding for wireless sensor networks, we construct data similar iso-clusters with minimal communication overhead. The intra-cluster communication is reduced using adaptive-normalized least mean squares based dual prediction framework. The cluster head reduces the inter-cluster data payload using a lossless compressive forwarding technique. The proposed work achieves significant data reduction in both the intra-cluster and the inter-cluster communications, with the optimal data accuracy of collected data. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Optimum Layout for Sensors in Water Distribution Networks through Ant Colony Algorithm: A Dual Use Vision

Directory of Open Access Journals (Sweden)

Seyed Mehdi Miri

2014-07-01

Full Text Available The accidental or intentional entry of contaminants or self-deterioration of the water quality within the network itself can severely harm public health. Efficient water quality monitoring is one of the most important tools to guarantee a reliable potable water supply to consumers of drinking water distribution systems. Considering the high purchase, installation and maintenance cost of sensors in water distribution networks deploying two independent sensor networks within one distribution system is not only bounded by physical constraints but also is not a cost-effective approach. Therefore, need for combining different objectives and designing sensor network to simultaneity satisfying these objectives is felt. Sensors should comply with dual use benefits. Sensor locations and types should be integrated not only for achieving water security goals but also for accomplishing other water utility objectives, such as satisfying regulatory monitoring requirements or collecting information to solve water quality problems. In this study, a dual use vision for the sensor layout problem in the municipal water networks, is formulated and solved with the ant colony algorithm.

Energy Efficient Distributed Fault Identification Algorithm in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Meenakshi Panda

2014-01-01

Full Text Available A distributed fault identification algorithm is proposed here to find both hard and soft faulty sensor nodes present in wireless sensor networks. The algorithm is distributed, self-detectable, and can detect the most common byzantine faults such as stuck at zero, stuck at one, and random data. In the proposed approach, each sensor node gathered the observed data from the neighbors and computed the mean to check whether faulty sensor node is present or not. If a node found the presence of faulty sensor node, then compares observed data with the data of the neighbors and predict probable fault status. The final fault status is determined by diffusing the fault information from the neighbors. The accuracy and completeness of the algorithm are verified with the help of statistical model of the sensors data. The performance is evaluated in terms of detection accuracy, false alarm rate, detection latency and message complexity.

Distributed Database Semantic Integration of Wireless Sensor Network to Access the Environmental Monitoring System

Directory of Open Access Journals (Sweden)

Ubaidillah Umar

2018-06-01

Full Text Available A wireless sensor network (WSN works continuously to gather information from sensors that generate large volumes of data to be handled and processed by applications. Current efforts in sensor networks focus more on networking and development services for a variety of applications and less on processing and integrating data from heterogeneous sensors. There is an increased need for information to become shareable across different sensors, database platforms, and applications that are not easily implemented in traditional database systems. To solve the issue of these large amounts of data from different servers and database platforms (including sensor data, a semantic sensor web service platform is needed to enable a machine to extract meaningful information from the sensor’s raw data. This additionally helps to minimize and simplify data processing and to deduce new information from existing data. This paper implements a semantic web data platform (SWDP to manage the distribution of data sensors based on the semantic database system. SWDP uses sensors for temperature, humidity, carbon monoxide, carbon dioxide, luminosity, and noise. The system uses the Sesame semantic web database for data processing and a WSN to distribute, minimize, and simplify information processing. The sensor nodes are distributed in different places to collect sensor data. The SWDP generates context information in the form of a resource description framework. The experiment results demonstrate that the SWDP is more efficient than the traditional database system in terms of memory usage and processing time.

Multiple Distributed Smart Microgrids with a Self-Autonomous, Energy Harvesting Wireless Sensor Network

DEFF Research Database (Denmark)

Guerrero, Josep M.; Kheng Tan, Yen

2012-01-01

The chapter covers the smart wireless sensors for microgrids, as well as the energy harvesting technology used to sustain the operations of these sensors. Last, a case study on the multiple distributed smart microgrids with a self-autonomous, energy harvesting wireless sensor network is presented....

Distributed clone detection in static wireless sensor networks: random walk with network division.

Science.gov (United States)

Khan, Wazir Zada; Aalsalem, Mohammed Y; Saad, N M

2015-01-01

Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads.

Distributed clone detection in static wireless sensor networks: random walk with network division.

Directory of Open Access Journals (Sweden)

Wazir Zada Khan

Full Text Available Wireless Sensor Networks (WSNs are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads.

LIDeA: A Distributed Lightweight Intrusion Detection Architecture for Sensor Networks

DEFF Research Database (Denmark)

Giannetsos, Athanasios; Krontiris, Ioannis; Dimitriou, Tassos

2008-01-01

to achieve a more autonomic and complete defense mechanism, even against attacks that have not been anticipated in advance. In this paper, we present a lightweight intrusion detection system, called LIDeA, designed for wireless sensor networks. LIDeA is based on a distributed architecture, in which nodes......Wireless sensor networks are vulnerable to adversaries as they are frequently deployed in open and unattended environments. Preventive mechanisms can be applied to protect them from an assortment of attacks. However, more sophisticated methods, like intrusion detection systems, are needed...

Prioritized Degree Distribution in Wireless Sensor Networks with a Network Coded Data Collection Method

Science.gov (United States)

Wan, Jan; Xiong, Naixue; Zhang, Wei; Zhang, Qinchao; Wan, Zheng

2012-01-01

The reliability of wireless sensor networks (WSNs) can be greatly affected by failures of sensor nodes due to energy exhaustion or the influence of brutal external environment conditions. Such failures seriously affect the data persistence and collection efficiency. Strategies based on network coding technology for WSNs such as LTCDS can improve the data persistence without mass redundancy. However, due to the bad intermediate performance of LTCDS, a serious ‘cliff effect’ may appear during the decoding period, and source data are hard to recover from sink nodes before sufficient encoded packets are collected. In this paper, the influence of coding degree distribution strategy on the ‘cliff effect’ is observed and the prioritized data storage and dissemination algorithm PLTD-ALPHA is presented to achieve better data persistence and recovering performance. With PLTD-ALPHA, the data in sensor network nodes present a trend that their degree distribution increases along with the degree level predefined, and the persistent data packets can be submitted to the sink node according to its degree in order. Finally, the performance of PLTD-ALPHA is evaluated and experiment results show that PLTD-ALPHA can greatly improve the data collection performance and decoding efficiency, while data persistence is not notably affected. PMID:23235451

Prioritized degree distribution in wireless sensor networks with a network coded data collection method.

Science.gov (United States)

Wan, Jan; Xiong, Naixue; Zhang, Wei; Zhang, Qinchao; Wan, Zheng

2012-12-12

The reliability of wireless sensor networks (WSNs) can be greatly affected by failures of sensor nodes due to energy exhaustion or the influence of brutal external environment conditions. Such failures seriously affect the data persistence and collection efficiency. Strategies based on network coding technology for WSNs such as LTCDS can improve the data persistence without mass redundancy. However, due to the bad intermediate performance of LTCDS, a serious 'cliff effect' may appear during the decoding period, and source data are hard to recover from sink nodes before sufficient encoded packets are collected. In this paper, the influence of coding degree distribution strategy on the 'cliff effect' is observed and the prioritized data storage and dissemination algorithm PLTD-ALPHA is presented to achieve better data persistence and recovering performance. With PLTD-ALPHA, the data in sensor network nodes present a trend that their degree distribution increases along with the degree level predefined, and the persistent data packets can be submitted to the sink node according to its degree in order. Finally, the performance of PLTD-ALPHA is evaluated and experiment results show that PLTD-ALPHA can greatly improve the data collection performance and decoding efficiency, while data persistence is not notably affected.

Low-Power RF SOI-CMOS Technology for Distributed Sensor Networks

Science.gov (United States)

Dogan, Numan S.

2003-01-01

The objective of this work is to design and develop Low-Power RF SOI-CMOS Technology for Distributed Sensor Networks. We briefly report on the accomplishments in this work. We also list the impact of this work on graduate student research training/involvement.

Mutual trust method for forwarding information in wireless sensor networks using random secret pre-distribution

Directory of Open Access Journals (Sweden)

Chih-Hsueh Lin

2016-04-01

Full Text Available In wireless sensor networks, sensing information must be transmitted from sensor nodes to the base station by multiple hopping. Every sensor node is a sender and a relay node that forwards the sensing information that is sent by other nodes. Under an attack, the sensing information may be intercepted, modified, interrupted, or fabricated during transmission. Accordingly, the development of mutual trust to enable a secure path to be established for forwarding information is an important issue. Random key pre-distribution has been proposed to establish mutual trust among sensor nodes. This article modifies the random key pre-distribution to a random secret pre-distribution and incorporates identity-based cryptography to establish an effective method of establishing mutual trust for a wireless sensor network. In the proposed method, base station assigns an identity and embeds n secrets into the private secret keys for every sensor node. Based on the identity and private secret keys, the mutual trust method is utilized to explore the types of trust among neighboring sensor nodes. The novel method can resist malicious attacks and satisfy the requirements of wireless sensor network, which are resistance to compromising attacks, masquerading attacks, forger attacks, replying attacks, authentication of forwarding messages, and security of sensing information.

Distributed Service Discovery for Heterogeneous Wireless Sensor Networks

NARCIS (Netherlands)

Marin Perianu, Raluca; Scholten, Johan; Havinga, Paul J.M.

Service discovery in heterogeneous Wireless Sensor Networks is a challenging research objective, due to the inherent limitations of sensor nodes and their extensive and dense deployment. The protocols proposed for ad hoc networks are too heavy for sensor environments. This paper presents a

Energy efficient distributed cluster head scheduling scheme for two tiered wireless sensor network

Directory of Open Access Journals (Sweden)

G. Kannan

2015-07-01

Full Text Available Wireless Sensor Network (WSN provides a significant contribution in the emerging fields such as ambient intelligence and ubiquitous computing. In WSN, optimization and load balancing of network resources are critical concern to provide the intelligence for long duration. Since clustering the sensor nodes can significantly enhance overall system scalability and energy efficiency this paper presents a distributed cluster head scheduling (DCHS algorithm to achieve the network longevity in WSN. The major novelty of this work is that the network is divided into primary and secondary tiers based on received signal strength indication of sensor nodes from the base station. The proposed DCHS supports for two tier WSN architecture and gives suggestion to elect the cluster head nodes and gateway nodes for both primary and secondary tiers. The DCHS mechanism satisfies an ideal distribution of the cluster head among the sensor nodes and avoids frequent selection of cluster head, based on Received Signal Strength Indication (RSSI and residual energy level of the sensor nodes. Since the RSSI is the key parameter for this paper, the practical experiment was conducted to measure RSSI value by using MSP430F149 processor and CC2500 transceiver. The measured RSSI values were given input to the event based simulator to test the DCHS mechanism. The real time experimental study validated the proposed scheme for various scenarios.

Fuzzy-Logic Based Distributed Energy-Efficient Clustering Algorithm for Wireless Sensor Networks.

Science.gov (United States)

Zhang, Ying; Wang, Jun; Han, Dezhi; Wu, Huafeng; Zhou, Rundong

2017-07-03

Due to the high-energy efficiency and scalability, the clustering routing algorithm has been widely used in wireless sensor networks (WSNs). In order to gather information more efficiently, each sensor node transmits data to its Cluster Head (CH) to which it belongs, by multi-hop communication. However, the multi-hop communication in the cluster brings the problem of excessive energy consumption of the relay nodes which are closer to the CH. These nodes' energy will be consumed more quickly than the farther nodes, which brings the negative influence on load balance for the whole networks. Therefore, we propose an energy-efficient distributed clustering algorithm based on fuzzy approach with non-uniform distribution (EEDCF). During CHs' election, we take nodes' energies, nodes' degree and neighbor nodes' residual energies into consideration as the input parameters. In addition, we take advantage of Takagi, Sugeno and Kang (TSK) fuzzy model instead of traditional method as our inference system to guarantee the quantitative analysis more reasonable. In our scheme, each sensor node calculates the probability of being as CH with the help of fuzzy inference system in a distributed way. The experimental results indicate EEDCF algorithm is better than some current representative methods in aspects of data transmission, energy consumption and lifetime of networks.

Moving target tracking through distributed clustering in directional sensor networks.

Science.gov (United States)

Enayet, Asma; Razzaque, Md Abdur; Hassan, Mohammad Mehedi; Almogren, Ahmad; Alamri, Atif

2014-12-18

The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works.

Moving Target Tracking through Distributed Clustering in Directional Sensor Networks

Directory of Open Access Journals (Sweden)

Asma Enayet

2014-12-01

Full Text Available The problem of moving target tracking in directional sensor networks (DSNs introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target’s location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works.

Asynchronous Group Key Distribution on top of the CC2420 Security Mechanisms for Sensor Networks

DEFF Research Database (Denmark)

Hansen, Morten Tranberg

2009-01-01

scheme with no time synchronization requirements. The scheme decreases the number of key updates by providing them on an as needed basis according to the amount of network traffic. We evaluate the CC2420 radio security mechanism and show how to use it as a basis to implement secure group communication......A sensor network is a network consisting of small, inexpensive, low-powered sensor nodes that communicate to complete a common task. Sensor nodes are characterized by having limited communication and computation capabilities, energy, and storage. They often are deployed in hostile environments...... creating a demand for encryption and authentication of the messages sent between them. Due to severe resource constraints on the sensor nodes, efficient key distribution schemes and secure communication protocols with low overhead are desired. In this paper we present an asynchronous group key distribution...

Periodic leg movement (PLM) monitoring using a distributed body sensor network.

Science.gov (United States)

Madhushri, Priyanka; Ahmed, Beena; Penzel, Thomas; Jovanov, Emil

2015-01-01

Wireless sensors networks represent the architecture of choice for distributed monitoring due to the ease of deployment and configuration. We developed a distributed sleep monitoring system which combines wireless inertial sensors SP-10C by Sensoplex controlled by a custom smartphone application as an extension of the polysomnographic (PSG) monitor SOMNOscreen plus from Somnomedics. While existing activity monitors are wired to the SOMNOscreen, our system allows the use of wireless inertial sensors to improve user's comfort during sleep. The system is intended for monitoring of periodic leg movements (PLM) and user's activity during sleep. Wireless sensors are placed on ankle and toes of the foot in a customized sock. An Android app communicates with wireless sensors over Bluetooth Smart (BTS) link and streams 3D accelerometer values, 4D unit quaternion values and timestamps. In this paper we present a novel method of synchronization of data streams from PSG and inertial sensors, and original method of detection of PLM events. The system was tested using five experiments of simulated PLM, and achieved 96.51% of PLM detection accuracy.

Distributed push-pull estimation for node localization in wireless sensor networks

NARCIS (Netherlands)

Dang, Viet-Hung; Le Viet Duc, L Duc; Lee, Young-Koo; Lee, Sungyoung

A great deal of research achievements on localization in wireless sensor networks (WSNs) has been obtained in recent years. Nevertheless, its interesting challenges in terms of cost-reduction, accuracy improvement, scalability, and distributed ability design have led to the development of a new

Fibre optical measuring network based on quasi-distributed amplitude sensors for detecting deformation loads

International Nuclear Information System (INIS)

Kul'chin, Yurii N; Kolchinskiy, V A; Kamenev, O T; Petrov, Yu S

2013-01-01

A new design of a sensitive element for a fibre optical sensor of deformation loads is proposed. A distributed fibre optical measuring network, aimed at determining both the load application point and the load mass, has been developed based on these elements. It is shown that neural network methods of data processing make it possible to combine quasi-distributed amplitude sensors of different types into a unified network. The results of the experimental study of a breadboard of a fibre optical measuring network are reported, which demonstrate successful reconstruction of the trajectory of a moving object (load) with a spatial resolution of 8 cm, as well as the load mass in the range of 1 – 10 kg with a sensitivity of 0.043 kg -1 . (laser optics 2012)

Efficient Gatherings in Wireless Sensor Networks Using Distributed Computation of Connected Dominating Sets

Directory of Open Access Journals (Sweden)

Vincent BOUDET

2012-03-01

Full Text Available In this paper, we are interested in enhancing lifetime of wireless sensor networks trying to collect data from all the nodes to a “sink”-node for non-safety critical applications. Connected Dominating Sets are used as a basis for routing messages to the sink. We present a simple distributed algorithm, which computes several CDS trying to distribute the consumption of energy over all the nodes of the network. The simulations show a significant improvement of the network lifetime.

Radar-to-Radar Interference Suppression for Distributed Radar Sensor Networks

Directory of Open Access Journals (Sweden)

Wen-Qin Wang

2014-01-01

Full Text Available Radar sensor networks, including bi- and multi-static radars, provide several operational advantages, like reduced vulnerability, good system flexibility and an increased radar cross-section. However, radar-to-radar interference suppression is a major problem in distributed radar sensor networks. In this paper, we present a cross-matched filtering-based radar-to-radar interference suppression algorithm. This algorithm first uses an iterative filtering algorithm to suppress the radar-to-radar interferences and, then, separately matched filtering for each radar. Besides the detailed algorithm derivation, extensive numerical simulation examples are performed with the down-chirp and up-chirp waveforms, partially overlapped or inverse chirp rate linearly frequency modulation (LFM waveforms and orthogonal frequency division multiplexing (ODFM chirp diverse waveforms. The effectiveness of the algorithm is verified by the simulation results.

Distortion-Rate Bounds for Distributed Estimation Using Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Nihar Jindal

2008-03-01

Full Text Available We deal with centralized and distributed rate-constrained estimation of random signal vectors performed using a network of wireless sensors (encoders communicating with a fusion center (decoder. For this context, we determine lower and upper bounds on the corresponding distortion-rate (D-R function. The nonachievable lower bound is obtained by considering centralized estimation with a single-sensor which has all observation data available, and by determining the associated D-R function in closed-form. Interestingly, this D-R function can be achieved using an estimate first compress afterwards (EC approach, where the sensor (i forms the minimum mean-square error (MMSE estimate for the signal of interest; and (ii optimally (in the MSE sense compresses and transmits it to the FC that reconstructs it. We further derive a novel alternating scheme to numerically determine an achievable upper bound of the D-R function for general distributed estimation using multiple sensors. The proposed algorithm tackles an analytically intractable minimization problem, while it accounts for sensor data correlations. The obtained upper bound is tighter than the one determined by having each sensor performing MSE optimal encoding independently of the others. Numerical examples indicate that the algorithm performs well and yields D-R upper bounds which are relatively tight with respect to analytical alternatives obtained without taking into account the cross-correlations among sensor data.

Multi-channel distributed coordinated function over single radio in wireless sensor networks.

Science.gov (United States)

Campbell, Carlene E-A; Loo, Kok-Keong Jonathan; Gemikonakli, Orhan; Khan, Shafiullah; Singh, Dhananjay

2011-01-01

Multi-channel assignments are becoming the solution of choice to improve performance in single radio for wireless networks. Multi-channel allows wireless networks to assign different channels to different nodes in real-time transmission. In this paper, we propose a new approach, Multi-channel Distributed Coordinated Function (MC-DCF) which takes advantage of multi-channel assignment. The backoff algorithm of the IEEE 802.11 distributed coordination function (DCF) was modified to invoke channel switching, based on threshold criteria in order to improve the overall throughput for wireless sensor networks (WSNs) over 802.11 networks. We presented simulation experiments in order to investigate the characteristics of multi-channel communication in wireless sensor networks using an NS2 platform. Nodes only use a single radio and perform channel switching only after specified threshold is reached. Single radio can only work on one channel at any given time. All nodes initiate constant bit rate streams towards the receiving nodes. In this work, we studied the impact of non-overlapping channels in the 2.4 frequency band on: constant bit rate (CBR) streams, node density, source nodes sending data directly to sink and signal strength by varying distances between the sensor nodes and operating frequencies of the radios with different data rates. We showed that multi-channel enhancement using our proposed algorithm provides significant improvement in terms of throughput, packet delivery ratio and delay. This technique can be considered for WSNs future use in 802.11 networks especially when the IEEE 802.11n becomes popular thereby may prevent the 802.15.4 network from operating effectively in the 2.4 GHz frequency band.

On the feasibility of measuring urban air pollution by wireless distributed sensor networks.

Science.gov (United States)

Moltchanov, Sharon; Levy, Ilan; Etzion, Yael; Lerner, Uri; Broday, David M; Fishbain, Barak

2015-01-01

Accurate evaluation of air pollution on human-wellbeing requires high-resolution measurements. Standard air quality monitoring stations provide accurate pollution levels but due to their sparse distribution they cannot capture the highly resolved spatial variations within cities. Similarly, dedicated field campaigns can use tens of measurement devices and obtain highly dense spatial coverage but normally deployment has been limited to short periods of no more than few weeks. Nowadays, advances in communication and sensory technologies enable the deployment of dense grids of wireless distributed air monitoring nodes, yet their sensor ability to capture the spatiotemporal pollutant variability at the sub-neighborhood scale has never been thoroughly tested. This study reports ambient measurements of gaseous air pollutants by a network of six wireless multi-sensor miniature nodes that have been deployed in three urban sites, about 150 m apart. We demonstrate the network's capability to capture spatiotemporal concentration variations at an exceptional fine resolution but highlight the need for a frequent in-situ calibration to maintain the consistency of some sensors. Accordingly, a procedure for a field calibration is proposed and shown to improve the system's performance. Overall, our results support the compatibility of wireless distributed sensor networks for measuring urban air pollution at a sub-neighborhood spatial resolution, which suits the requirement for highly spatiotemporal resolved measurements at the breathing-height when assessing exposure to urban air pollution. Copyright © 2014 Elsevier B.V. All rights reserved.

Scalable infrastructure for distributed sensor networks

National Research Council Canada - National Science Library

Chakrabarty, Krishnendu; Iyengar, S. S

2005-01-01

... network application is inventory tracking in factory warehouses. A single sensor node can be attached to each item in the warehouse. These sensor nodes can then be used for tracking the location of the items as they are moved within the warehouse. They can also provide information on the location of nearby items as well as the history of movement...

An Ensemble of HMMs for Cognitive Fault Detection in Distributed Sensor Networks

OpenAIRE

Roveri , Manuel; Trovò , Francesco

2014-01-01

Part 3: Social Media and Mobile Applications of AI; International audience; Distributed sensor networks working in harsh environmental conditions can suffer from permanent or transient faults affecting the embedded electronics or the sensors. Fault Diagnosis Systems (FDSs) have been widely studied in the literature to detect, isolate, identify, and possibly accommodate faults. Recently introduced cognitive FDSs, which represent a novel generation of FDSs, are characterized by the capability t...

A Multiobjective Fuzzy Inference System based Deployment Strategy for a Distributed Mobile Sensor Network

Directory of Open Access Journals (Sweden)

Amol P. Bhondekar

2010-03-01

Full Text Available Sensor deployment scheme highly governs the effectiveness of distributed wireless sensor network. Issues such as energy conservation and clustering make the deployment problem much more complex. A multiobjective Fuzzy Inference System based strategy for mobile sensor deployment is presented in this paper. This strategy gives a synergistic combination of energy capacity, clustering and peer-to-peer deployment. Performance of our strategy is evaluated in terms of coverage, uniformity, speed and clustering. Our algorithm is compared against a modified distributed self-spreading algorithm to exhibit better performance.

Wireless Integrated Network Sensors Next Generation

National Research Council Canada - National Science Library

Merrill, William

2004-01-01

..., autonomous networking, and distributed operations for wireless networked sensor systems. Multiple types of sensor systems were developed and provided including capabilities for acoustic, seismic, passive infrared detection, and visual imaging...

Distributed Algorithm for Voronoi Partition of Wireless Sensor Networks with a Limited Sensing Range.

Science.gov (United States)

He, Chenlong; Feng, Zuren; Ren, Zhigang

2018-02-03

For Wireless Sensor Networks (WSNs), the Voronoi partition of a region is a challenging problem owing to the limited sensing ability of each sensor and the distributed organization of the network. In this paper, an algorithm is proposed for each sensor having a limited sensing range to compute its limited Voronoi cell autonomously, so that the limited Voronoi partition of the entire WSN is generated in a distributed manner. Inspired by Graham's Scan (GS) algorithm used to compute the convex hull of a point set, the limited Voronoi cell of each sensor is obtained by sequentially scanning two consecutive bisectors between the sensor and its neighbors. The proposed algorithm called the Boundary Scan (BS) algorithm has a lower computational complexity than the existing Range-Constrained Voronoi Cell (RCVC) algorithm and reaches the lower bound of the computational complexity of the algorithms used to solve the problem of this kind. Moreover, it also improves the time efficiency of a key step in the Adjust-Sensing-Radius (ASR) algorithm used to compute the exact Voronoi cell. Extensive numerical simulations are performed to demonstrate the correctness and effectiveness of the BS algorithm. The distributed realization of the BS combined with a localization algorithm in WSNs is used to justify the WSN nature of the proposed algorithm.

Distributed control for energy-efficient and fast consensus in wireless sensor networks

Science.gov (United States)

Manfredi, Sabato; Tucci, Edmondo Di

2017-05-01

The paper proposes a distributed control of nodes transmission radii in energy-harvesting wireless sensor networks for simultaneously coping with energy consumption and consensus responsiveness requirement. The stability of the closed-loop network under the proposed control law is proved. Simulation validations show the effectiveness of the proposed approach in nominal scenario as well as in the presence of uncertain node power requirements and harvesting system supply.

Parallel multi-join query optimization algorithm for distributed sensor network in the internet of things

Science.gov (United States)

Zheng, Yan

2015-03-01

Internet of things (IoT), focusing on providing users with information exchange and intelligent control, attracts a lot of attention of researchers from all over the world since the beginning of this century. IoT is consisted of large scale of sensor nodes and data processing units, and the most important features of IoT can be illustrated as energy confinement, efficient communication and high redundancy. With the sensor nodes increment, the communication efficiency and the available communication band width become bottle necks. Many research work is based on the instance which the number of joins is less. However, it is not proper to the increasing multi-join query in whole internet of things. To improve the communication efficiency between parallel units in the distributed sensor network, this paper proposed parallel query optimization algorithm based on distribution attributes cost graph. The storage information relations and the network communication cost are considered in this algorithm, and an optimized information changing rule is established. The experimental result shows that the algorithm has good performance, and it would effectively use the resource of each node in the distributed sensor network. Therefore, executive efficiency of multi-join query between different nodes could be improved.

Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks

Science.gov (United States)

Yu, Chao

2013-01-01

In this thesis, we consider estimation, coding, and sensor scheduling for energy efficient operation of wireless visual sensor networks (VSN), which consist of battery-powered wireless sensors with sensing (imaging), computation, and communication capabilities. The competing requirements for applications of these wireless sensor networks (WSN)…

Distributed Remote Vector Gaussian Source Coding for Wireless Acoustic Sensor Networks

DEFF Research Database (Denmark)

Zahedi, Adel; Østergaard, Jan; Jensen, Søren Holdt

2014-01-01

In this paper, we consider the problem of remote vector Gaussian source coding for a wireless acoustic sensor network. Each node receives messages from multiple nodes in the network and decodes these messages using its own measurement of the sound field as side information. The node’s measurement...... and the estimates of the source resulting from decoding the received messages are then jointly encoded and transmitted to a neighboring node in the network. We show that for this distributed source coding scenario, one can encode a so-called conditional sufficient statistic of the sources instead of jointly...

Optimal sensor placement for leakage detection and isolation in water distribution networks

OpenAIRE

Rosich Oliva, Albert; Sarrate Estruch, Ramon; Nejjari Akhi-Elarab, Fatiha

2012-01-01

In this paper, the problem of leakage detection and isolation in water distribution networks is addressed applying an optimal sensor placement methodology. The chosen technique is based on structural models and thus it is suitable to handle non-linear and large scale systems. A drawback of this technique arises when costs are assigned uniformly. A main contribution of this paper is the proposal of an iterative methodology that focuses on identifying essential sensors which ultimately leads to...

Multilevel Modeling of Distributed Denial of Service Attacks in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Katarzyna Mazur

2016-01-01

Full Text Available The growing popularity of wireless sensor networks increases the risk of security attacks. One of the most common and dangerous types of attack that takes place these days in any electronic society is a distributed denial of service attack. Due to the resource constraint nature of mobile sensors, DDoS attacks have become a major threat to its stability. In this paper, we established a model of a structural health monitoring network, being disturbed by one of the most common types of DDoS attacks, the flooding attack. Through a set of simulations, we explore the scope of flood-based DDoS attack problem, assessing the performance and the lifetime of the network under the attack condition. To conduct our research, we utilized the Quality of Protection Modeling Language. With the proposed approach, it was possible to examine numerous network configurations, parameters, attack options, and scenarios. The results of the carefully performed multilevel analysis allowed us to identify a new kind of DDoS attack, the delayed distributed denial of service, by the authors, referred to as DDDoS attack. Multilevel approach to DDoS attack analysis confirmed that, examining endangered environments, it is significant to take into account many characteristics at once, just to not overlook any important aspect.

A Comparison of Alternative Distributed Dynamic Cluster Formation Techniques for Industrial Wireless Sensor Networks.

Science.gov (United States)

Gholami, Mohammad; Brennan, Robert W

2016-01-06

In this paper, we investigate alternative distributed clustering techniques for wireless sensor node tracking in an industrial environment. The research builds on extant work on wireless sensor node clustering by reporting on: (1) the development of a novel distributed management approach for tracking mobile nodes in an industrial wireless sensor network; and (2) an objective comparison of alternative cluster management approaches for wireless sensor networks. To perform this comparison, we focus on two main clustering approaches proposed in the literature: pre-defined clusters and ad hoc clusters. These approaches are compared in the context of their reconfigurability: more specifically, we investigate the trade-off between the cost and the effectiveness of competing strategies aimed at adapting to changes in the sensing environment. To support this work, we introduce three new metrics: a cost/efficiency measure, a performance measure, and a resource consumption measure. The results of our experiments show that ad hoc clusters adapt more readily to changes in the sensing environment, but this higher level of adaptability is at the cost of overall efficiency.

Energy optimization in mobile sensor networks

Science.gov (United States)

Yu, Shengwei

Mobile sensor networks are considered to consist of a network of mobile robots, each of which has computation, communication and sensing capabilities. Energy efficiency is a critical issue in mobile sensor networks, especially when mobility (i.e., locomotion control), routing (i.e., communications) and sensing are unique characteristics of mobile robots for energy optimization. This thesis focuses on the problem of energy optimization of mobile robotic sensor networks, and the research results can be extended to energy optimization of a network of mobile robots that monitors the environment, or a team of mobile robots that transports materials from stations to stations in a manufacturing environment. On the energy optimization of mobile robotic sensor networks, our research focuses on the investigation and development of distributed optimization algorithms to exploit the mobility of robotic sensor nodes for network lifetime maximization. In particular, the thesis studies these five problems: 1. Network-lifetime maximization by controlling positions of networked mobile sensor robots based on local information with distributed optimization algorithms; 2. Lifetime maximization of mobile sensor networks with energy harvesting modules; 3. Lifetime maximization using joint design of mobility and routing; 4. Optimal control for network energy minimization; 5. Network lifetime maximization in mobile visual sensor networks. In addressing the first problem, we consider only the mobility strategies of the robotic relay nodes in a mobile sensor network in order to maximize its network lifetime. By using variable substitutions, the original problem is converted into a convex problem, and a variant of the sub-gradient method for saddle-point computation is developed for solving this problem. An optimal solution is obtained by the method. Computer simulations show that mobility of robotic sensors can significantly prolong the lifetime of the whole robotic sensor network while

Analyzing the factors affecting network lifetime cluster-based wireless sensor network

International Nuclear Information System (INIS)

Malik, A.S.; Qureshi, A.

2010-01-01

Cluster-based wireless sensor networks enable the efficient utilization of the limited energy resources of the deployed sensor nodes and hence prolong the node as well as network lifetime. Low Energy Adaptive Clustering Hierarchy (Leach) is one of the most promising clustering protocol proposed for wireless sensor networks. This paper provides the energy utilization and lifetime analysis for cluster-based wireless sensor networks based upon LEACH protocol. Simulation results identify some important factors that induce unbalanced energy utilization between the sensor nodes and hence affect the network lifetime in these types of networks. These results highlight the need for a standardized, adaptive and distributed clustering technique that can increase the network lifetime by further balancing the energy utilization among sensor nodes. (author)

Collaborative Distributed Scheduling Approaches for Wireless Sensor Network

Science.gov (United States)

Niu, Jianjun; Deng, Zhidong

2009-01-01

Energy constraints restrict the lifetime of wireless sensor networks (WSNs) with battery-powered nodes, which poses great challenges for their large scale application. In this paper, we propose a family of collaborative distributed scheduling approaches (CDSAs) based on the Markov process to reduce the energy consumption of a WSN. The family of CDSAs comprises of two approaches: a one-step collaborative distributed approach and a two-step collaborative distributed approach. The approaches enable nodes to learn the behavior information of its environment collaboratively and integrate sleep scheduling with transmission scheduling to reduce the energy consumption. We analyze the adaptability and practicality features of the CDSAs. The simulation results show that the two proposed approaches can effectively reduce nodes' energy consumption. Some other characteristics of the CDSAs like buffer occupation and packet delay are also analyzed in this paper. We evaluate CDSAs extensively on a 15-node WSN testbed. The test results show that the CDSAs conserve the energy effectively and are feasible for real WSNs. PMID:22408491

Wireless Power Transfer for Distributed Estimation in Sensor Networks

Science.gov (United States)

Mai, Vien V.; Shin, Won-Yong; Ishibashi, Koji

2017-04-01

This paper studies power allocation for distributed estimation of an unknown scalar random source in sensor networks with a multiple-antenna fusion center (FC), where wireless sensors are equipped with radio-frequency based energy harvesting technology. The sensors' observation is locally processed by using an uncoded amplify-and-forward scheme. The processed signals are then sent to the FC, and are coherently combined at the FC, at which the best linear unbiased estimator (BLUE) is adopted for reliable estimation. We aim to solve the following two power allocation problems: 1) minimizing distortion under various power constraints; and 2) minimizing total transmit power under distortion constraints, where the distortion is measured in terms of mean-squared error of the BLUE. Two iterative algorithms are developed to solve the non-convex problems, which converge at least to a local optimum. In particular, the above algorithms are designed to jointly optimize the amplification coefficients, energy beamforming, and receive filtering. For each problem, a suboptimal design, a single-antenna FC scenario, and a common harvester deployment for colocated sensors, are also studied. Using the powerful semidefinite relaxation framework, our result is shown to be valid for any number of sensors, each with different noise power, and for an arbitrarily number of antennas at the FC.

Block Least Mean Squares Algorithm over Distributed Wireless Sensor Network

Directory of Open Access Journals (Sweden)

T. Panigrahi

2012-01-01

Full Text Available In a distributed parameter estimation problem, during each sampling instant, a typical sensor node communicates its estimate either by the diffusion algorithm or by the incremental algorithm. Both these conventional distributed algorithms involve significant communication overheads and, consequently, defeat the basic purpose of wireless sensor networks. In the present paper, we therefore propose two new distributed algorithms, namely, block diffusion least mean square (BDLMS and block incremental least mean square (BILMS by extending the concept of block adaptive filtering techniques to the distributed adaptation scenario. The performance analysis of the proposed BDLMS and BILMS algorithms has been carried out and found to have similar performances to those offered by conventional diffusion LMS and incremental LMS algorithms, respectively. The convergence analyses of the proposed algorithms obtained from the simulation study are also found to be in agreement with the theoretical analysis. The remarkable and interesting aspect of the proposed block-based algorithms is that their communication overheads per node and latencies are less than those of the conventional algorithms by a factor as high as the block size used in the algorithms.

Networked sensors for the combat forces

Science.gov (United States)

Klager, Gene

2004-11-01

Real-time and detailed information is critical to the success of ground combat forces. Current manned reconnaissance, surveillance, and target acquisition (RSTA) capabilities are not sufficient to cover battlefield intelligence gaps, provide Beyond-Line-of-Sight (BLOS) targeting, and the ambush avoidance information necessary for combat forces operating in hostile situations, complex terrain, and conducting military operations in urban terrain. This paper describes a current US Army program developing advanced networked unmanned/unattended sensor systems to survey these gaps and provide the Commander with real-time, pertinent information. Networked Sensors for the Combat Forces plans to develop and demonstrate a new generation of low cost distributed unmanned sensor systems organic to the RSTA Element. Networked unmanned sensors will provide remote monitoring of gaps, will increase a unit"s area of coverage, and will provide the commander organic assets to complete his Battlefield Situational Awareness (BSA) picture for direct and indirect fire weapons, early warning, and threat avoidance. Current efforts include developing sensor packages for unmanned ground vehicles, small unmanned aerial vehicles, and unattended ground sensors using advanced sensor technologies. These sensors will be integrated with robust networked communications and Battle Command tools for mission planning, intelligence "reachback", and sensor data management. The network architecture design is based on a model that identifies a three-part modular design: 1) standardized sensor message protocols, 2) Sensor Data Management, and 3) Service Oriented Architecture. This simple model provides maximum flexibility for data exchange, information management and distribution. Products include: Sensor suites optimized for unmanned platforms, stationary and mobile versions of the Sensor Data Management Center, Battle Command planning tools, networked communications, and sensor management software. Details

Towards a distributed control system for software defined wireless sensor networks

CSIR Research Space (South Africa)

Kobo, Hlabishi I

2017-10-01

Full Text Available on the network device. The coupling stifles innovation and evolution because the network often becomes rigid. Software Defined Wireless Sensor Networks (SDWSN) is also an emerging network paradigm that infuses the SDN model into Wireless Sensor Networks (WSNs...

A Secure Scheme for Distributed Consensus Estimation against Data Falsification in Heterogeneous Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Shichao Mi

2016-02-01

Full Text Available Heterogeneous wireless sensor networks (HWSNs can achieve more tasks and prolong the network lifetime. However, they are vulnerable to attacks from the environment or malicious nodes. This paper is concerned with the issues of a consensus secure scheme in HWSNs consisting of two types of sensor nodes. Sensor nodes (SNs have more computation power, while relay nodes (RNs with low power can only transmit information for sensor nodes. To address the security issues of distributed estimation in HWSNs, we apply the heterogeneity of responsibilities between the two types of sensors and then propose a parameter adjusted-based consensus scheme (PACS to mitigate the effect of the malicious node. Finally, the convergence property is proven to be guaranteed, and the simulation results validate the effectiveness and efficiency of PACS.

Autonomous vision networking: miniature wireless sensor networks with imaging technology

Science.gov (United States)

Messinger, Gioia; Goldberg, Giora

2006-09-01

The recent emergence of integrated PicoRadio technology, the rise of low power, low cost, System-On-Chip (SOC) CMOS imagers, coupled with the fast evolution of networking protocols and digital signal processing (DSP), created a unique opportunity to achieve the goal of deploying large-scale, low cost, intelligent, ultra-low power distributed wireless sensor networks for the visualization of the environment. Of all sensors, vision is the most desired, but its applications in distributed sensor networks have been elusive so far. Not any more. The practicality and viability of ultra-low power vision networking has been proven and its applications are countless, from security, and chemical analysis to industrial monitoring, asset tracking and visual recognition, vision networking represents a truly disruptive technology applicable to many industries. The presentation discusses some of the critical components and technologies necessary to make these networks and products affordable and ubiquitous - specifically PicoRadios, CMOS imagers, imaging DSP, networking and overall wireless sensor network (WSN) system concepts. The paradigm shift, from large, centralized and expensive sensor platforms, to small, low cost, distributed, sensor networks, is possible due to the emergence and convergence of a few innovative technologies. Avaak has developed a vision network that is aided by other sensors such as motion, acoustic and magnetic, and plans to deploy it for use in military and commercial applications. In comparison to other sensors, imagers produce large data files that require pre-processing and a certain level of compression before these are transmitted to a network server, in order to minimize the load on the network. Some of the most innovative chemical detectors currently in development are based on sensors that change color or pattern in the presence of the desired analytes. These changes are easily recorded and analyzed by a CMOS imager and an on-board DSP processor

A Partially Distributed Intrusion Detection System for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Eung Jun Cho

2013-11-01

Full Text Available The increasing use of wireless sensor networks, which normally comprise several very small sensor nodes, makes their security an increasingly important issue. They can be practically and efficiently secured using intrusion detection systems. Conventional security mechanisms are not usually applicable due to the sensor nodes having limitations of computational power, memory capacity, and battery power. Therefore, specific security systems should be designed to function under constraints of energy or memory. A partially distributed intrusion detection system with low memory and power demands is proposed here. It employs a Bloom filter, which allows reduced signature code size. Multiple Bloom filters can be combined to reduce the signature code for each Bloom filter array. The mechanism could then cope with potential denial of service attacks, unlike many previous detection systems with Bloom filters. The mechanism was evaluated and validated through analysis and simulation.

DEHAR: a Distributed Energy Harvesting Aware Routing Algorithm for Ad-hoc Multi-hop Wireless Sensor Networks

DEFF Research Database (Denmark)

Jakobsen, Mikkel Koefoed; Madsen, Jan; Hansen, Michael Reichhardt

2010-01-01

One of the key design goals in Wireless Sensor Networks is long lasting or even continuous operation. Continuous operation is made possible through energy harvesting. Keeping the network operational imposes a demand to prevent network segmentation and power loss in nodes. It is therefore important...... that the best energy-wise route is found for each data transfer from a source node to the sink node. We present a new adaptive and distributed routing algorithm for finding energy optimised routes in a wireless sensor network with energy harvesting. The algorithm finds an energy efficient route from each source...

Medical Sensor Network Infrastructures

DEFF Research Database (Denmark)

Andersen, Jacob

researchers have been developing power-efficient security mechanisms for sensor networks. However, most of this work ignores the special usability demands from the clinical use-scenarios: set-up must be fast, and key pre-distribution is problematic if disposable sensors are discarded after being used for only...

An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Rosana Lachowski

2015-01-01

Full Text Available Monitoring and data collection are the two main functions in wireless sensor networks (WSNs. Collected data are generally transmitted via multihop communication to a special node, called the sink. While in a typical WSN, nodes have a sink node as the final destination for the data traffic, in an ad hoc network, nodes need to communicate with each other. For this reason, routing protocols for ad hoc networks are inefficient for WSNs. Trees, on the other hand, are classic routing structures explicitly or implicitly used in WSNs. In this work, we implement and evaluate distributed algorithms for constructing routing trees in WSNs described in the literature. After identifying the drawbacks and advantages of these algorithms, we propose a new algorithm for constructing spanning trees in WSNs. The performance of the proposed algorithm and the quality of the constructed tree were evaluated in different network scenarios. The results showed that the proposed algorithm is a more efficient solution. Furthermore, the algorithm provides multiple routes to the sensor nodes to be used as mechanisms for fault tolerance and load balancing.

Distributed coding/decoding complexity in video sensor networks.

Science.gov (United States)

Cordeiro, Paulo J; Assunção, Pedro

2012-01-01

Video Sensor Networks (VSNs) are recent communication infrastructures used to capture and transmit dense visual information from an application context. In such large scale environments which include video coding, transmission and display/storage, there are several open problems to overcome in practical implementations. This paper addresses the most relevant challenges posed by VSNs, namely stringent bandwidth usage and processing time/power constraints. In particular, the paper proposes a novel VSN architecture where large sets of visual sensors with embedded processors are used for compression and transmission of coded streams to gateways, which in turn transrate the incoming streams and adapt them to the variable complexity requirements of both the sensor encoders and end-user decoder terminals. Such gateways provide real-time transcoding functionalities for bandwidth adaptation and coding/decoding complexity distribution by transferring the most complex video encoding/decoding tasks to the transcoding gateway at the expense of a limited increase in bit rate. Then, a method to reduce the decoding complexity, suitable for system-on-chip implementation, is proposed to operate at the transcoding gateway whenever decoders with constrained resources are targeted. The results show that the proposed method achieves good performance and its inclusion into the VSN infrastructure provides an additional level of complexity control functionality.

An Expert System And Simulation Approach For Sensor Management & Control In A Distributed Surveillance Network

Science.gov (United States)

Leon, Barbara D.; Heller, Paul R.

1987-05-01

A surveillance network is a group of multiplatform sensors cooperating to improve network performance. Network control is distributed as a measure to decrease vulnerability to enemy threat. The network may contain diverse sensor types such as radar, ESM (Electronic Support Measures), IRST (Infrared search and track) and E-0 (Electro-Optical). Each platform may contain a single sensor or suite of sensors. In a surveillance network it is desirable to control sensors to make the overall system more effective. This problem has come to be known as sensor management and control (SM&C). Two major facets of network performance are surveillance and survivability. In a netted environment, surveillance can be enhanced if information from all sensors is combined and sensor operating conditions are controlled to provide a synergistic effect. In contrast, when survivability is the main concern for the network, the best operating status for all sensors would be passive or off. Of course, improving survivability tends to degrade surveillance. Hence, the objective of SM&C is to optimize surveillance and survivability of the network. Too voluminous data of various formats and the quick response time are two characteristics of this problem which make it an ideal application for Artificial Intelligence. A solution to the SM&C problem, presented as a computer simulation, will be presented in this paper. The simulation is a hybrid production written in LISP and FORTRAN. It combines the latest conventional computer programming methods with Artificial Intelligence techniques to produce a flexible state-of-the-art tool to evaluate network performance. The event-driven simulation contains environment models coupled with an expert system. These environment models include sensor (track-while-scan and agile beam) and target models, local tracking, and system tracking. These models are used to generate the environment for the sensor management and control expert system. The expert system

Analysis of Distributed Consensus Time Synchronization with Gaussian Delay over Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Xiong Gang

2009-01-01

Full Text Available This paper presents theoretical results on the convergence of the distributed consensus timing synchronization (DCTS algorithm for wireless sensor networks assuming general Gaussian delay between nodes. The asymptotic expectation and mean square of the global synchronization error are computed. The results lead to the definition of a time delay balanced network in which average timing consensus between nodes can be achieved despite random delays. Several structured network architectures are studied as examples, and their associated simulation results are used to validate analytical findings.

Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning

Science.gov (United States)

Schumacher, André; Haanpää, Harri

We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximation algorithm by applying linear programming approximation techniques. Our algorithm is an application of the Garg-Könemann (GK) scheme that requires solving an instance of the minimum weight dominating set (MWDS) problem as a subroutine. Our two main contributions are a distributed implementation of the GK scheme for the sleep-scheduling problem and a novel asynchronous distributed algorithm for approximating MWDS based on a primal-dual analysis of Chvátal's set-cover algorithm. We evaluate our algorithm with ns2 simulations.

Distributed collaborative processing in wireless sensor networks with application to target localization and beamforming

OpenAIRE

Béjar Haro, Benjamín

2013-01-01

Abstract The proliferation of wireless sensor networks and the variety of envisioned applications associated with them has motivated the development of distributed algorithms for collaborative processing over networked systems. One of the applications that has attracted the attention of the researchers is that of target localization where the nodes of the network try to estimate the position of an unknown target that lies within its coverage area. Particularly challenging is the problem of es...

Secure and Cost-Effective Distributed Aggregation for Mobile Sensor Networks.

Science.gov (United States)

Guo, Kehua; Zhang, Ping; Ma, Jianhua

2016-04-23

Secure data aggregation (SDA) schemes are widely used in distributed applications, such as mobile sensor networks, to reduce communication cost, prolong the network life cycle and provide security. However, most SDA are only suited for a single type of statistics (i.e., summation-based or comparison-based statistics) and are not applicable to obtaining multiple statistic results. Most SDA are also inefficient for dynamic networks. This paper presents multi-functional secure data aggregation (MFSDA), in which the mapping step and coding step are introduced to provide value-preserving and order-preserving and, later, to enable arbitrary statistics support in the same query. MFSDA is suited for dynamic networks because these active nodes can be counted directly from aggregation data. The proposed scheme is tolerant to many types of attacks. The network load of the proposed scheme is balanced, and no significant bottleneck exists. The MFSDA includes two versions: MFSDA-I and MFSDA-II. The first one can obtain accurate results, while the second one is a more generalized version that can significantly reduce network traffic at the expense of less accuracy loss.

A DISTRIBUTED ENERGY EFFICIENT CLUSTERING ALGORITHM FOR DATA AGGREGATION IN WIRELESS SENSOR NETWORKS

Directory of Open Access Journals (Sweden)

Seyed Mohammad Bagher Musavi Shirazi

2018-06-01

Full Text Available Wireless sensor networks (WSNs are a new generation of networks typically consisting of a large number of inexpensive nodes with wireless communications. The main purpose of these networks is to collect information from the environment for further processing. Nodes in the network have been equipped with limited battery lifetime, so energy saving is one of the major issues in WSNs. If we balance the load among cluster heads and prevent having an extra load on just a few nodes in the network, we can reach longer network lifetime. One solution to control energy consumption and balance the load among nodes is to use clustering techniques. In this paper, we propose a new distributed energy-efficient clustering algorithm for data aggregation in wireless sensor networks, called Distributed Clustering for Data Aggregation (DCDA. In our new approach, an optimal transmission tree is constructed among sensor nodes with a new greedy method. Base station (BS is the root, cluster heads (CHs and relay nodes are intermediate nodes, and other nodes (cluster member nodes are the leaves of this transmission tree. DCDA balances load among CHs in intra-cluster and inter-cluster data communications using different cluster sizes. For efficient inter-cluster communications, some relay nodes will transfer data between CHs. Energy consumption, distance to the base station, and cluster heads’ centric metric are three main adjustment parameters for the cluster heads election. Simulation results show that the proposed protocol leads to the reduction of individual sensor nodes’ energy consumption and prolongs network lifetime, in comparison with other known methods. ABSTRAK: Rangkaian sensor wayarles (WSN adalah rangkaian generasi baru yang terdiri daripada nod-nod murah komunikasi wayarles. Tujuan rangkaian-rangkaian ini adalah bagi mengumpul maklumat sekeliling untuk proses seterusnya. Nod dalam rangkaian ini dilengkapi bateri kurang jangka hayat, jadi simpanan tenaga

Collaborative Distributed Scheduling Approaches for Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Zhidong Deng

2009-10-01

Full Text Available Energy constraints restrict the lifetime of wireless sensor networks (WSNs with battery-powered nodes, which poses great challenges for their large scale application. In this paper, we propose a family of collaborative distributed scheduling approaches (CDSAs based on the Markov process to reduce the energy consumption of a WSN. The family of CDSAs comprises of two approaches: a one-step collaborative distributed approach and a two-step collaborative distributed approach. The approaches enable nodes to learn the behavior information of its environment collaboratively and integrate sleep scheduling with transmission scheduling to reduce the energy consumption. We analyze the adaptability and practicality features of the CDSAs. The simulation results show that the two proposed approaches can effectively reduce nodes’ energy consumption. Some other characteristics of the CDSAs like buffer occupation and packet delay are also analyzed in this paper. We evaluate CDSAs extensively on a 15-node WSN testbed. The test results show that the CDSAs conserve the energy effectively and are feasible for real WSNs.

Sensor Network Disposition Facing the Task of Multisensor Cross Cueing

Directory of Open Access Journals (Sweden)

Ce Pang

2017-01-01

Full Text Available In order to build the sensor network facing the task of multisensor crossing cueing, the requirements of initiating cueing and being cued are analyzed. Probability theory is used when building models, then probability of sensor cueing in the case of target moving is given, and, after that, the best distance between two sensors is calculated. The operational environment is described by normal distribution function. In the process of distributing sensor network, their elements, operational environment demand of cueing, and the probability of sensor network coverage are considered; then the optimization algorithm of sensor network based on hypothesis testing theory is made. The simulation result indicates that the algorithm can make sensor network which is required. On the basis of that, the two cases, including targets that make linear motion and orbit motion, are used to test the performance of the sensor network, which show that the sensor network can make uninterrupted detection on targets through multisensor cross cuing.

Modular sensor network node

Science.gov (United States)

Davis, Jesse Harper Zehring [Berkeley, CA; Stark, Jr., Douglas Paul; Kershaw, Christopher Patrick [Hayward, CA; Kyker, Ronald Dean [Livermore, CA

2008-06-10

A distributed wireless sensor network node is disclosed. The wireless sensor network node includes a plurality of sensor modules coupled to a system bus and configured to sense a parameter. The parameter may be an object, an event or any other parameter. The node collects data representative of the parameter. The node also includes a communication module coupled to the system bus and configured to allow the node to communicate with other nodes. The node also includes a processing module coupled to the system bus and adapted to receive the data from the sensor module and operable to analyze the data. The node also includes a power module connected to the system bus and operable to generate a regulated voltage.

Distributed estimation and control for mobile sensor networks with coupling delays.

Science.gov (United States)

Su, Housheng; Chen, Xuan; Chen, Michael Z Q; Wang, Lei

2016-09-01

This paper deals with the issue of distributed estimation and control for mobile sensor networks with coupling delays. Based on the Kalman-Consensus filter and the flocking algorithm, all mobile sensors move to a target to increase the quality of gathered data, and achieve consensus on the estimation values of the target in the presence of time-delay and noises. By applying an effective cascading Lyapunov method and matrix theory, stability analysis is carried out. Furthermore, a necessary condition for the convergence is presented via the boundary conditions of feedback coefficients. Some numerical examples are provided to validate the effectiveness of theoretical results. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Estimation of distributed Fermat-point location for wireless sensor networking.

Science.gov (United States)

Huang, Po-Hsian; Chen, Jiann-Liang; Larosa, Yanuarius Teofilus; Chiang, Tsui-Lien

2011-01-01

This work presents a localization scheme for use in wireless sensor networks (WSNs) that is based on a proposed connectivity-based RF localization strategy called the distributed Fermat-point location estimation algorithm (DFPLE). DFPLE applies triangle area of location estimation formed by intersections of three neighboring beacon nodes. The Fermat point is determined as the shortest path from three vertices of the triangle. The area of estimated location then refined using Fermat point to achieve minimum error in estimating sensor nodes location. DFPLE solves problems of large errors and poor performance encountered by localization schemes that are based on a bounding box algorithm. Performance analysis of a 200-node development environment reveals that, when the number of sensor nodes is below 150, the mean error decreases rapidly as the node density increases, and when the number of sensor nodes exceeds 170, the mean error remains below 1% as the node density increases. Second, when the number of beacon nodes is less than 60, normal nodes lack sufficient beacon nodes to enable their locations to be estimated. However, the mean error changes slightly as the number of beacon nodes increases above 60. Simulation results revealed that the proposed algorithm for estimating sensor positions is more accurate than existing algorithms, and improves upon conventional bounding box strategies.

Distributed estimation of sensors position in underwater wireless sensor network

Science.gov (United States)

Zandi, Rahman; Kamarei, Mahmoud; Amiri, Hadi

2016-05-01

In this paper, a localisation method for determining the position of fixed sensor nodes in an underwater wireless sensor network (UWSN) is introduced. In this simple and range-free scheme, the node localisation is achieved by utilising an autonomous underwater vehicle (AUV) that transverses through the network deployment area, and that periodically emits a message block via four directional acoustic beams. A message block contains the actual known AUV position as well as a directional dependent marker that allows a node to identify the respective transmit beam. The beams form a fixed angle with the AUV body. If a node passively receives message blocks, it could calculate the arithmetic mean of the coordinates existing in each messages sequence, to find coordinates at two different time instants via two different successive beams. The node position can be derived from the two computed positions of the AUV. The major advantage of the proposed localisation algorithm is that it is silent, which leads to energy efficiency for sensor nodes. The proposed method does not require any synchronisation among the nodes owing to being silent. Simulation results, using MATLAB, demonstrated that the proposed method had better performance than other similar AUV-based localisation methods in terms of the rates of well-localised sensor nodes and positional root mean square error.

A Review on Sensor Network Issues and Robotics

Directory of Open Access Journals (Sweden)

Ji Hyoung Ryu

2015-01-01

Full Text Available The interaction of distributed robotics and wireless sensor networks has led to the creation of mobile sensor networks. There has been an increasing interest in building mobile sensor networks and they are the favored class of WSNs in which mobility plays a key role in the execution of an application. More and more researches focus on development of mobile wireless sensor networks (MWSNs due to its favorable advantages and applications. In WSNs robotics can play a crucial role, and integrating static nodes with mobile robots enhances the capabilities of both types of devices and enables new applications. In this paper we present an overview on mobile sensor networks in robotics and vice versa and robotic sensor network applications.

Distributed intelligent sensor network for the rehabilitation of Parkinson's patients.

Science.gov (United States)

Ying, Hong; Schlösser, Mario; Schnitzer, Andreas; Schäfer, Thorsten; Schläfke, Marianne E; Leonhardt, Steffen; Schiek, Michael

2011-03-01

The coordination between locomotion and respiration of Parkinson's disease (PD) patients is reduced or even absent. The degree of this disturbance is assumed to be associated with the disease severity [S. Schiermeier, D. Schäfer, T. Schäfer, W. Greulich, and M. E. Schläfke, "Breathing and locomotion in patients with Parkinson's disease," Eur. J. Physiol., vol. 443, No. 1, pp. 67-71, Jul. 2001]. To enable a long-term and online analysis of the locomotion-respiration coordination for scientific purpose, we have developed a distributed wireless communicating network. We aim to integrate biofeedback protocols with the real-time analysis of the locomotion-respiration coordination in the system to aid rehabilitation of PD patients. The network of sensor nodes is composed of intelligent network operating devices (iNODEs). The miniaturized iNODE contains a continuous data acquisition system based on microcontroller, local data storage, capability of on-sensor digital signal processing in real time, and wireless communication based on IEEE 802.15.4. Force sensing resistors and respiratory inductive plethysmography are applied for motion and respiration sensing, respectively. A number of experiments have been undertaken in clinic and laboratory to test the system. It shall facilitate identification of therapeutic effects on PD, allowing to measure the patients' health status, and to aid in the rehabilitation of PD patients.

On Prolonging Network Lifetime through Load-Similar Node Deployment in Wireless Sensor Networks

Science.gov (United States)

Li, Qiao-Qin; Gong, Haigang; Liu, Ming; Yang, Mei; Zheng, Jun

2011-01-01

This paper is focused on the study of the energy hole problem in the Progressive Multi-hop Rotational Clustered (PMRC)-structure, a highly scalable wireless sensor network (WSN) architecture. Based on an analysis on the traffic load distribution in PMRC-based WSNs, we propose a novel load-similar node distribution strategy combined with the Minimum Overlapping Layers (MOL) scheme to address the energy hole problem in PMRC-based WSNs. In this strategy, sensor nodes are deployed in the network area according to the load distribution. That is, more nodes shall be deployed in the range where the average load is higher, and then the loads among different areas in the sensor network tend to be balanced. Simulation results demonstrate that the load-similar node distribution strategy prolongs network lifetime and reduces the average packet latency in comparison with existing nonuniform node distribution and uniform node distribution strategies. Note that, besides the PMRC structure, the analysis model and the proposed load-similar node distribution strategy are also applicable to other multi-hop WSN structures. PMID:22163809

Improving control and estimation for distributed parameter systems utilizing mobile actuator-sensor network.

Science.gov (United States)

Mu, Wenying; Cui, Baotong; Li, Wen; Jiang, Zhengxian

2014-07-01

This paper proposes a scheme for non-collocated moving actuating and sensing devices which is unitized for improving performance in distributed parameter systems. By Lyapunov stability theorem, each moving actuator/sensor agent velocity is obtained. To enhance state estimation of a spatially distributes process, two kinds of filters with consensus terms which penalize the disagreement of the estimates are considered. Both filters can result in the well-posedness of the collective dynamics of state errors and can converge to the plant state. Numerical simulations demonstrate that the effectiveness of such a moving actuator-sensor network in enhancing system performance and the consensus filters converge faster to the plant state when consensus terms are included. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.

Estimation of Distributed Fermat-Point Location for Wireless Sensor Networking

Directory of Open Access Journals (Sweden)

Yanuarius Teofilus Larosa

2011-04-01

Full Text Available This work presents a localization scheme for use in wireless sensor networks (WSNs that is based on a proposed connectivity-based RF localization strategy called the distributed Fermat-point location estimation algorithm (DFPLE. DFPLE applies triangle area of location estimation formed by intersections of three neighboring beacon nodes. The Fermat point is determined as the shortest path from three vertices of the triangle. The area of estimated location then refined using Fermat point to achieve minimum error in estimating sensor nodes location. DFPLE solves problems of large errors and poor performance encountered by localization schemes that are based on a bounding box algorithm. Performance analysis of a 200-node development environment reveals that, when the number of sensor nodes is below 150, the mean error decreases rapidly as the node density increases, and when the number of sensor nodes exceeds 170, the mean error remains below 1% as the node density increases. Second, when the number of beacon nodes is less than 60, normal nodes lack sufficient beacon nodes to enable their locations to be estimated. However, the mean error changes slightly as the number of beacon nodes increases above 60. Simulation results revealed that the proposed algorithm for estimating sensor positions is more accurate than existing algorithms, and improves upon conventional bounding box strategies.

Robust Forecasting for Energy Efficiency of Wireless Multimedia Sensor Networks.

Science.gov (United States)

Wang, Xue; Ma, Jun-Jie; Ding, Liang; Bi, Dao-Wei

2007-11-15

An important criterion of wireless sensor network is the energy efficiency inspecified applications. In this wireless multimedia sensor network, the observations arederived from acoustic sensors. Focused on the energy problem of target tracking, this paperproposes a robust forecasting method to enhance the energy efficiency of wirelessmultimedia sensor networks. Target motion information is acquired by acoustic sensornodes while a distributed network with honeycomb configuration is constructed. Thereby,target localization is performed by multiple sensor nodes collaboratively through acousticsignal processing. A novel method, combining autoregressive moving average (ARMA)model and radial basis function networks (RBFNs), is exploited to perform robust targetposition forecasting during target tracking. Then sensor nodes around the target areawakened according to the forecasted target position. With committee decision of sensornodes, target localization is performed in a distributed manner and the uncertainty ofdetection is reduced. Moreover, a sensor-to-observer routing approach of the honeycombmesh network is investigated to solve the data reporting considering the residual energy ofsensor nodes. Target localization and forecasting are implemented in experiments.Meanwhile, sensor node awakening and dynamic routing are evaluated. Experimentalresults verify that energy efficiency of wireless multimedia sensor network is enhanced bythe proposed target tracking method.

Secure Distributed Detection under Energy Constraint in IoT-Oriented Sensor Networks.

Science.gov (United States)

Zhang, Guomei; Sun, Hao

2016-12-16

We study the secure distributed detection problems under energy constraint for IoT-oriented sensor networks. The conventional channel-aware encryption (CAE) is an efficient physical-layer secure distributed detection scheme in light of its energy efficiency, good scalability and robustness over diverse eavesdropping scenarios. However, in the CAE scheme, it remains an open problem of how to optimize the key thresholds for the estimated channel gain, which are used to determine the sensor's reporting action. Moreover, the CAE scheme does not jointly consider the accuracy of local detection results in determining whether to stay dormant for a sensor. To solve these problems, we first analyze the error probability and derive the optimal thresholds in the CAE scheme under a specified energy constraint. These results build a convenient mathematic framework for our further innovative design. Under this framework, we propose a hybrid secure distributed detection scheme. Our proposal can satisfy the energy constraint by keeping some sensors inactive according to the local detection confidence level, which is characterized by likelihood ratio. In the meanwhile, the security is guaranteed through randomly flipping the local decisions forwarded to the fusion center based on the channel amplitude. We further optimize the key parameters of our hybrid scheme, including two local decision thresholds and one channel comparison threshold. Performance evaluation results demonstrate that our hybrid scheme outperforms the CAE under stringent energy constraints, especially in the high signal-to-noise ratio scenario, while the security is still assured.

A Distributed Routing Scheme for Energy Management in Solar Powered Sensor Networks

KAUST Repository

Dehwah, Ahmad H.; Shamma, Jeff S.; Claudel, Christian G.

2017-01-01

Energy management is critical for solar-powered sensor networks. In this article, we consider data routing policies to optimize the energy in solar powered networks. Motivated by multipurpose sensor networks, the objective is to find the best

Study on distributed re-clustering algorithm for moblie wireless sensor networks

Directory of Open Access Journals (Sweden)

XU Chaojie

2016-04-01

Full Text Available In mobile wireless sensor networks,node mobility influences the topology of the hierarchically clustered network,thus affects packet delivery ratio and energy consumption of communications in clusters.To reduce the influence of node mobility,a distributed re-clustering algorithm is proposed in this paper.In this algorithm,basing on the clustered network,nodes estimate their current locations with particle algorithm and predict the most possible locations of next time basing on the mobility model.Each boundary node of a cluster periodically estimates the need for re-clustering and re-cluster itself to the optimal cluster through communicating with the cluster headers when needed.The simulation results indicate that,with small re-clustering periods,the proposed algorithm can be effective to keep appropriate communication distance and outperforms existing schemes on packet delivery ratio and energy consumption.

Optimal sensor placement for leak location in water distribution networks using genetic algorithms.

Science.gov (United States)

Casillas, Myrna V; Puig, Vicenç; Garza-Castañón, Luis E; Rosich, Albert

2013-11-04

This paper proposes a new sensor placement approach for leak location in water distribution networks (WDNs). The sensor placement problem is formulated as an integer optimization problem. The optimization criterion consists in minimizing the number of non-isolable leaks according to the isolability criteria introduced. Because of the large size and non-linear integer nature of the resulting optimization problem, genetic algorithms (GAs) are used as the solution approach. The obtained results are compared with a semi-exhaustive search method with higher computational effort, proving that GA allows one to find near-optimal solutions with less computational load. Moreover, three ways of increasing the robustness of the GA-based sensor placement method have been proposed using a time horizon analysis, a distance-based scoring and considering different leaks sizes. A great advantage of the proposed methodology is that it does not depend on the isolation method chosen by the user, as long as it is based on leak sensitivity analysis. Experiments in two networks allow us to evaluate the performance of the proposed approach.

Optimal Sensor Placement for Leak Location in Water Distribution Networks Using Genetic Algorithms

Directory of Open Access Journals (Sweden)

Luis E. Garza-Castañón

2013-11-01

Full Text Available This paper proposes a new sensor placement approach for leak location in water distribution networks (WDNs. The sensor placement problem is formulated as an integer optimization problem. The optimization criterion consists in minimizing the number of non-isolable leaks according to the isolability criteria introduced. Because of the large size and non-linear integer nature of the resulting optimization problem, genetic algorithms (GAs are used as the solution approach. The obtained results are compared with a semi-exhaustive search method with higher computational effort, proving that GA allows one to find near-optimal solutions with less computational load. Moreover, three ways of increasing the robustness of the GA-based sensor placement method have been proposed using a time horizon analysis, a distance-based scoring and considering different leaks sizes. A great advantage of the proposed methodology is that it does not depend on the isolation method chosen by the user, as long as it is based on leak sensitivity analysis. Experiments in two networks allow us to evaluate the performance of the proposed approach.

Optimal Sensor Placement for Leak Location in Water Distribution Networks Using Genetic Algorithms

Science.gov (United States)

Casillas, Myrna V.; Puig, Vicenç; Garza-Castañón, Luis E.; Rosich, Albert

2013-01-01

This paper proposes a new sensor placement approach for leak location in water distribution networks (WDNs). The sensor placement problem is formulated as an integer optimization problem. The optimization criterion consists in minimizing the number of non-isolable leaks according to the isolability criteria introduced. Because of the large size and non-linear integer nature of the resulting optimization problem, genetic algorithms (GAs) are used as the solution approach. The obtained results are compared with a semi-exhaustive search method with higher computational effort, proving that GA allows one to find near-optimal solutions with less computational load. Moreover, three ways of increasing the robustness of the GA-based sensor placement method have been proposed using a time horizon analysis, a distance-based scoring and considering different leaks sizes. A great advantage of the proposed methodology is that it does not depend on the isolation method chosen by the user, as long as it is based on leak sensitivity analysis. Experiments in two networks allow us to evaluate the performance of the proposed approach. PMID:24193099

Damage detection on mesosurfaces using distributed sensor network and spectral diffusion maps

International Nuclear Information System (INIS)

Chinde, V; Vaidya, U; Laflamme, S; Cao, L

2016-01-01

In this work, we develop a data-driven method for the diagnosis of damage in mesoscale mechanical structures using an array of distributed sensor networks. The proposed approach relies on comparing intrinsic geometries of data sets corresponding to the undamaged and damaged states of the system. We use a spectral diffusion map approach to identify the intrinsic geometry of the data set. In particular, time series data from distributed sensors is used for the construction of diffusion maps. The low dimensional embedding of the data set corresponding to different damage levels is obtained using a singular value decomposition of the diffusion map. We construct appropriate metrics in the diffusion space to compare the different data sets corresponding to different damage cases. The developed algorithm is applied for damage diagnosis of wind turbine blades. To achieve this goal, we developed a detailed finite element-based model of CX-100 blade in ANSYS using shell elements. Typical damage, such as crack or delamination, will lead to a loss of stiffness, is modeled by altering the stiffness of the laminate layer. One of the main challenges in the development of health monitoring algorithms is the ability to use sensor data with a relatively small signal-to-noise ratio. Our developed diffusion map-based algorithm is shown to be robust to the presence of sensor noise. The proposed diffusion map-based algorithm is advantageous by enabling the comparison of data from numerous sensors of similar or different types of data through data fusion, hereby making it attractive to exploit the distributed nature of sensor arrays. This distributed nature is further exploited for the purpose of damage localization. We perform extensive numerical simulations to demonstrate that the proposed method can successfully determine the extent of damage on the wind turbine blade and also localize the damage. We also present preliminary results for the application of the developed algorithm on

Distributed detection in UWB sensor networks under non-orthogonal Nakagami-m fading

KAUST Repository

Mehbodniya, Abolfazl

2011-09-01

Several attractive features of ultra wideband (UWB) communications make it a good candidate for physical-layer of wireless sensor networks (WSN). These features include low power consumption, low complexity and low cost of implementation. In this paper, we present an opportunistic power assignment strategy for distributed detection in parallel fusion WSNs, considering a Nakagami-m fading model for the communication channel and time-hopping (TH) UWB for the transmitter circuit of the sensor nodes. In a parallel fusion WSN, local decisions are made by local sensors and transmitted through wireless channels to a fusion center. The fusion center processes the information and makes the final decision. Simulation results are provided for the global probability of detection error and relative performance gain to evaluate the efficiency of the proposed power assignment strategy in different fading environments. © 2011 IEEE.

Human behavior understanding in networked sensing theory and applications of networks of sensors

CERN Document Server

Spagnolo, Paolo; Distante, Cosimo

2014-01-01

This unique text/reference provides a broad overview of both the technical challenges in sensor network development, and the real-world applications of distributed sensing. Important aspects of distributed computing in large-scale networked sensor systems are analyzed in the context of human behavior understanding, including such topics as systems design tools and techniques, in-network signals, and information processing. Additionally, the book examines a varied range of application scenarios, covering surveillance, indexing and retrieval, patient care, industrial safety, social and ambient

EMPLOYING SENSOR NETWORK TO GUIDE FIREFIGHTERS IN DANGEROUS AREA

DEFF Research Database (Denmark)

Koohi, Hamidreza; Nadernejad, Ehsan; Fathi, Mahmoud

2010-01-01

In this paper, we intend to focus on the sensor network applications in firefighting. A distributed algorithm is developed for the sensor network to guide firefighters through a burning area. The sensor network models the danger of the area under coverage as obstacles, and has the property to adapt...... itself against possible changes. The protocol developed, will integrate the artificial potential field of the sensors with the information of the intended place of moving firefighter so that it guides the firefighter step by step through the sensor network by choosing the safest path in dangerous zones....... This protocol is simulated by Visual-Sense and the simulation results are available. Keyword: Firefighter, Sensor Network, Potential Field, Area’s Danger, Navigation...

Graphical Model Theory for Wireless Sensor Networks

International Nuclear Information System (INIS)

Davis, William B.

2002-01-01

Information processing in sensor networks, with many small processors, demands a theory of computation that allows the minimization of processing effort, and the distribution of this effort throughout the network. Graphical model theory provides a probabilistic theory of computation that explicitly addresses complexity and decentralization for optimizing network computation. The junction tree algorithm, for decentralized inference on graphical probability models, can be instantiated in a variety of applications useful for wireless sensor networks, including: sensor validation and fusion; data compression and channel coding; expert systems, with decentralized data structures, and efficient local queries; pattern classification, and machine learning. Graphical models for these applications are sketched, and a model of dynamic sensor validation and fusion is presented in more depth, to illustrate the junction tree algorithm

Distributed Water Pollution Source Localization with Mobile UV-Visible Spectrometer Probes in Wireless Sensor Networks.

Science.gov (United States)

Ma, Junjie; Meng, Fansheng; Zhou, Yuexi; Wang, Yeyao; Shi, Ping

2018-02-16

Pollution accidents that occur in surface waters, especially in drinking water source areas, greatly threaten the urban water supply system. During water pollution source localization, there are complicated pollutant spreading conditions and pollutant concentrations vary in a wide range. This paper provides a scalable total solution, investigating a distributed localization method in wireless sensor networks equipped with mobile ultraviolet-visible (UV-visible) spectrometer probes. A wireless sensor network is defined for water quality monitoring, where unmanned surface vehicles and buoys serve as mobile and stationary nodes, respectively. Both types of nodes carry UV-visible spectrometer probes to acquire in-situ multiple water quality parameter measurements, in which a self-adaptive optical path mechanism is designed to flexibly adjust the measurement range. A novel distributed algorithm, called Dual-PSO, is proposed to search for the water pollution source, where one particle swarm optimization (PSO) procedure computes the water quality multi-parameter measurements on each node, utilizing UV-visible absorption spectra, and another one finds the global solution of the pollution source position, regarding mobile nodes as particles. Besides, this algorithm uses entropy to dynamically recognize the most sensitive parameter during searching. Experimental results demonstrate that online multi-parameter monitoring of a drinking water source area with a wide dynamic range is achieved by this wireless sensor network and water pollution sources are localized efficiently with low-cost mobile node paths.

Energy Aware Clustering Algorithms for Wireless Sensor Networks

Science.gov (United States)

Rakhshan, Noushin; Rafsanjani, Marjan Kuchaki; Liu, Chenglian

2011-09-01

The sensor nodes deployed in wireless sensor networks (WSNs) are extremely power constrained, so maximizing the lifetime of the entire networks is mainly considered in the design. In wireless sensor networks, hierarchical network structures have the advantage of providing scalable and energy efficient solutions. In this paper, we investigate different clustering algorithms for WSNs and also compare these clustering algorithms based on metrics such as clustering distribution, cluster's load balancing, Cluster Head's (CH) selection strategy, CH's role rotation, node mobility, clusters overlapping, intra-cluster communications, reliability, security and location awareness.

SPLAI: Computational Finite Element Model for Sensor Networks

Directory of Open Access Journals (Sweden)

Ruzana Ishak

2006-01-01

Full Text Available Wireless sensor network refers to a group of sensors, linked by a wireless medium to perform distributed sensing task. The primary interest is their capability in monitoring the physical environment through the deployment of numerous tiny, intelligent, wireless networked sensor nodes. Our interest consists of a sensor network, which includes a few specialized nodes called processing elements that can perform some limited computational capabilities. In this paper, we propose a model called SPLAI that allows the network to compute a finite element problem where the processing elements are modeled as the nodes in the linear triangular approximation problem. Our model also considers the case of some failures of the sensors. A simulation model to visualize this network has been developed using C++ on the Windows environment.

Sensors in Distributed Mixed Reality Environments

Directory of Open Access Journals (Sweden)

Felix Hamza-Lup

2005-04-01

Full Text Available A distributed mixed-reality (MR or virtual reality (VR environment implies the cooperative engagement of a set of software and hardware resources. With the advances in sensors and computer networks we have seen an increase in the number of potential MR/VR applications that require large amounts of information from the real world collected through sensors (e.g. position and orientation tracking sensors. These sensors collect data from the real environment in real-time at different locations and a distributed environment connecting them must assure data distribution among collaborative sites at interactive speeds. With the advances in sensor technology, we envision that in future systems a significant amount of data will be collected from sensors and devices attached to the participating nodes This paper proposes a new architecture for sensor based interactive distributed MR/VR environments that falls in-between the atomistic peer-to-peer model and the traditional client-server model. Each node is autonomous and fully manages its resources and connectivity. The dynamic behavior of the nodes is dictated by the human participants that manipulate the sensors attached to these nodes.

Context-Aware Local Optimization of Sensor Network Deployment

Directory of Open Access Journals (Sweden)

Meysam Argany

2015-07-01

Full Text Available Wireless sensor networks are increasingly used for tracking and monitoring dynamic phenomena in urban and natural areas. Spatial coverage is an important issue in sensor networks in order to fulfill the needs of sensing applications. Optimization methods are widely used to efficiently distribute sensor nodes in the network to achieve a desired level of coverage. Most of the existing algorithms do not consider the characteristics of the real environment in the optimization process. In this paper, we propose the integration of contextual information in optimization algorithms to improve sensor network coverage. First, we investigate the implication of contextual information in sensor networks. Then, a conceptual framework for local context-aware sensor network deployment optimization method is introduced and related algorithms are presented in detail. Finally, several experiments are carried out to evaluate the validity of the proposed method. The results obtained from these experiments show the effectiveness of our approach in different contextual situations.

Recent progress in distributed optical fiber Raman photon sensors at China Jiliang University

Science.gov (United States)

Zhang, Zaixuan; Wang, Jianfeng; Li, Yi; Gong, Huaping; Yu, Xiangdong; Liu, Honglin; Jin, Yongxing; Kang, Juan; Li, Chenxia; Zhang, Wensheng; Zhang, Wenping; Niu, Xiaohui; Sun, Zhongzhou; Zhao, Chunliu; Dong, Xinyong; Jin, Shangzhong

2012-06-01

A brief review of recent progress in researches, productions and applications of full distributed fiber Raman photon sensors at China Jiliang University (CJLU) is presented. In order to improve the measurement distance, the accuracy, the space resolution, the ability of multi-parameter measurements, and the intelligence of full distributed fiber sensor systems, a new generation fiber sensor technology based on the optical fiber nonlinear scattering fusion principle is proposed. A series of new generation full distributed fiber sensors are investigated and designed, which consist of new generation ultra-long distance full distributed fiber Raman and Rayleigh scattering photon sensors integrated with a fiber Raman amplifier, auto-correction full distributed fiber Raman photon temperature sensors based on Raman correlation dual sources, full distributed fiber Raman photon temperature sensors based on a pulse coding source, full distributed fiber Raman photon temperature sensors using a fiber Raman wavelength shifter, a new type of Brillouin optical time domain analyzers (BOTDAs) integrated with a fiber Raman amplifier for replacing a fiber Brillouin amplifier, full distributed fiber Raman and Brillouin photon sensors integrated with a fiber Raman amplifier, and full distributed fiber Brillouin photon sensors integrated with a fiber Brillouin frequency shifter. The Internet of things is believed as one of candidates of the next technological revolution, which has driven hundreds of millions of class markets. Sensor networks are important components of the Internet of things. The full distributed optical fiber sensor network (Rayleigh, Raman, and Brillouin scattering) is a 3S (smart materials, smart structure, and smart skill) system, which is easy to construct smart fiber sensor networks. The distributed optical fiber sensor can be embedded in the power grids, railways, bridges, tunnels, roads, constructions, water supply systems, dams, oil and gas pipelines and other

Intrusion-Aware Alert Validation Algorithm for Cooperative Distributed Intrusion Detection Schemes of Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Young-Jae Song

2009-07-01

Full Text Available Existing anomaly and intrusion detection schemes of wireless sensor networks have mainly focused on the detection of intrusions. Once the intrusion is detected, an alerts or claims will be generated. However, any unidentified malicious nodes in the network could send faulty anomaly and intrusion claims about the legitimate nodes to the other nodes. Verifying the validity of such claims is a critical and challenging issue that is not considered in the existing cooperative-based distributed anomaly and intrusion detection schemes of wireless sensor networks. In this paper, we propose a validation algorithm that addresses this problem. This algorithm utilizes the concept of intrusion-aware reliability that helps to provide adequate reliability at a modest communication cost. In this paper, we also provide a security resiliency analysis of the proposed intrusion-aware alert validation algorithm.

Energy-efficient sensing in wireless sensor networks using compressed sensing.

Science.gov (United States)

Razzaque, Mohammad Abdur; Dobson, Simon

2014-02-12

Sensing of the application environment is the main purpose of a wireless sensor network. Most existing energy management strategies and compression techniques assume that the sensing operation consumes significantly less energy than radio transmission and reception. This assumption does not hold in a number of practical applications. Sensing energy consumption in these applications may be comparable to, or even greater than, that of the radio. In this work, we support this claim by a quantitative analysis of the main operational energy costs of popular sensors, radios and sensor motes. In light of the importance of sensing level energy costs, especially for power hungry sensors, we consider compressed sensing and distributed compressed sensing as potential approaches to provide energy efficient sensing in wireless sensor networks. Numerical experiments investigating the effectiveness of compressed sensing and distributed compressed sensing using real datasets show their potential for efficient utilization of sensing and overall energy costs in wireless sensor networks. It is shown that, for some applications, compressed sensing and distributed compressed sensing can provide greater energy efficiency than transform coding and model-based adaptive sensing in wireless sensor networks.

Active self-testing noise measurement sensors for large-scale environmental sensor networks.

Science.gov (United States)

Domínguez, Federico; Cuong, Nguyen The; Reinoso, Felipe; Touhafi, Abdellah; Steenhaut, Kris

2013-12-13

Large-scale noise pollution sensor networks consist of hundreds of spatially distributed microphones that measure environmental noise. These networks provide historical and real-time environmental data to citizens and decision makers and are therefore a key technology to steer environmental policy. However, the high cost of certified environmental microphone sensors render large-scale environmental networks prohibitively expensive. Several environmental network projects have started using off-the-shelf low-cost microphone sensors to reduce their costs, but these sensors have higher failure rates and produce lower quality data. To offset this disadvantage, we developed a low-cost noise sensor that actively checks its condition and indirectly the integrity of the data it produces. The main design concept is to embed a 13 mm speaker in the noise sensor casing and, by regularly scheduling a frequency sweep, estimate the evolution of the microphone's frequency response over time. This paper presents our noise sensor's hardware and software design together with the results of a test deployment in a large-scale environmental network in Belgium. Our middle-range-value sensor (around €50) effectively detected all experienced malfunctions, in laboratory tests and outdoor deployments, with a few false positives. Future improvements could further lower the cost of our sensor below €10.

DHT-Based Detection of Node Clone in Wireless Sensor Networks

Science.gov (United States)

Li, Zhijun; Gong, Guang

Wireless sensor networks are vulnerable to the node clone attack because of low-cost, resource-constrained sensor nodes, and uncontrolled environments where they are left unattended. Several distributed protocols have been proposed for detecting clone. However, some protocols rely on an implicit assumption that every node is aware of all other nodes' existence; other protocols using an geographic hash table require that nodes know the general network deployment graph. Those assumptions hardly hold for many sensor networks. In this paper, we present a novel node clone detection protocol based on Distributed Hash Table (DHT). DHT provides good distributed properties and our protocol is practical for every kind of sensor networks. We analyze the protocol performance theoretically. Moreover, we implement our protocol in the OMNeT++ simulation framework. The extensive simulation results show that our protocol can detect clone efficiently and holds strong resistance against adversaries.

Classifying Sensors Depending on their IDs to Reduce Power Consumption in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Ayman Mohammd Brisha

2010-05-01

Full Text Available Wireless sensor networks produce a large amount of data that needs to be processed, delivered, and assessed according to the application objectives. Cluster-based is an effective architecture for data-gathering in wireless sensor networks. Clustering provides an effective way for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques, selecting cluster heads with more residual energy and rotating cluster heads periodically, in order to distribute the energy consumption among nodes in each cluster and extend the network lifetime. Clustering sensors are divided into groups, so that sensors will communicate information only to cluster heads and then the cluster heads will communicate the aggregated information to the processing center, and this may save energy. In this paper we show Two Relay Sensor Algorithm (TRSA, which divide wireless Sensor Network (WSN into unequaled clusters, showing that it can effectively save power for maximizing the life time of the network. Simulation results show that the proposed unequal clustering mechanism (TRSA balances the energy consumption among all sensor nodes and achieves an obvious improvement on the network lifetime.

Operation of remote mobile sensors for security of drinking water distribution systems.

Science.gov (United States)

Perelman, By Lina; Ostfeld, Avi

2013-09-01

The deployment of fixed online water quality sensors in water distribution systems has been recognized as one of the key components of contamination warning systems for securing public health. This study proposes to explore how the inclusion of mobile sensors for inline monitoring of various water quality parameters (e.g., residual chlorine, pH) can enhance water distribution system security. Mobile sensors equipped with sampling, sensing, data acquisition, wireless transmission and power generation systems are being designed, fabricated, and tested, and prototypes are expected to be released in the very near future. This study initiates the development of a theoretical framework for modeling mobile sensor movement in water distribution systems and integrating the sensory data collected from stationary and non-stationary sensor nodes to increase system security. The methodology is applied and demonstrated on two benchmark networks. Performance of different sensor network designs are compared for fixed and combined fixed and mobile sensor networks. Results indicate that complementing online sensor networks with inline monitoring can increase detection likelihood and decrease mean time to detection. Copyright © 2013 Elsevier Ltd. All rights reserved.

Distributed Water Pollution Source Localization with Mobile UV-Visible Spectrometer Probes in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Junjie Ma

2018-02-01

Full Text Available Pollution accidents that occur in surface waters, especially in drinking water source areas, greatly threaten the urban water supply system. During water pollution source localization, there are complicated pollutant spreading conditions and pollutant concentrations vary in a wide range. This paper provides a scalable total solution, investigating a distributed localization method in wireless sensor networks equipped with mobile ultraviolet-visible (UV-visible spectrometer probes. A wireless sensor network is defined for water quality monitoring, where unmanned surface vehicles and buoys serve as mobile and stationary nodes, respectively. Both types of nodes carry UV-visible spectrometer probes to acquire in-situ multiple water quality parameter measurements, in which a self-adaptive optical path mechanism is designed to flexibly adjust the measurement range. A novel distributed algorithm, called Dual-PSO, is proposed to search for the water pollution source, where one particle swarm optimization (PSO procedure computes the water quality multi-parameter measurements on each node, utilizing UV-visible absorption spectra, and another one finds the global solution of the pollution source position, regarding mobile nodes as particles. Besides, this algorithm uses entropy to dynamically recognize the most sensitive parameter during searching. Experimental results demonstrate that online multi-parameter monitoring of a drinking water source area with a wide dynamic range is achieved by this wireless sensor network and water pollution sources are localized efficiently with low-cost mobile node paths.

COMPARATIVE ANALYSIS OF LEACH AND HEEMPCP PROTOCOLS FOR WIRELESS SENSOR NETWORKS SYSTEM

OpenAIRE

Richa Asstt. Pro.Misha Thakur

2018-01-01

In this paper author aims at describing a wireless sensor network. wireless sensor network consisting of spatially distributed autonomous devices using sensor to monitor physical or environmental conditions. Wireless sensor network can be used in wide range of applications including environmental monitoring, habitat monitoring, various military applications, smart home technologiesand agriculture. Wireless sensor networks constitute one of promising application areas of the recently developed...

Sensor and ad-hoc networks theoretical and algorithmic aspects

CERN Document Server

Makki, S Kami; Pissinou, Niki; Makki, Shamila; Karimi, Masoumeh; Makki, Kia

2008-01-01

This book brings together leading researchers and developers in the field of wireless sensor networks to explain the special problems and challenges of the algorithmic aspects of sensor and ad-hoc networks. The book also fosters communication not only between the different sensor and ad-hoc communities, but also between those communities and the distributed systems and information systems communities. The topics addressed pertain to the sensors and mobile environment.

Estimation of Distribution Algorithm for Resource Allocation in Green Cooperative Cognitive Radio Sensor Networks

Directory of Open Access Journals (Sweden)

Alagan Anpalagan

2013-04-01

Full Text Available Due to the rapid increase in the usage and demand of wireless sensor networks (WSN, the limited frequency spectrum available for WSN applications will be extremely crowded in the near future. More sensor devices also mean more recharging/replacement of batteries, which will cause significant impact on the global carbon footprint. In this paper, we propose a relay-assisted cognitive radio sensor network (CRSN that allocates communication resources in an environmentally friendly manner. We use shared band amplify and forward relaying for cooperative communication in the proposed CRSN. We present a multi-objective optimization architecture for resource allocation in a green cooperative cognitive radio sensor network (GC-CRSN. The proposed multi-objective framework jointly performs relay assignment and power allocation in GC-CRSN, while optimizing two conflicting objectives. The first objective is to maximize the total throughput, and the second objective is to minimize the total transmission power of CRSN. The proposed relay assignment and power allocation problem is a non-convex mixed-integer non-linear optimization problem (NC-MINLP, which is generally non-deterministic polynomial-time (NP-hard. We introduce a hybrid heuristic algorithm for this problem. The hybrid heuristic includes an estimation-of-distribution algorithm (EDA for performing power allocation and iterative greedy schemes for constraint satisfaction and relay assignment. We analyze the throughput and power consumption tradeoff in GC-CRSN. A detailed analysis of the performance of the proposed algorithm is presented with the simulation results.

Distributed Sensor Network for meteorological observations and numerical weather Prediction Calculations

Directory of Open Access Journals (Sweden)

Á. Vas

2013-06-01

Full Text Available The prediction of weather generally means the solution of differential equations on the base of the measured initial conditions where the data of close and distant neighboring points are used for the calculations. It requires the maintenance of expensive weather stations and supercomputers. However, if weather stations are not only capable of measuring but can also communicate with each other, then these smart sensors can also be applied to run forecasting calculations. This applies the highest possible level of parallelization without the collection of measured data into one place. Furthermore, if more nodes are involved, the result becomes more accurate, but the computing power required from one node does not increase. Our Distributed Sensor Network for meteorological sensing and numerical weather Prediction Calculations (DSN-PC can be applied in several different areas where sensing and numerical calculations, even the solution of differential equations, are needed.

Improved control of distributed parameter systems using wireless sensor and actuator networks: An observer-based method

International Nuclear Information System (INIS)

Jiang Zheng-Xian; Cui Bao-Tong; Lou Xu-Yang; Zhuang Bo

2017-01-01

In this paper, the control problem of distributed parameter systems is investigated by using wireless sensor and actuator networks with the observer-based method. Firstly, a centralized observer which makes use of the measurement information provided by the fixed sensors is designed to estimate the distributed parameter systems. The mobile agents, each of which is affixed with a controller and an actuator, can provide the observer-based control for the target systems. By using Lyapunov stability arguments, the stability for the estimation error system and distributed parameter control system is proved, meanwhile a guidance scheme for each mobile actuator is provided to improve the control performance. A numerical example is finally used to demonstrate the effectiveness and the advantages of the proposed approaches. (paper)

Neural networks for sensor validation and plant-wide monitoring

International Nuclear Information System (INIS)

Eryurek, E.

1991-08-01

The feasibility of using neural networks to characterize one or more variables as a function of other than related variables has been studied. Neural network or parallel distributed processing is found to be highly suitable for the development of relationships among various parameters. A sensor failure detection is studied, and it is shown that neural network models can be used to estimate the sensor readings during the absence of a sensor. (author). 4 refs.; 3 figs

Sleep scheduling with expected common coverage in wireless sensor networks

OpenAIRE

Bulut, Eyuphan; Korpeoglu, Ibrahim

2011-01-01

Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor networks. This paper proposes a distributed and energy efficient sleep scheduling and routing scheme that can be used to extend the lifetime of a sensor network while maintaining a user defined coverage and connectivity. The scheme can activate and deactivate the three basic units of a sensor node (sensing, proces...

An Open Distributed Architecture for Sensor Networks for Risk Management

Directory of Open Access Journals (Sweden)

Ralf Denzer

2008-03-01

Infrastructure forRisk Management’ (ORCHESTRA, http://www.eu-orchestra.org/ and ‘Sensors Anywhere’(SANY, http://sany-ip.eu/ are discussed in this article. These projects have developed anopen distributed information technology architecture and have implemented web servicesfor the accessing and using data emanating, for example, from sensor networks. Thesedevelopments are based on existing data and service standards proposed by internationalorganizations. The projects seek to develop the ideals of the EC directive INSPIRE(http://inspire.jrc.it, which was launched in 2001 and whose implementation began this year(2007, into the risk management domain. Thanks to the open nature of the architecture andservices being developed within these projects, they can be implemented by any interestedparty and can be accessed by all potential users. The architecture is based around a serviceorientedapproach that makes use of Internet-based applications (web services whose inputsand outputs conform to standards. The benefit of this philosophy is that it is expected tofavor the emergence of an operational market for risk management services in Europe, iteliminates the need to replace or radically alter the hundreds of already operational ITsystems in Europe (drastically lowering costs for users, and it allows users and stakeholdersto achieve interoperability while using the system most adequate to their needs, budgets,culture etc. (i.e. it has flexibility.

Distributed k-Means Algorithm and Fuzzy c-Means Algorithm for Sensor Networks Based on Multiagent Consensus Theory.

Science.gov (United States)

Qin, Jiahu; Fu, Weiming; Gao, Huijun; Zheng, Wei Xing

2016-03-03

This paper is concerned with developing a distributed k-means algorithm and a distributed fuzzy c-means algorithm for wireless sensor networks (WSNs) where each node is equipped with sensors. The underlying topology of the WSN is supposed to be strongly connected. The consensus algorithm in multiagent consensus theory is utilized to exchange the measurement information of the sensors in WSN. To obtain a faster convergence speed as well as a higher possibility of having the global optimum, a distributed k-means++ algorithm is first proposed to find the initial centroids before executing the distributed k-means algorithm and the distributed fuzzy c-means algorithm. The proposed distributed k-means algorithm is capable of partitioning the data observed by the nodes into measure-dependent groups which have small in-group and large out-group distances, while the proposed distributed fuzzy c-means algorithm is capable of partitioning the data observed by the nodes into different measure-dependent groups with degrees of membership values ranging from 0 to 1. Simulation results show that the proposed distributed algorithms can achieve almost the same results as that given by the centralized clustering algorithms.

Intelligent sensor networks the integration of sensor networks, signal processing and machine learning

CERN Document Server

Hu, Fei

2012-01-01

Although governments worldwide have invested significantly in intelligent sensor network research and applications, few books cover intelligent sensor networks from a machine learning and signal processing perspective. Filling this void, Intelligent Sensor Networks: The Integration of Sensor Networks, Signal Processing and Machine Learning focuses on the close integration of sensing, networking, and smart signal processing via machine learning. Based on the world-class research of award-winning authors, the book provides a firm grounding in the fundamentals of intelligent sensor networks, incl

Cooperative Target Tracking in a Distributed Autonomous Sensor Network

National Research Council Canada - National Science Library

Eickstedt, Donald P; Benjamin, Michael R

2006-01-01

... network. This framework has two major components, an intelligent sensor that provides highlevel state information to a behavior-based autonomous vehicle control system and a new approach to behavior-based...

Secure Distributed Detection under Energy Constraint in IoT-Oriented Sensor Networks

Directory of Open Access Journals (Sweden)

Guomei Zhang

2016-12-01

Full Text Available We study the secure distributed detection problems under energy constraint for IoT-oriented sensor networks. The conventional channel-aware encryption (CAE is an efficient physical-layer secure distributed detection scheme in light of its energy efficiency, good scalability and robustness over diverse eavesdropping scenarios. However, in the CAE scheme, it remains an open problem of how to optimize the key thresholds for the estimated channel gain, which are used to determine the sensor’s reporting action. Moreover, the CAE scheme does not jointly consider the accuracy of local detection results in determining whether to stay dormant for a sensor. To solve these problems, we first analyze the error probability and derive the optimal thresholds in the CAE scheme under a specified energy constraint. These results build a convenient mathematic framework for our further innovative design. Under this framework, we propose a hybrid secure distributed detection scheme. Our proposal can satisfy the energy constraint by keeping some sensors inactive according to the local detection confidence level, which is characterized by likelihood ratio. In the meanwhile, the security is guaranteed through randomly flipping the local decisions forwarded to the fusion center based on the channel amplitude. We further optimize the key parameters of our hybrid scheme, including two local decision thresholds and one channel comparison threshold. Performance evaluation results demonstrate that our hybrid scheme outperforms the CAE under stringent energy constraints, especially in the high signal-to-noise ratio scenario, while the security is still assured.

The resilient hybrid fiber sensor network with self-healing function

Energy Technology Data Exchange (ETDEWEB)

Xu, Shibo, E-mail: Shibo-Xu@tju.edu.cn; Liu, Tiegen; Ge, Chunfeng; Chen, Qinnan; Zhang, Hongxia [College of Precision Instrument and Opto-electronics Engineering, Tianjin University, Tianjin 300072 (China); Key Laboratory of Opto-electronics Information Technology (Tianjin University), Ministry of Education, Tianjin 300072 (China)

2015-03-15

This paper presents a novel resilient fiber sensor network (FSN) with multi-ring architecture, which could interconnect various kinds of fiber sensors responsible for more than one measurands. We explain how the intelligent control system provides sensors with self-healing function meanwhile sensors are working properly, besides each fiber in FSN is under real-time monitoring. We explain the software process and emergency mechanism to respond failures or other circumstances. To improve the efficiency in the use of limited spectrum resources in some situations, we have two different structures to distribute the light sources rationally. Then, we propose a hybrid sensor working in FSN which is a combination of a distributed sensor and a FBG (Fiber Bragg Grating) array fused in a common fiber sensing temperature and vibrations simultaneously with neglectable crosstalk to each other. By making a failure to a working fiber in experiment, the feasibility and effectiveness of the network with a hybrid sensor has been demonstrated, hybrid sensors could not only work as designed but also survive from destructive failures with the help of resilient network and smart and quick self-healing actions. The network has improved the viability of the fiber sensors and diversity of measurands.

The resilient hybrid fiber sensor network with self-healing function

Science.gov (United States)

Xu, Shibo; Liu, Tiegen; Ge, Chunfeng; Chen, Qinnan; Zhang, Hongxia

2015-03-01

This paper presents a novel resilient fiber sensor network (FSN) with multi-ring architecture, which could interconnect various kinds of fiber sensors responsible for more than one measurands. We explain how the intelligent control system provides sensors with self-healing function meanwhile sensors are working properly, besides each fiber in FSN is under real-time monitoring. We explain the software process and emergency mechanism to respond failures or other circumstances. To improve the efficiency in the use of limited spectrum resources in some situations, we have two different structures to distribute the light sources rationally. Then, we propose a hybrid sensor working in FSN which is a combination of a distributed sensor and a FBG (Fiber Bragg Grating) array fused in a common fiber sensing temperature and vibrations simultaneously with neglectable crosstalk to each other. By making a failure to a working fiber in experiment, the feasibility and effectiveness of the network with a hybrid sensor has been demonstrated, hybrid sensors could not only work as designed but also survive from destructive failures with the help of resilient network and smart and quick self-healing actions. The network has improved the viability of the fiber sensors and diversity of measurands.

The resilient hybrid fiber sensor network with self-healing function

International Nuclear Information System (INIS)

Xu, Shibo; Liu, Tiegen; Ge, Chunfeng; Chen, Qinnan; Zhang, Hongxia

2015-01-01

This paper presents a novel resilient fiber sensor network (FSN) with multi-ring architecture, which could interconnect various kinds of fiber sensors responsible for more than one measurands. We explain how the intelligent control system provides sensors with self-healing function meanwhile sensors are working properly, besides each fiber in FSN is under real-time monitoring. We explain the software process and emergency mechanism to respond failures or other circumstances. To improve the efficiency in the use of limited spectrum resources in some situations, we have two different structures to distribute the light sources rationally. Then, we propose a hybrid sensor working in FSN which is a combination of a distributed sensor and a FBG (Fiber Bragg Grating) array fused in a common fiber sensing temperature and vibrations simultaneously with neglectable crosstalk to each other. By making a failure to a working fiber in experiment, the feasibility and effectiveness of the network with a hybrid sensor has been demonstrated, hybrid sensors could not only work as designed but also survive from destructive failures with the help of resilient network and smart and quick self-healing actions. The network has improved the viability of the fiber sensors and diversity of measurands

Energy-Efficient Distributed Filtering in Sensor Networks: A Unified Switched System Approach.

Science.gov (United States)

Zhang, Dan; Shi, Peng; Zhang, Wen-An; Yu, Li

2016-04-21

This paper is concerned with the energy-efficient distributed filtering in sensor networks, and a unified switched system approach is proposed to achieve this goal. For the system under study, the measurement is first sampled under nonuniform sampling periods, then the local measurement elements are selected and quantized for transmission. Then, the transmission rate is further reduced to save constrained power in sensors. Based on the switched system approach, a unified model is presented to capture the nonuniform sampling, the measurement size reduction, the transmission rate reduction, the signal quantization, and the measurement missing phenomena. Sufficient conditions are obtained such that the filtering error system is exponentially stable in the mean-square sense with a prescribed H∞ performance level. Both simulation and experiment studies are given to show the effectiveness of the proposed new design technique.

Mobile Sensor Networks for Inspection Tasks in Harsh Industrial Environments

NARCIS (Netherlands)

Mulder, Jacob; Wang, Xinyu; Ferwerda, Franke; Cao, Ming

Recent advances in sensor technology have enabled the fast development of mobile sensor networks operating in various unknown and sometimes hazardous environments. In this paper, we introduce one integrative approach to design, analyze and test distributed control algorithms to coordinate a network

Node-to-node field calibration of wireless distributed air pollution sensor network.

Science.gov (United States)

Kizel, Fadi; Etzion, Yael; Shafran-Nathan, Rakefet; Levy, Ilan; Fishbain, Barak; Bartonova, Alena; Broday, David M

2018-02-01

Low-cost air quality sensors offer high-resolution spatiotemporal measurements that can be used for air resources management and exposure estimation. Yet, such sensors require frequent calibration to provide reliable data, since even after a laboratory calibration they might not report correct values when they are deployed in the field, due to interference with other pollutants, as a result of sensitivity to environmental conditions and due to sensor aging and drift. Field calibration has been suggested as a means for overcoming these limitations, with the common strategy involving periodical collocations of the sensors at an air quality monitoring station. However, the cost and complexity involved in relocating numerous sensor nodes back and forth, and the loss of data during the repeated calibration periods make this strategy inefficient. This work examines an alternative approach, a node-to-node (N2N) calibration, where only one sensor in each chain is directly calibrated against the reference measurements and the rest of the sensors are calibrated sequentially one against the other while they are deployed and collocated in pairs. The calibration can be performed multiple times as a routine procedure. This procedure minimizes the total number of sensor relocations, and enables calibration while simultaneously collecting data at the deployment sites. We studied N2N chain calibration and the propagation of the calibration error analytically, computationally and experimentally. The in-situ N2N calibration is shown to be generic and applicable for different pollutants, sensing technologies, sensor platforms, chain lengths, and sensor order within the chain. In particular, we show that chain calibration of three nodes, each calibrated for a week, propagate calibration errors that are similar to those found in direct field calibration. Hence, N2N calibration is shown to be suitable for calibration of distributed sensor networks. Copyright © 2017 Elsevier Ltd. All

CMOS: efficient clustered data monitoring in sensor networks.

Science.gov (United States)

Min, Jun-Ki

2013-01-01

Tiny and smart sensors enable applications that access a network of hundreds or thousands of sensors. Thus, recently, many researchers have paid attention to wireless sensor networks (WSNs). The limitation of energy is critical since most sensors are battery-powered and it is very difficult to replace batteries in cases that sensor networks are utilized outdoors. Data transmission between sensor nodes needs more energy than computation in a sensor node. In order to reduce the energy consumption of sensors, we present an approximate data gathering technique, called CMOS, based on the Kalman filter. The goal of CMOS is to efficiently obtain the sensor readings within a certain error bound. In our approach, spatially close sensors are grouped as a cluster. Since a cluster header generates approximate readings of member nodes, a user query can be answered efficiently using the cluster headers. In addition, we suggest an energy efficient clustering method to distribute the energy consumption of cluster headers. Our simulation results with synthetic data demonstrate the efficiency and accuracy of our proposed technique.

EYES -- Energy Efficient Sensor Networks

NARCIS (Netherlands)

Havinga, Paul J.M.; Etalle, Sandro; Karl, Holger; Petrioli, Chiara; Zorzi, Michele; Kip, Harry; Lentsch, Thomas; Conti, M.; Giordano, S.; Gregori, E.; Olariu, S.

The EYES project (IST-2001-34734) is a three years European research project on self-organizing and collaborative energy-efficient sensor networks. It will address the convergence of distributed information processing, wireless communications, and mobile computing. The goal of the project is to

Self-Recovering Sensor-Actor Networks

Directory of Open Access Journals (Sweden)

Maryam Kamali

2010-07-01

Full Text Available Wireless sensor-actor networks are a recent development of wireless networks where both ordinary sensor nodes and more sophisticated and powerful nodes, called actors, are present. In this paper we formalize a recently introduced algorithm that recovers failed actor communication links via the existing sensor infrastructure. We prove via refinement that the recovery is terminating in a finite number of steps and is distributed, thus self-performed by the actors. Most importantly, we prove that the recovery can be done at different levels, via different types of links, such as direct actor links or indirect links between the actors, in the latter case reusing the wireless infrastructure of sensors. This leads to identifying coordination classes, e.g., for delegating the most security sensitive coordination to the direct actor-actor coordination links, the least real-time constrained coordination to indirect links, and the safety critical coordination to both direct actor links and indirect sensor paths between actors. Our formalization is done using the theorem prover in the RODIN platform.

Ninth International Conference on Wireless Communication and Sensor Networks

CERN Document Server

Tiwari, Murlidhar; Arora, Anish

2014-01-01

Wireless communication and sensor networks would form the backbone to create pervasive and ubiquitous environments that would have profound influence on the society and thus are important to the society. The wireless communication technologies and wireless sensor networks would encompass a wide range of domains such as HW devices such as motes, sensors and associated instrumentation, actuators, transmitters, receivers, antennas, etc., sensor network aspects such as topologies, routing algorithms, integration of heterogeneous network elements and topologies, designing RF devices and systems for energy efficiency and reliability etc. These sensor networks would provide opportunity to continuously and in a distributed manner monitor the environment and generate the necessary warnings and actions. However most of the developments have been demonstrated only in controlled and laboratory environments. So we are yet to see those powerful, ubiquitous applications for the benefit of the society. The conference and con...

Dynamic Session-Key Generation for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Chen Chin-Ling

2008-01-01

Full Text Available Abstract Recently, wireless sensor networks have been used extensively in different domains. For example, if the wireless sensor node of a wireless sensor network is distributed in an insecure area, a secret key must be used to protect the transmission between the sensor nodes. Most of the existing methods consist of preselecting keys from a key pool and forming a key chain. Then, the sensor nodes make use of the key chain to encrypt the data. However, while the secret key is being transmitted, it can easily be exposed during transmission. We propose a dynamic key management protocol, which can improve the security of the key juxtaposed to existing methods. Additionally, the dynamic update of the key can lower the probability of the key to being guessed correctly. In addition, with the new protocol, attacks on the wireless sensor network can be avoided.

Dynamic Session-Key Generation for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Cheng-Ta Li

2008-09-01

Full Text Available Recently, wireless sensor networks have been used extensively in different domains. For example, if the wireless sensor node of a wireless sensor network is distributed in an insecure area, a secret key must be used to protect the transmission between the sensor nodes. Most of the existing methods consist of preselecting m keys from a key pool and forming a key chain. Then, the sensor nodes make use of the key chain to encrypt the data. However, while the secret key is being transmitted, it can easily be exposed during transmission. We propose a dynamic key management protocol, which can improve the security of the key juxtaposed to existing methods. Additionally, the dynamic update of the key can lower the probability of the key to being guessed correctly. In addition, with the new protocol, attacks on the wireless sensor network can be avoided.

A self-optimizing scheme for energy balanced routing in Wireless Sensor Networks using SensorAnt.

Science.gov (United States)

Shamsan Saleh, Ahmed M; Ali, Borhanuddin Mohd; Rasid, Mohd Fadlee A; Ismail, Alyani

2012-01-01

Planning of energy-efficient protocols is critical for Wireless Sensor Networks (WSNs) because of the constraints on the sensor nodes' energy. The routing protocol should be able to provide uniform power dissipation during transmission to the sink node. In this paper, we present a self-optimization scheme for WSNs which is able to utilize and optimize the sensor nodes' resources, especially the batteries, to achieve balanced energy consumption across all sensor nodes. This method is based on the Ant Colony Optimization (ACO) metaheuristic which is adopted to enhance the paths with the best quality function. The assessment of this function depends on multi-criteria metrics such as the minimum residual battery power, hop count and average energy of both route and network. This method also distributes the traffic load of sensor nodes throughout the WSN leading to reduced energy usage, extended network life time and reduced packet loss. Simulation results show that our scheme performs much better than the Energy Efficient Ant-Based Routing (EEABR) in terms of energy consumption, balancing and efficiency.

A convergent model for distributed processing of Big Sensor Data in urban engineering networks

Science.gov (United States)

Parygin, D. S.; Finogeev, A. G.; Kamaev, V. A.; Finogeev, A. A.; Gnedkova, E. P.; Tyukov, A. P.

2017-01-01

The problems of development and research of a convergent model of the grid, cloud, fog and mobile computing for analytical Big Sensor Data processing are reviewed. The model is meant to create monitoring systems of spatially distributed objects of urban engineering networks and processes. The proposed approach is the convergence model of the distributed data processing organization. The fog computing model is used for the processing and aggregation of sensor data at the network nodes and/or industrial controllers. The program agents are loaded to perform computing tasks for the primary processing and data aggregation. The grid and the cloud computing models are used for integral indicators mining and accumulating. A computing cluster has a three-tier architecture, which includes the main server at the first level, a cluster of SCADA system servers at the second level, a lot of GPU video cards with the support for the Compute Unified Device Architecture at the third level. The mobile computing model is applied to visualize the results of intellectual analysis with the elements of augmented reality and geo-information technologies. The integrated indicators are transferred to the data center for accumulation in a multidimensional storage for the purpose of data mining and knowledge gaining.

A Sentinel Sensor Network for Hydrogen Sensing

Directory of Open Access Journals (Sweden)

Andrew J. Mason

2003-02-01

Full Text Available A wireless sensor network is presented for in-situ monitoring of atmospheric hydrogen concentration. The hydrogen sensor network consists of multiple sensor nodes, equipped with titania nanotube hydrogen sensors, distributed throughout the area of interest; each node is both sensor, and data-relay station that enables extended wide area monitoring without a consequent increase of node power and thus node size. The hydrogen sensor is fabricated from a sheet of highly ordered titania nanotubes, made by anodization of a titanium thick film, to which platinum electrodes are connected. The electrical resistance of the hydrogen sensor varies from 245 Ω at 500 ppm hydrogen, to 10.23 kΩ at 0 ppm hydrogen (pure nitrogen environment. The measured resistance is converted to voltage, 0.049 V at 500 ppm to 2.046 V at 0 ppm, by interface circuitry. The microcontroller of the sensor node digitizes the voltage and transmits the digital information, using intermediate nodes as relays, to a host node that downloads measurement data to a computer for display. This paper describes the design and operation of the sensor network, the titania nanotube hydrogen sensors with an apparent low level resolution of approximately 0.05 ppm, and their integration in one widely useful device.

Lifetime Maximizing Adaptive Power Control in Wireless Sensor Networks

National Research Council Canada - National Science Library

Sun, Fangting; Shayman, Mark

2006-01-01

...: adaptive power control. They focus on the sensor networks that consist of a sink and a set of homogeneous wireless sensor nodes, which are randomly deployed according to a uniform distribution...

Distributed Event-Based Set-Membership Filtering for a Class of Nonlinear Systems With Sensor Saturations Over Sensor Networks.

Science.gov (United States)

Ma, Lifeng; Wang, Zidong; Lam, Hak-Keung; Kyriakoulis, Nikos

2017-11-01

In this paper, the distributed set-membership filtering problem is investigated for a class of discrete time-varying system with an event-based communication mechanism over sensor networks. The system under consideration is subject to sector-bounded nonlinearity, unknown but bounded noises and sensor saturations. Each intelligent sensing node transmits the data to its neighbors only when certain triggering condition is violated. By means of a set of recursive matrix inequalities, sufficient conditions are derived for the existence of the desired distributed event-based filter which is capable of confining the system state in certain ellipsoidal regions centered at the estimates. Within the established theoretical framework, two additional optimization problems are formulated: one is to seek the minimal ellipsoids (in the sense of matrix trace) for the best filtering performance, and the other is to maximize the triggering threshold so as to reduce the triggering frequency with satisfactory filtering performance. A numerically attractive chaos algorithm is employed to solve the optimization problems. Finally, an illustrative example is presented to demonstrate the effectiveness and applicability of the proposed algorithm.

Data aggregation in wireless sensor networks using the SOAP protocol

International Nuclear Information System (INIS)

Al-Yasiri, A; Sunley, A

2007-01-01

Wireless sensor networks (WSN) offer an increasingly attractive method of data gathering in distributed system architectures and dynamic access via wireless connectivity. Wireless sensor networks have physical and resource limitations, this leads to increased complexity for application developers and often results in applications that are closely coupled with network protocols. In this paper, a data aggregation framework using SOAP (Simple Object Access Protocol) on wireless sensor networks is presented. The framework works as a middleware for aggregating data measured by a number of nodes within a network. The aim of the study is to assess the suitability of the protocol in such environments where resources are limited compared to traditional networks

Data aggregation in wireless sensor networks using the SOAP protocol

Energy Technology Data Exchange (ETDEWEB)

Al-Yasiri, A; Sunley, A [School of Computing, Science and Engineering, University of Salford, Greater Manchester, M5 4WT (United Kingdom)

2007-07-15

Wireless sensor networks (WSN) offer an increasingly attractive method of data gathering in distributed system architectures and dynamic access via wireless connectivity. Wireless sensor networks have physical and resource limitations, this leads to increased complexity for application developers and often results in applications that are closely coupled with network protocols. In this paper, a data aggregation framework using SOAP (Simple Object Access Protocol) on wireless sensor networks is presented. The framework works as a middleware for aggregating data measured by a number of nodes within a network. The aim of the study is to assess the suitability of the protocol in such environments where resources are limited compared to traditional networks.

Wireless Distributed Environmental Sensor Networks for Air Pollution Measurement-The Promise and the Current Reality.

Science.gov (United States)

Broday, David M

2017-10-02

The evaluation of the effects of air pollution on public health and human-wellbeing requires reliable data. Standard air quality monitoring stations provide accurate measurements of airborne pollutant levels, but, due to their sparse distribution, they cannot capture accurately the spatial variability of air pollutant concentrations within cities. Dedicated in-depth field campaigns have dense spatial coverage of the measurements but are held for relatively short time periods. Hence, their representativeness is limited. Moreover, the oftentimes integrated measurements represent time-averaged records. Recent advances in communication and sensor technologies enable the deployment of dense grids of Wireless Distributed Environmental Sensor Networks for air quality monitoring, yet their capability to capture urban-scale spatiotemporal pollutant patterns has not been thoroughly examined to date. Here, we summarize our studies on the practicalities of using data streams from sensor nodes for air quality measurement and the required methods to tune the results to different stakeholders and applications. We summarize the results from eight cities across Europe, five sensor technologies-three stationary (with one tested also while moving) and two personal sensor platforms, and eight ambient pollutants. Overall, few sensors showed an exceptional and consistent performance, which can shed light on the fine spatiotemporal urban variability of pollutant concentrations. Stationary sensor nodes were more reliable than personal nodes. In general, the sensor measurements tend to suffer from the interference of various environmental factors and require frequent calibrations. This calls for the development of suitable field calibration procedures, and several such in situ field calibrations are presented.

Weighted Optimization-Based Distributed Kalman Filter for Nonlinear Target Tracking in Collaborative Sensor Networks.

Science.gov (United States)

Chen, Jie; Li, Jiahong; Yang, Shuanghua; Deng, Fang

2017-11-01

The identification of the nonlinearity and coupling is crucial in nonlinear target tracking problem in collaborative sensor networks. According to the adaptive Kalman filtering (KF) method, the nonlinearity and coupling can be regarded as the model noise covariance, and estimated by minimizing the innovation or residual errors of the states. However, the method requires large time window of data to achieve reliable covariance measurement, making it impractical for nonlinear systems which are rapidly changing. To deal with the problem, a weighted optimization-based distributed KF algorithm (WODKF) is proposed in this paper. The algorithm enlarges the data size of each sensor by the received measurements and state estimates from its connected sensors instead of the time window. A new cost function is set as the weighted sum of the bias and oscillation of the state to estimate the "best" estimate of the model noise covariance. The bias and oscillation of the state of each sensor are estimated by polynomial fitting a time window of state estimates and measurements of the sensor and its neighbors weighted by the measurement noise covariance. The best estimate of the model noise covariance is computed by minimizing the weighted cost function using the exhaustive method. The sensor selection method is in addition to the algorithm to decrease the computation load of the filter and increase the scalability of the sensor network. The existence, suboptimality and stability analysis of the algorithm are given. The local probability data association method is used in the proposed algorithm for the multitarget tracking case. The algorithm is demonstrated in simulations on tracking examples for a random signal, one nonlinear target, and four nonlinear targets. Results show the feasibility and superiority of WODKF against other filtering algorithms for a large class of systems.

A Mobile Sensor Network System for Monitoring of Unfriendly Environments.

Science.gov (United States)

Song, Guangming; Zhou, Yaoxin; Ding, Fei; Song, Aiguo

2008-11-14

Observing microclimate changes is one of the most popular applications of wireless sensor networks. However, some target environments are often too dangerous or inaccessible to humans or large robots and there are many challenges for deploying and maintaining wireless sensor networks in those unfriendly environments. This paper presents a mobile sensor network system for solving this problem. The system architecture, the mobile node design, the basic behaviors and advanced network capabilities have been investigated respectively. A wheel-based robotic node architecture is proposed here that can add controlled mobility to wireless sensor networks. A testbed including some prototype nodes has also been created for validating the basic functions of the proposed mobile sensor network system. Motion performance tests have been done to get the positioning errors and power consumption model of the mobile nodes. Results of the autonomous deployment experiment show that the mobile nodes can be distributed evenly into the previously unknown environments. It provides powerful support for network deployment and maintenance and can ensure that the sensor network will work properly in unfriendly environments.

Experiences with Implementing a Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Gathering on a Real-Life Sensor Network Platform

NARCIS (Netherlands)

Zhang, Y.; Chatterjea, Supriyo; Havinga, Paul J.M.

2007-01-01

We report our experiences with implementing a distributed and self-organizing scheduling algorithm designed for energy-efficient data gathering on a 25-node multihop wireless sensor network (WSN). The algorithm takes advantage of spatial correlations that exist in readings of adjacent sensor nodes

Distributed Classification of Localization Attacks in Sensor Networks Using Exchange-Based Feature Extraction and Classifier

Directory of Open Access Journals (Sweden)

Su-Zhe Wang

2016-01-01

Full Text Available Secure localization under different forms of attack has become an essential task in wireless sensor networks. Despite the significant research efforts in detecting the malicious nodes, the problem of localization attack type recognition has not yet been well addressed. Motivated by this concern, we propose a novel exchange-based attack classification algorithm. This is achieved by a distributed expectation maximization extractor integrated with the PECPR-MKSVM classifier. First, the mixed distribution features based on the probabilistic modeling are extracted using a distributed expectation maximization algorithm. After feature extraction, by introducing the theory from support vector machine, an extensive contractive Peaceman-Rachford splitting method is derived to build the distributed classifier that diffuses the iteration calculation among neighbor sensors. To verify the efficiency of the distributed recognition scheme, four groups of experiments were carried out under various conditions. The average success rate of the proposed classification algorithm obtained in the presented experiments for external attacks is excellent and has achieved about 93.9% in some cases. These testing results demonstrate that the proposed algorithm can produce much greater recognition rate, and it can be also more robust and efficient even in the presence of excessive malicious scenario.

Multi-objective ant algorithm for wireless sensor network positioning

International Nuclear Information System (INIS)

Fidanova, S.; Shindarov, M.; Marinov, P.

2013-01-01

It is impossible to imagine our modern life without telecommunications. Wireless networks are a part of telecommunications. Wireless sensor networks (WSN) consist of spatially distributed sensors, which communicate in wireless way. This network monitors physical or environmental conditions. The objective is the full coverage of the monitoring region and less energy consumption of the network. The most appropriate approach to solve the problem is metaheuristics. In this paper the full coverage of the area is treated as a constrain. The objectives which are optimized are a minimal number of sensors and energy (lifetime) of the network. We apply multi-objective Ant Colony Optimization to solve this important telecommunication problem. We chose MAX-MIN Ant System approach, because it is proven to converge to the global optima

Energy-efficient Organization of Wireless Sensor Networks with Adaptive Forecasting

Directory of Open Access Journals (Sweden)

Dao-Wei Bi

2008-04-01

Full Text Available Due to the wide potential applications of wireless sensor networks, this topic has attracted great attention. The strict energy constraints of sensor nodes result in great challenges for energy efficiency. This paper proposes an energy-efficient organization method. The organization of wireless sensor networks is formulated for target tracking. Target localization is achieved by collaborative sensing with multi-sensor fusion. The historical localization results are utilized for adaptive target trajectory forecasting. Combining autoregressive moving average (ARMA model and radial basis function networks (RBFNs, robust target position forecasting is performed. Moreover, an energyefficient organization method is presented to enhance the energy efficiency of wireless sensor networks. The sensor nodes implement sensing tasks are awakened in a distributed manner. When the sensor nodes transfer their observations to achieve data fusion, the routing scheme is obtained by ant colony optimization. Thus, both the operation and communication energy consumption can be minimized. Experimental results verify that the combination of ARMA model and RBFN can estimate the target position efficiently and energy saving is achieved by the proposed organization method in wireless sensor networks.

Reactive and adaptive monitoring to secure aggregation in wireless sensor networks

NARCIS (Netherlands)

Labraoui, Nabila; Gueroui, Mourad; Aliouat, Makhlouf; Petit, Jonathan

Data aggregation is considered as one of the fundamental distributed data processing procedures for saving the energy and minimizing the medium access layer contention in wireless sensor networks. However, sensor networks are likely to be deployed in an untrusted environment, which make them

Efficient Key Generation and Distribution on Wireless Sensor Networks

OpenAIRE

Ariño Pérez, Víctor

2013-01-01

Projecte realitzat en el marc d’un programa de mobilitat amb la KTH Electrical Engineering [ANGLÈS] Wireless Sensor Networks have become popular during the last years. The introduction of IPv6 which broadened the address space available, IEEE802.15.4 and adaptation layers such as 6loWPAN have allowed the intercommunication of small devices. These networks are useful in many scenarios such as civil monitoring, mining, battlefield operations, as well as consumer products. Hence, practical se...

Energy-Efficient Querying of Wireless Sensor Networks

National Research Council Canada - National Science Library

Mann, Christopher R

2007-01-01

Due to the distributed nature of information collection in wireless sensor networks and the inherent limitations of the component devices, the ability to store, locate, and retrieve data and services...

Network-Capable Application Process and Wireless Intelligent Sensors for ISHM

Science.gov (United States)

Figueroa, Fernando; Morris, Jon; Turowski, Mark; Wang, Ray

2011-01-01

Intelligent sensor technology and systems are increasingly becoming attractive means to serve as frameworks for intelligent rocket test facilities with embedded intelligent sensor elements, distributed data acquisition elements, and onboard data acquisition elements. Networked intelligent processors enable users and systems integrators to automatically configure their measurement automation systems for analog sensors. NASA and leading sensor vendors are working together to apply the IEEE 1451 standard for adding plug-and-play capabilities for wireless analog transducers through the use of a Transducer Electronic Data Sheet (TEDS) in order to simplify sensor setup, use, and maintenance, to automatically obtain calibration data, and to eliminate manual data entry and error. A TEDS contains the critical information needed by an instrument or measurement system to identify, characterize, interface, and properly use the signal from an analog sensor. A TEDS is deployed for a sensor in one of two ways. First, the TEDS can reside in embedded, nonvolatile memory (typically flash memory) within the intelligent processor. Second, a virtual TEDS can exist as a separate file, downloadable from the Internet. This concept of virtual TEDS extends the benefits of the standardized TEDS to legacy sensors and applications where the embedded memory is not available. An HTML-based user interface provides a visual tool to interface with those distributed sensors that a TEDS is associated with, to automate the sensor management process. Implementing and deploying the IEEE 1451.1-based Network-Capable Application Process (NCAP) can achieve support for intelligent process in Integrated Systems Health Management (ISHM) for the purpose of monitoring, detection of anomalies, diagnosis of causes of anomalies, prediction of future anomalies, mitigation to maintain operability, and integrated awareness of system health by the operator. It can also support local data collection and storage. This

Querying on Federated Sensor Networks

Directory of Open Access Journals (Sweden)

Zuhal Can

2016-09-01

Full Text Available A Federated Sensor Network (FSN is a network of geographically distributed Wireless Sensor Networks (WSNs called islands. For querying on an FSN, we introduce the Layered Federated Sensor Network (L-FSN Protocol. For layered management, L-FSN provides communication among islands by its inter-island querying protocol by which a query packet routing path is determined according to some path selection policies. L-FSN allows autonomous management of each island by island-specific intra-island querying protocols that can be selected according to island properties. We evaluate the applicability of L-FSN and compare the L-FSN protocol with various querying protocols running on the flat federation model. Flat federation is a method to federate islands by running a single querying protocol on an entire FSN without distinguishing communication among and within islands. For flat federation, we select a querying protocol from geometrical, hierarchical cluster-based, hash-based, and tree-based WSN querying protocol categories. We found that a layered federation of islands by L-FSN increases the querying performance with respect to energy-efficiency, query resolving distance, and query resolving latency. Moreover, L-FSN’s flexibility of choosing intra-island querying protocols regarding the island size brings advantages on energy-efficiency and query resolving latency.

Wireless sensor network adaptive cooling

Energy Technology Data Exchange (ETDEWEB)

Mitchell, T. [SynapSense Corp., Folsom, CA (United States)

2009-07-01

Options for reducing data centre cooling energy requirements and their cost savings were discussed with particular reference to a wireless control solution developed by SynapSense Corporation. The wireless sensor network reduces cooling energy use at data centres by providing improved air flow management through the installation of cold aisle containment. The use of this low cost, non-invasive wireless sensor network has reduced the cooling energy use in a data center at BC Hydro by 30 per cent. The system also reduced the server and storage fan energy by 3 per cent by maintaining inlet air temperature below ASHRAE recommended operating range. The distribution of low power, low cost wireless sensors has enabled visualization tools that are changing the way that data centres are managed. The annual savings have been estimated at 4,560,000 kWh and the annual carbon dioxide abatement is approximately 1,400 metric tons. tabs., figs.

Sensor Fusion-based Event Detection in Wireless Sensor Networks

NARCIS (Netherlands)

Bahrepour, M.; Meratnia, Nirvana; Havinga, Paul J.M.

2009-01-01

Recently, Wireless Sensor Networks (WSN) community has witnessed an application focus shift. Although, monitoring was the initial application of wireless sensor networks, in-network data processing and (near) real-time actuation capability have made wireless sensor networks suitable candidate for

Wireless sensor communications and internet connectivity for sensor networks

Energy Technology Data Exchange (ETDEWEB)

Dunbar, M. [Crossbow Technology, Inc., San Jose, CA (United States)

2001-07-01

A wireless sensor network architecture is an integrated hardware/software solution that has the potential to change the way sensors are used in a virtually unlimited range of industries and applications. By leveraging Bluetooth wireless technology for low-cost, short-range radio links, wireless sensor networks such as CrossNet{sup TM} enable users to create wireless sensor networks. These wireless networks can link dozens or hundreds of sensors of disparate types and brands with data acquisition/analysis systems, such as handheld devices, internet-enabled laptop or desktop PCs. The overwhelming majority of sensor applications are hard-wired at present, and since wiring is often the most time-consuming, tedious, trouble-prone and expensive aspect of sensor applications, users in many fields will find compelling reasons to adopt the wireless sensor network solution. (orig.)

Towards Self-Powered Wireless Sensor Networks

OpenAIRE

SPENZA, DORA

2013-01-01

Ubiquitous computing aims at creating smart environments in which computational and communication capabilities permeate the word at all scales, improving the human experience and quality of life in a totally unobtrusive yet completely reliable manner. According to this vision, an huge variety of smart devices and products (e.g., wireless sensor nodes, mobile phones, cameras, sensors, home appliances and industrial machines) are interconnected to realize a network of distributed agents that co...

Malfunctions in radioactivity sensors' networks

Science.gov (United States)

Khalipova, Veronika; Damart, Guillaume; Beauzamy, Bernard; Bruna, Giovanni

2018-01-01

The capacity to promptly and efficiently detect any source of contamination of the environment (a radioactive cloud) at a local and a country scale is mandatory to a safe and secure exploitation of civil nuclear energy. It must rely upon a robust network of measurement devices, to be optimized vs. several parameters, including the overall reliability, the investment, the operation and maintenance costs. We show that a network can be arranged in different ways, but many of them are inadequate. Through simulations, we test the efficiency of several configurations of sensors, in the same domain. The denser arrangement turns out to be the more efficient, but the efficiency is increased when sensors are non-uniformly distributed over the country, with accumulation at the borders. In the case of France, as radioactive threats are most likely to come from the East, the best solution is densifying the sensors close to the eastern border. Our approach differs from previous work because it is "failure oriented": we determine the laws of probability for all types of failures and deduce in this respect the best organization of the network.

Malfunctions in radioactivity sensors' networks

Directory of Open Access Journals (Sweden)

Khalipova Veronika

2018-01-01

Full Text Available The capacity to promptly and efficiently detect any source of contamination of the environment (a radioactive cloud at a local and a country scale is mandatory to a safe and secure exploitation of civil nuclear energy. It must rely upon a robust network of measurement devices, to be optimized vs. several parameters, including the overall reliability, the investment, the operation and maintenance costs. We show that a network can be arranged in different ways, but many of them are inadequate. Through simulations, we test the efficiency of several configurations of sensors, in the same domain. The denser arrangement turns out to be the more efficient, but the efficiency is increased when sensors are non-uniformly distributed over the country, with accumulation at the borders. In the case of France, as radioactive threats are most likely to come from the East, the best solution is densifying the sensors close to the eastern border. Our approach differs from previous work because it is "failure oriented": we determine the laws of probability for all types of failures and deduce in this respect the best organization of the network.

Radar coordination and resource management in a distributed sensor network using emergent control

Science.gov (United States)

Weir, B. S.; Sokol, T. M.

2009-05-01

As the list of anti-air warfare and ballistic missile defense missions grows, there is an increasing need to coordinate and optimize usage of radar resources across the netted force. Early attempts at this optimization involved top-down control mechanisms whereby sensors accept resource tasking orders from networked tracking elements. These approaches rely heavily on uncertain knowledge of sensor constraints and capabilities. Furthermore, advanced sensor systems may support self-defense missions of the host platform and are therefore unable to relinquish control to an external function. To surmount these issues, the use of bottom-up emergent control techniques is proposed. The information necessary to make quality, network-wide resource allocations is readily available to sensor nodes with access to a netted track picture. By assessing resource priorities relative to the network (versus local) track picture, sensors can understand the contribution of their resources to the netted force. This allows the sensors to apply resources where most needed and remove waste. Furthermore, simple local rules for resource usage, when properly constructed, allow sensors to obtain a globally optimal resource allocation without direct coordination (emergence). These results are robust to partial implementation (i.e., not all nodes upgraded at once) and failures on individual nodes (whether from casualty or reallocation to other sensor missions), and they leave resource control decisions in the hands of the sensor systems instead of an external function. This paper presents independent research and development work on emergent control of sensor resources and the impact to resource allocation and tracking performance.

Extending the Lifetime of Sensor Networks through Adaptive Reclustering

Directory of Open Access Journals (Sweden)

Gianluigi Ferrari

2007-06-01

Full Text Available We analyze the lifetime of clustered sensor networks with decentralized binary detection under a physical layer quality-of-service (QoS constraint, given by the maximum tolerable probability of decision error at the access point (AP. In order to properly model the network behavior, we consider four different distributions (exponential, uniform, Rayleigh, and lognormal for the lifetime of a single sensor. We show the benefits, in terms of longer network lifetime, of adaptive reclustering. We also derive an analytical framework for the computation of the network lifetime and the penalty, in terms of time delay and energy consumption, brought by adaptive reclustering. On the other hand, absence of reclustering leads to a shorter network lifetime, and we show the impact of various clustering configurations under different QoS conditions. Our results show that the organization of sensors in a few big clusters is the winning strategy to maximize the network lifetime. Moreover, the observation of the phenomenon should be frequent in order to limit the penalties associated with the reclustering procedure. We also apply the developed framework to analyze the energy consumption associated with the proposed reclustering protocol, obtaining results in good agreement with the performance of realistic wireless sensor networks. Finally, we present simulation results on the lifetime of IEEE 802.15.4 wireless sensor networks, which enrich the proposed analytical framework and show that typical networking performance metrics (such as throughput and delay are influenced by the sensor network lifetime.

Extending the Lifetime of Sensor Networks through Adaptive Reclustering

Directory of Open Access Journals (Sweden)

Ferrari Gianluigi

2007-01-01

Full Text Available We analyze the lifetime of clustered sensor networks with decentralized binary detection under a physical layer quality-of-service (QoS constraint, given by the maximum tolerable probability of decision error at the access point (AP. In order to properly model the network behavior, we consider four different distributions (exponential, uniform, Rayleigh, and lognormal for the lifetime of a single sensor. We show the benefits, in terms of longer network lifetime, of adaptive reclustering. We also derive an analytical framework for the computation of the network lifetime and the penalty, in terms of time delay and energy consumption, brought by adaptive reclustering. On the other hand, absence of reclustering leads to a shorter network lifetime, and we show the impact of various clustering configurations under different QoS conditions. Our results show that the organization of sensors in a few big clusters is the winning strategy to maximize the network lifetime. Moreover, the observation of the phenomenon should be frequent in order to limit the penalties associated with the reclustering procedure. We also apply the developed framework to analyze the energy consumption associated with the proposed reclustering protocol, obtaining results in good agreement with the performance of realistic wireless sensor networks. Finally, we present simulation results on the lifetime of IEEE 802.15.4 wireless sensor networks, which enrich the proposed analytical framework and show that typical networking performance metrics (such as throughput and delay are influenced by the sensor network lifetime.

Developing a Framework for E-Manufacturing Based on Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Xu Xi

2013-06-01

Full Text Available This paper analyzes the current situation of business environment and business intelligence systems integration at first. With emerging applications of internet and wireless communication technologies, e-manufacturing is focused on the use of internet, monitoring and communications technologies to make things happen collaboratively on a global basis. A wireless sensor network based data acquisition system gives enormous benefits such as ease and flexibility of deployment in addition to low maintenance and deployment costs. This paper reviews wireless sensor network and its application for e-manufacturing. To provide a dependable, non-intrusive, secure, real-time automated health monitoring, a distributed reconfigurable sensor network is introduced which consists of real and virtual sensor nodes over a communication wireless sensor network using Mica2 motes.

Geographically distributed environmental sensor system

Science.gov (United States)

French, Patrick; Veatch, Brad; O'Connor, Mike

2006-10-03

The present invention is directed to a sensor network that includes a number of sensor units and a base unit. The base station operates in a network discovery mode (in which network topology information is collected) in a data polling mode (in which sensed information is collected from selected sensory units). Each of the sensor units can include a number of features, including an anemometer, a rain gauge, a compass, a GPS receiver, a barometric pressure sensor, an air temperature sensor, a humidity sensor, a level, and a radiant temperature sensor.

A Framework for a Distributed and Adaptive Query Processing Engine for Wireless Sensor Networks

NARCIS (Netherlands)

Chatterjea, Supriyo; Honda, S; Iwaoka, H; van Hoesel, L.F.W.; Havinga, Paul J.M.

Wireless sensor networks (WSNs) are formed of tiny, highly energy-constrained sensor nodes that are equipped with wireless transceivers and can be used primarily in environmental monitoring applications. The nodes communicate with one another by autonomously creating ad-hoc multihop networks which

The Localized Discovery and Recovery for Query Packet Losses in Wireless Sensor Networks with Distributed Detector Clusters

Directory of Open Access Journals (Sweden)

Ryu Miura

2013-06-01

Full Text Available An essential application of wireless sensor networks is to successfully respond to user queries. Query packet losses occur in the query dissemination due to wireless communication problems such as interference, multipath fading, packet collisions, etc. The losses of query messages at sensor nodes result in the failure of sensor nodes reporting the requested data. Hence, the reliable and successful dissemination of query messages to sensor nodes is a non-trivial problem. The target of this paper is to enable highly successful query delivery to sensor nodes by localized and energy-efficient discovery, and recovery of query losses. We adopt local and collective cooperation among sensor nodes to increase the success rate of distributed discoveries and recoveries. To enable the scalability in the operations of discoveries and recoveries, we employ a distributed name resolution mechanism at each sensor node to allow sensor nodes to self-detect the correlated queries and query losses, and then efficiently locally respond to the query losses. We prove that the collective discovery of query losses has a high impact on the success of query dissemination and reveal that scalability can be achieved by using the proposed approach. We further study the novel features of the cooperation and competition in the collective recovery at PHY and MAC layers, and show that the appropriate number of detectors can achieve optimal successful recovery rate. We evaluate the proposed approach with both mathematical analyses and computer simulations. The proposed approach enables a high rate of successful delivery of query messages and it results in short route lengths to recover from query losses. The proposed approach is scalable and operates in a fully distributed manner.

Wireless sensor networks architectures and protocols

CERN Document Server

Callaway, Jr, Edgar H

2003-01-01

Introduction to Wireless Sensor NetworksApplications and MotivationNetwork Performance ObjectivesContributions of this BookOrganization of this BookThe Development of Wireless Sensor NetworksEarly Wireless NetworksWireless Data NetworksWireless Sensor and Related NetworksConclusionThe Physical LayerSome Physical Layer ExamplesA Practical Physical Layer for Wireless Sensor NetworksSimulations and ResultsConclusionThe Data Link LayerMedium Access Control TechniquesThe Mediation DeviceSystem Analysis and SimulationConclusionThe Network LayerSome Network Design ExamplesA Wireless Sensor Network De

A Review of Various Security Protocols in Wireless Sensor Network

OpenAIRE

Anupma Sangwan; Deepti Sindhu; Kulbir Singh

2011-01-01

Sensor networks are highly distributed networks of small, lightweight wireless sensor nodes, deployed in large numbers to monitor the environment or system by the measurement of physical parameters such as temperature, pressure, or relative humidity, sound, vibration, motion or pollutants, at different locations. A WSN [1] is composed of a large number of low-cost sensor nodes (SNs) and one or several base stations (BS) or destination nodes. SNs are typically small wireless devices with limit...

Security Threats in Wireless Sensor Networks

DEFF Research Database (Denmark)

Giannetsos, Athanasios

2011-01-01

Over the last few years, technological advances in the design of processors, memory, and radio communications have propelled an active interest in the area of distributed sensor networking, in which a number of independent, self-sustainable nodes collaborate to perform a large sensing task. Secur...

ENERGY OPTIMIZATION IN CLUSTER BASED WIRELESS SENSOR NETWORKS

Directory of Open Access Journals (Sweden)

T. SHANKAR

2014-04-01

Full Text Available Wireless sensor networks (WSN are made up of sensor nodes which are usually battery-operated devices, and hence energy saving of sensor nodes is a major design issue. To prolong the networks lifetime, minimization of energy consumption should be implemented at all layers of the network protocol stack starting from the physical to the application layer including cross-layer optimization. Optimizing energy consumption is the main concern for designing and planning the operation of the WSN. Clustering technique is one of the methods utilized to extend lifetime of the network by applying data aggregation and balancing energy consumption among sensor nodes of the network. This paper proposed new version of Low Energy Adaptive Clustering Hierarchy (LEACH, protocols called Advanced Optimized Low Energy Adaptive Clustering Hierarchy (AOLEACH, Optimal Deterministic Low Energy Adaptive Clustering Hierarchy (ODLEACH, and Varying Probability Distance Low Energy Adaptive Clustering Hierarchy (VPDL combination with Shuffled Frog Leap Algorithm (SFLA that enables selecting best optimal adaptive cluster heads using improved threshold energy distribution compared to LEACH protocol and rotating cluster head position for uniform energy dissipation based on energy levels. The proposed algorithm optimizing the life time of the network by increasing the first node death (FND time and number of alive nodes, thereby increasing the life time of the network.

Path planning in GPS-denied environments via collective intelligence of distributed sensor networks

Science.gov (United States)

Jha, Devesh K.; Chattopadhyay, Pritthi; Sarkar, Soumik; Ray, Asok

2016-05-01

This paper proposes a framework for reactive goal-directed navigation without global positioning facilities in unknown dynamic environments. A mobile sensor network is used for localising regions of interest for path planning of an autonomous mobile robot. The underlying theory is an extension of a generalised gossip algorithm that has been recently developed in a language-measure-theoretic setting. The algorithm has been used to propagate local decisions of target detection over a mobile sensor network and thus, it generates a belief map for the detected target over the network. In this setting, an autonomous mobile robot may communicate only with a few mobile sensing nodes in its own neighbourhood and localise itself relative to the communicating nodes with bounded uncertainties. The robot makes use of the knowledge based on the belief of the mobile sensors to generate a sequence of way-points, leading to a possible goal. The estimated way-points are used by a sampling-based motion planning algorithm to generate feasible trajectories for the robot. The proposed concept has been validated by numerical simulation on a mobile sensor network test-bed and a Dubin's car-like robot.

Decentralized coverage control problems for mobile robotic sensor and actuator networks

CERN Document Server

Savkin, A; Xi, Z; Javed, F; Matveev, A; Nguyen, H

2015-01-01

This book introduces various coverage control problems for mobile sensor networks including barrier, sweep and blanket. Unlike many existing algorithms, all of the robotic sensor and actuator motion algorithms developed in the book are fully decentralized or distributed, computationally efficient, easily implementable in engineering practice and based only on information on the closest neighbours of each mobile sensor and actuator and local information about the environment. Moreover, the mobile robotic sensors have no prior information about the environment in which they operation. These various types of coverage problems have never been covered before by a single book in a systematic way. Another topic of this book is the study of mobile robotic sensor and actuator networks. Many modern engineering applications include the use of sensor and actuator networks to provide efficient and effective monitoring and control of industrial and environmental processes. Such mobile sensor and actuator networks are abl...

A Key Pre-Distribution Scheme Based on µ-PBIBD for Enhancing Resilience in Wireless Sensor Networks.

Science.gov (United States)

Yuan, Qi; Ma, Chunguang; Yu, Haitao; Bian, Xuefen

2018-05-12

Many key pre-distribution (KPD) schemes based on combinatorial design were proposed for secure communication of wireless sensor networks (WSNs). Due to complexity of constructing the combinatorial design, it is infeasible to generate key rings using the corresponding combinatorial design in large scale deployment of WSNs. In this paper, we present a definition of new combinatorial design, termed “µ-partially balanced incomplete block design (µ-PBIBD)”, which is a refinement of partially balanced incomplete block design (PBIBD), and then describe a 2-D construction of µ-PBIBD which is mapped to KPD in WSNs. Our approach is of simple construction which provides a strong key connectivity and a poor network resilience. To improve the network resilience of KPD based on 2-D µ-PBIBD, we propose a KPD scheme based on 3-D Ex-µ-PBIBD which is a construction of µ-PBIBD from 2-D space to 3-D space. Ex-µ-PBIBD KPD scheme improves network scalability and resilience while has better key connectivity. Theoretical analysis and comparison with the related schemes show that key pre-distribution scheme based on Ex-µ-PBIBD provides high network resilience and better key scalability, while it achieves a trade-off between network resilience and network connectivity.

Prediction-based Dynamic Energy Management in Wireless Sensor Networks

Science.gov (United States)

Wang, Xue; Ma, Jun-Jie; Wang, Sheng; Bi, Dao-Wei

2007-01-01

Energy consumption is a critical constraint in wireless sensor networks. Focusing on the energy efficiency problem of wireless sensor networks, this paper proposes a method of prediction-based dynamic energy management. A particle filter was introduced to predict a target state, which was adopted to awaken wireless sensor nodes so that their sleep time was prolonged. With the distributed computing capability of nodes, an optimization approach of distributed genetic algorithm and simulated annealing was proposed to minimize the energy consumption of measurement. Considering the application of target tracking, we implemented target position prediction, node sleep scheduling and optimal sensing node selection. Moreover, a routing scheme of forwarding nodes was presented to achieve extra energy conservation. Experimental results of target tracking verified that energy-efficiency is enhanced by prediction-based dynamic energy management.

Prediction-based Dynamic Energy Management in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Dao-Wei Bi

2007-03-01

Full Text Available Energy consumption is a critical constraint in wireless sensor networks. Focusing on the energy efficiency problem of wireless sensor networks, this paper proposes a method of prediction-based dynamic energy management. A particle filter was introduced to predict a target state, which was adopted to awaken wireless sensor nodes so that their sleep time was prolonged. With the distributed computing capability of nodes, an optimization approach of distributed genetic algorithm and simulated annealing was proposed to minimize the energy consumption of measurement. Considering the application of target tracking, we implemented target position prediction, node sleep scheduling and optimal sensing node selection. Moreover, a routing scheme of forwarding nodes was presented to achieve extra energy conservation. Experimental results of target tracking verified that energy-efficiency is enhanced by prediction-based dynamic energy management.

Secure Geographic Routing in Ad Hoc and Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zahariadis Theodore

2010-01-01

Full Text Available Security in sensor networks is one of the most relevant research topics in resource constrained wireless devices and networks. Several attacks can be suffered in ad hoc and wireless sensor networks (WSN, which are highly susceptible to attacks, due to the limited resources of the nodes. In this paper, we propose innovative and lightweight localization techniques that allow for intrusion identification and isolation schemes and provide accurate location information. This information is used by our routing protocol which additionally incorporates a distributed trust model to prevent several routing attacks to the network. We finally evaluate our algorithms for accurate localization and for secure routing which have been implemented and tested in real ad hoc and wireless sensor networks.

Consistent Steering System using SCTP for Bluetooth Scatternet Sensor Network

Science.gov (United States)

Dhaya, R.; Sadasivam, V.; Kanthavel, R.

2012-12-01

Wireless communication is the best way to convey information from source to destination with flexibility and mobility and Bluetooth is the wireless technology suitable for short distance. On the other hand a wireless sensor network (WSN) consists of spatially distributed autonomous sensors to cooperatively monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants. Using Bluetooth piconet wireless technique in sensor nodes creates limitation in network depth and placement. The introduction of Scatternet solves the network restrictions with lack of reliability in data transmission. When the depth of the network increases, it results in more difficulties in routing. No authors so far focused on the reliability factors of Scatternet sensor network's routing. This paper illustrates the proposed system architecture and routing mechanism to increase the reliability. The another objective is to use reliable transport protocol that uses the multi-homing concept and supports multiple streams to prevent head-of-line blocking. The results show that the Scatternet sensor network has lower packet loss even in the congestive environment than the existing system suitable for all surveillance applications.

Probability Model for Data Redundancy Detection in Sensor Networks

Directory of Open Access Journals (Sweden)

Suman Kumar

2009-01-01

Full Text Available Sensor networks are made of autonomous devices that are able to collect, store, process and share data with other devices. Large sensor networks are often redundant in the sense that the measurements of some nodes can be substituted by other nodes with a certain degree of confidence. This spatial correlation results in wastage of link bandwidth and energy. In this paper, a model for two associated Poisson processes, through which sensors are distributed in a plane, is derived. A probability condition is established for data redundancy among closely located sensor nodes. The model generates a spatial bivariate Poisson process whose parameters depend on the parameters of the two individual Poisson processes and on the distance between the associated points. The proposed model helps in building efficient algorithms for data dissemination in the sensor network. A numerical example is provided investigating the advantage of this model.

DRDT: distributed and reliable data transmission with cooperative nodes for lossy wireless sensor networks.

Science.gov (United States)

Seo, Jaewan; Kim, Moonseong; Hur, In; Choi, Wook; Choo, Hyunseung

2010-01-01

Recent studies have shown that in realistic wireless sensor network environments links are extremely unreliable. To recover from corrupted packets, most routing schemes with an assumption of ideal radio environments use a retransmission mechanism, which may cause unnecessary retransmissions. Therefore, guaranteeing energy-efficient reliable data transmission is a fundamental routing issue in wireless sensor networks. However, it is not encouraged to propose a new reliable routing scheme in the sense that every existing routing scheme cannot be replaced with the new one. This paper proposes a Distributed and Reliable Data Transmission (DRDT) scheme with a goal to efficiently guarantee reliable data transmission. In particular, this is based on a pluggable modular approach so that it can be extended to existing routing schemes. DRDT offers reliable data transmission using neighbor nodes, i.e., helper nodes. A helper node is selected among the neighbor nodes of the receiver node which overhear the data packet in a distributed manner. DRDT effectively reduces the number of retransmissions by delegating the retransmission task from the sender node to the helper node that has higher link quality to the receiver node when the data packet reception fails due to the low link quality between the sender and the receiver nodes. Comprehensive simulation results show that DRDT improves end-to-end transmission cost by up to about 45% and reduces its delay by about 40% compared to existing schemes.

DRDT: Distributed and Reliable Data Transmission with Cooperative Nodes for LossyWireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jaewan Seo

2010-03-01

Full Text Available Recent studies have shown that in realistic wireless sensor network environments links are extremely unreliable. To recover from corrupted packets, most routing schemes with an assumption of ideal radio environments use a retransmission mechanism, which may cause unnecessary retransmissions. Therefore, guaranteeing energy-efficient reliable data transmission is a fundamental routing issue in wireless sensor networks. However, it is not encouraged to propose a new reliable routing scheme in the sense that every existing routing scheme cannot be replaced with the new one. This paper proposes a Distributed and Reliable Data Transmission (DRDT scheme with a goal to efficiently guarantee reliable data transmission. In particular, this is based on a pluggable modular approach so that it can be extended to existing routing schemes. DRDT offers reliable data transmission using neighbor nodes, i.e., helper nodes. A helper node is selected among the neighbor nodes of the receiver node which overhear the data packet in a distributed manner. DRDT effectively reduces the number of retransmissions by delegating the retransmission task from the sender node to the helper node that has higher link quality to the receiver node when the data packet reception fails due to the low link quality between the sender and the receiver nodes. Comprehensive simulation results show that DRDT improves end-to-end transmission cost by up to about 45% and reduces its delay by about 40% compared to existing schemes.

A Deployment Scheme Based Upon Virtual Force for Directional Sensor Networks

Directory of Open Access Journals (Sweden)

Chiu-Kuo Liang

2015-11-01

Full Text Available A directional sensor network is composed of many directional sensor nodes. Unlike conventional omni-directional sensors that always have an omni-angle of sensing range; directional sensors may have a limited angle of sensing range due to technical constraints or cost considerations. Area coverage is still an essential issue in a directional sensor network. In this paper, we study the area coverage problem in directional sensor networks with mobile sensors, which can move to the correct places to get high coverage. We present distributed self-deployment schemes of mobile sensors. After sensors are randomly deployed, each sensor calculates its next new location to move in order to obtain a better coverage than previous one. The locations of sensors are adjusted round by round so that the coverage is gradually improved. Based on the virtual force of the directional sensors, we design a scheme, namely Virtual force scheme. Simulation results show the effectiveness of our scheme in term of the coverage improvement.

A Distributed Energy-Aware Trust Management System for Secure Routing in Wireless Sensor Networks

Science.gov (United States)

Stelios, Yannis; Papayanoulas, Nikos; Trakadas, Panagiotis; Maniatis, Sotiris; Leligou, Helen C.; Zahariadis, Theodore

Wireless sensor networks are inherently vulnerable to security attacks, due to their wireless operation. The situation is further aggravated because they operate in an infrastructure-less environment, which mandates the cooperation among nodes for all networking tasks, including routing, i.e. all nodes act as “routers”, forwarding the packets generated by their neighbours in their way to the sink node. This implies that malicious nodes (denying their cooperation) can significantly affect the network operation. Trust management schemes provide a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a secure routing solution based on a novel distributed trust management system, which allows for fast detection of a wide set of attacks and also incorporates energy awareness.

Development and evaluation of an open-source, low-cost distributed sensor network for environmental monitoring applications

Science.gov (United States)

Gunawardena, N.; Pardyjak, E. R.; Stoll, R.; Khadka, A.

2018-02-01

Over the last decade there has been a proliferation of low-cost sensor networks that enable highly distributed sensor deployments in environmental applications. The technology is easily accessible and rapidly advancing due to the use of open-source microcontrollers. While this trend is extremely exciting, and the technology provides unprecedented spatial coverage, these sensors and associated microcontroller systems have not been well evaluated in the literature. Given the large number of new deployments and proposed research efforts using these technologies, it is necessary to quantify the overall instrument and microcontroller performance for specific applications. In this paper, an Arduino-based weather station system is presented in detail. These low-cost energy-budget measurement stations, or LEMS, have now been deployed for continuous measurements as part of several different field campaigns, which are described herein. The LEMS are low-cost, flexible, and simple to maintain. In addition to presenting the technical details of the LEMS, its errors are quantified in laboratory and field settings. A simple artificial neural network-based radiation-error correction scheme is also presented. Finally, challenges and possible improvements to microcontroller-based atmospheric sensing systems are discussed.

Resource aware sensor nodes in wireless sensor networks

International Nuclear Information System (INIS)

Merrett, G V; Al-Hashimi, B M; White, N M; Harris, N R

2005-01-01

Wireless sensor networks are continuing to receive considerable research interest due, in part, to the range of possible applications. One of the greatest challenges facing researchers is in overcoming the limited network lifetime inherent in the small locally powered sensor nodes. In this paper, we propose IDEALS, a system to manage a wireless sensor network using a combination of information management, energy harvesting and energy monitoring, which we label resource awareness. Through this, IDEALS is able to extend the network lifetime for important messages, by controlling the degradation of the network to maximise information throughput

Recent development in wireless sensor and ad-hoc networks

CERN Document Server

Li, Xiaolong; Yang, Yeon-Mo

2015-01-01

Wireless Sensor Network (WSN) consists of numerous physically distributed autonomous devices used for sensing and monitoring the physical and/or environmental conditions. A WSN uses a gateway that provides wireless connectivity to the wired world as well as distributed networks. There are many open problems related to Ad-Hoc networks and its applications. Looking at the expansion of the cellular infrastructure, Ad-Hoc network may be acting as the basis of the 4th generation wireless technology with the new paradigm of ‘anytime, anywhere communications’. To realize this, the real challenge would be the security, authorization and management issues of the large scale WSNs. This book is an edited volume in the broad area of WSNs. The book covers various chapters like Multi-Channel Wireless Sensor Networks, its Coverage, Connectivity as well as Deployment. It covers comparison of various communication protocols and algorithms such as MANNET, ODMRP and ADMR Protocols for Ad hoc Multicasting, Location Based C...

Data Collection using Miniature Aerial Vehicles in Wireless Sensor Networks

DEFF Research Database (Denmark)

Mathur, Prateek; Nielsen, Rasmus Hjorth; Prasad, Neeli R.

2016-01-01

Energy constraints of sensor nodes in wireless sensor networks (WSNs) is a major challenge and minimising the overall data transmitted across a network using data aggregation, distributed source coding, and compressive sensing have been proposed as mechanisms for energy saving. Similarly, use...... of mobile nodes capable of relocating within the network has been widely explored for energy saving. In this paper, we propose a novel method for using miniature aerial vehicles (MAVs) for data collection instead of actively sensing from a deployed network. The proposed mechanism is referred as Data...

Development of Light Powered Sensor Networks for Thermal Comfort Measurement

Directory of Open Access Journals (Sweden)

Dasheng Lee

2008-10-01

Full Text Available Recent technological advances in wireless communications have enabled easy installation of sensor networks with air conditioning equipment control applications. However, the sensor node power supply, through either power lines or battery power, still presents obstacles to the distribution of the sensing systems. In this study, a novel sensor network, powered by the artificial light, was constructed to achieve wireless power transfer and wireless data communications for thermal comfort measurements. The sensing node integrates an IC-based temperature sensor, a radiation thermometer, a relative humidity sensor, a micro machined flow sensor and a microprocessor for predicting mean vote (PMV calculation. The 935 MHz band RF module was employed for the wireless data communication with a specific protocol based on a special energy beacon enabled mode capable of achieving zero power consumption during the inactive periods of the nodes. A 5W spotlight, with a dual axis tilt platform, can power the distributed nodes over a distance of up to 5 meters. A special algorithm, the maximum entropy method, was developed to estimate the sensing quantity of climate parameters if the communication module did not receive any response from the distributed nodes within a certain time limit. The light-powered sensor networks were able to gather indoor comfort-sensing index levels in good agreement with the comfort-sensing vote (CSV preferred by a human being and the experimental results within the environment suggested that the sensing system could be used in air conditioning systems to implement a comfort-optimal control strategy.

Mobility and Heterogeneity Aware Cluster-Based Data Aggregation for Wireless Sensor Network

DEFF Research Database (Denmark)

Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

2016-01-01

Internet of things (IoT) is the modern era, which offers a variety of novel applications for mobile targets and opens the new domains for the distributed data aggregations using Wireless Sensor Networks (WSNs). However, low cost tiny sensors used for network formation generate the large amount...

Reliable and Efficient Communications in Wireless Sensor Networks

International Nuclear Information System (INIS)

Abdelhakim, M.M.

2014-01-01

Wireless sensor network (WSN) is a key technology for a wide range of military and civilian applications. Limited by the energy resources and processing capabilities of the sensor nodes, reliable and efficient communications in wireless sensor networks are challenging, especially when the sensors are deployed in hostile environments. This research aims to improve the reliability and efficiency of time-critical communications in WSNs, under both benign and hostile environments. We start with wireless sensor network with mobile access points (SENMA), where the mobile access points traverse the network to collect information from individual sensors. Due to its routing simplicity and energy efficiency, SENMA has attracted lots of attention from the research community. Here, we study reliable distributed detection in SENMA under Byzantine attacks, where some authenticated sensors are compromised to report fictitious information. The q-out-of-m rule is considered. It is popular in distributed detection and can achieve a good trade-off between the miss detection probability and the false alarm rate. However, a major limitation with this rule is that the optimal scheme parameters can only be obtained through exhaustive search. By exploiting the linear relationship between the scheme parameters and the network size, we propose simple but effective sub-optimal linear approaches. Then, for better flexibility and scalability, we derive a near-optimal closed-form solution based on the central limit theorem. It is proved that the false alarm rate of the q-out-of-m scheme diminishes exponentially as the network size increases, even if the percentage of malicious nodes remains fixed. This implies that large-scale sensor networks are more reliable under malicious attacks. To further improve the performance under time varying attacks, we propose an effective malicious node detection scheme for adaptive data fusion; the proposed scheme is analyzed using the entropy-based trust model

Software Updating in Wireless Sensor Networks: A Survey and Lacunae

Directory of Open Access Journals (Sweden)

Cormac J. Sreenan

2013-11-01

Full Text Available Wireless Sensor Networks are moving out of the laboratory and into the field. For a number of reasons there is often a need to update sensor node software, or node configuration, after deployment. The need for over-the-air updates is driven both by the scale of deployments, and by the remoteness and inaccessibility of sensor nodes. This need has been recognized since the early days of sensor networks, and research results from the related areas of mobile networking and distributed systems have been applied to this area. In order to avoid any manual intervention, the update process needs to be autonomous. This paper presents a comprehensive survey of software updating in Wireless Sensor Networks, and analyses the features required to make these updates autonomous. A new taxonomy of software update features and a new model for fault detection and recovery are presented. The paper concludes by identifying the lacunae relating to autonomous software updates, providing direction for future research.

A key design to prolong lifetime of wireless sensor network

International Nuclear Information System (INIS)

Qiu, Bo; Chen, XiQiu; Wu, Qi

2016-01-01

In order to solve the contradiction between the connectivity of the wireless sensor network and the key storage consumption, under the premise of reducing network storage consumption, the key pre-distribution management scheme with higher connectivity rate is proposed using the hexagonal network deployment information, which adopts the idea of the matrix space for the square deployment information strategy to reduce the burden of the network storage. Ability against the capture attack is improved obviously. The results show that contradiction between the network connectivity rate and the energy consumption has a better solution, and the proposed algorithm is suitable for the wireless sensor networks of energy limited.

Wireless Sensor Network Based Smart Parking System

Directory of Open Access Journals (Sweden)

Jeffrey JOSEPH

2014-01-01

Full Text Available Ambient Intelligence is a vision in which various devices come together and process information from multiple sources in order to exert control on the physical environment. In addition to computation and control, communication plays a crucial role in the overall functionality of such a system. Wireless Sensor Networks are one such class of networks, which meet these criteria. These networks consist of spatially distributed sensor motes which work in a co-operative manner to sense and control the environment. In this work, an implementation of an energy-efficient and cost-effective, wireless sensor networks based vehicle parking system for a multi-floor indoor parking facility has been introduced. The system monitors the availability of free parking slots and guides the vehicle to the nearest free slot. The amount of time the vehicle has been parked is monitored for billing purposes. The status of the motes (dead/alive is also recorded. Information like slot allocated, directions to the slot and billing data is sent as a message to customer’s mobile phones. This paper extends our previous work 1 with the development of a low cost sensor mote, about one tenth the cost of a commercially available mote, keeping in mind the price sensitive markets of the developing countries.

The Efficacy of Epidemic Algorithms on Detecting Node Replicas in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Narasimha Shashidhar

2015-12-01

Full Text Available A node replication attack against a wireless sensor network involves surreptitious efforts by an adversary to insert duplicate sensor nodes into the network while avoiding detection. Due to the lack of tamper-resistant hardware and the low cost of sensor nodes, launching replication attacks takes little effort to carry out. Naturally, detecting these replica nodes is a very important task and has been studied extensively. In this paper, we propose a novel distributed, randomized sensor duplicate detection algorithm called Discard to detect node replicas in group-deployed wireless sensor networks. Our protocol is an epidemic, self-organizing duplicate detection scheme, which exhibits emergent properties. Epidemic schemes have found diverse applications in distributed computing: load balancing, topology management, audio and video streaming, computing aggregate functions, failure detection, network and resource monitoring, to name a few. To the best of our knowledge, our algorithm is the first attempt at exploring the potential of this paradigm to detect replicas in a wireless sensor network. Through analysis and simulation, we show that our scheme achieves robust replica detection with substantially lower communication, computational and storage requirements than prior schemes in the literature.

Energy-aware scheduling of surveillance in wireless multimedia sensor networks.

Science.gov (United States)

Wang, Xue; Wang, Sheng; Ma, Junjie; Sun, Xinyao

2010-01-01

Wireless sensor networks involve a large number of sensor nodes with limited energy supply, which impacts the behavior of their application. In wireless multimedia sensor networks, sensor nodes are equipped with audio and visual information collection modules. Multimedia contents are ubiquitously retrieved in surveillance applications. To solve the energy problems during target surveillance with wireless multimedia sensor networks, an energy-aware sensor scheduling method is proposed in this paper. Sensor nodes which acquire acoustic signals are deployed randomly in the sensing fields. Target localization is based on the signal energy feature provided by multiple sensor nodes, employing particle swarm optimization (PSO). During the target surveillance procedure, sensor nodes are adaptively grouped in a totally distributed manner. Specially, the target motion information is extracted by a forecasting algorithm, which is based on the hidden Markov model (HMM). The forecasting results are utilized to awaken sensor node in the vicinity of future target position. According to the two properties, signal energy feature and residual energy, the sensor nodes decide whether to participate in target detection separately with a fuzzy control approach. Meanwhile, the local routing scheme of data transmission towards the observer is discussed. Experimental results demonstrate the efficiency of energy-aware scheduling of surveillance in wireless multimedia sensor network, where significant energy saving is achieved by the sensor awakening approach and data transmission paths are calculated with low computational complexity.

Autonomous smart sensor network for full-scale structural health monitoring

Science.gov (United States)

Rice, Jennifer A.; Mechitov, Kirill A.; Spencer, B. F., Jr.; Agha, Gul A.

2010-04-01

The demands of aging infrastructure require effective methods for structural monitoring and maintenance. Wireless smart sensor networks offer the ability to enhance structural health monitoring (SHM) practices through the utilization of onboard computation to achieve distributed data management. Such an approach is scalable to the large number of sensor nodes required for high-fidelity modal analysis and damage detection. While smart sensor technology is not new, the number of full-scale SHM applications has been limited. This slow progress is due, in part, to the complex network management issues that arise when moving from a laboratory setting to a full-scale monitoring implementation. This paper presents flexible network management software that enables continuous and autonomous operation of wireless smart sensor networks for full-scale SHM applications. The software components combine sleep/wake cycling for enhanced power management with threshold detection for triggering network wide tasks, such as synchronized sensing or decentralized modal analysis, during periods of critical structural response.

Distributed Event Detection in Wireless Sensor Networks for Disaster Management

NARCIS (Netherlands)

Bahrepour, M.; Meratnia, Nirvana; Poel, Mannes; Taghikhaki, Zahra; Havinga, Paul J.M.

2010-01-01

Recently, wireless sensor networks (WSNs) have become mature enough to go beyond being simple fine-grained continuous monitoring platforms and become one of the enabling technologies for disaster early-warning systems. Event detection functionality of WSNs can be of great help and importance for

Integrating distributed Bayesian inference and reinforcement learning for sensor management

NARCIS (Netherlands)

Grappiolo, C.; Whiteson, S.; Pavlin, G.; Bakker, B.

2009-01-01

This paper introduces a sensor management approach that integrates distributed Bayesian inference (DBI) and reinforcement learning (RL). DBI is implemented using distributed perception networks (DPNs), a multiagent approach to performing efficient inference, while RL is used to automatically

Security For Wireless Sensor Network

OpenAIRE

Saurabh Singh,; Dr. Harsh Kumar Verma

2011-01-01

Wireless sensor network is highly vulnerable to attacks because it consists of various resourceconstrained devices with their low battery power, less memory, and associated low energy. Sensor nodescommunicate among themselves via wireless links. However, there are still a lot of unresolved issues in wireless sensor networks of which security is one of the hottest research issues. Sensor networks aredeployed in hostile environments. Environmental conditions along with resource-constraints give...

Review Of Prevention Techniques For Denial Of Service DOS Attacks In Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Poonam Rolla

2015-08-01

Full Text Available Wireless Sensor Networks comprised of several tiny sensor nodes which are densely deployed over the region to monitor the environmental conditions. These sensor nodes have certain design issues out of which security is the main predominant factor as it effects the whole lifetime of network. DDoS Distributed denial of service attack floods unnecessary packets in the sensor network. A review on DDoS attacks and their prevention techniques have been done in this paper.

Propagation Modeling and Defending of a Mobile Sensor Worm in Wireless Sensor and Actuator Networks.

Science.gov (United States)

Wang, Tian; Wu, Qun; Wen, Sheng; Cai, Yiqiao; Tian, Hui; Chen, Yonghong; Wang, Baowei

2017-01-13

WSANs (Wireless Sensor and Actuator Networks) are derived from traditional wireless sensor networks by introducing mobile actuator elements. Previous studies indicated that mobile actuators can improve network performance in terms of data collection, energy supplementation, etc. However, according to our experimental simulations, the actuator's mobility also causes the sensor worm to spread faster if an attacker launches worm attacks on an actuator and compromises it successfully. Traditional worm propagation models and defense strategies did not consider the diffusion with a mobile worm carrier. To address this new problem, we first propose a microscopic mathematical model to describe the propagation dynamics of the sensor worm. Then, a two-step local defending strategy (LDS) with a mobile patcher (a mobile element which can distribute patches) is designed to recover the network. In LDS, all recovering operations are only taken in a restricted region to minimize the cost. Extensive experimental results demonstrate that our model estimations are rather accurate and consistent with the actual spreading scenario of the mobile sensor worm. Moreover, on average, the LDS outperforms other algorithms by approximately 50% in terms of the cost.

Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network

OpenAIRE

Bhavana Butani; Piyush Kumar Shukla; Sanjay Silakari

2014-01-01

Wireless sensor networks (WSNs) are novel large-scale wireless networks that consist of distributed, self organizing, low-power, low-cost, tiny sensor devices to cooperatively collect information through infrastructure less wireless networks. These networks are envisioned to play a crucial role in variety of applications like critical military surveillance applications, forest fire monitoring, commercial applications such as building security monitoring, traffic surveillance, habitat monitori...

Data Driven Performance Evaluation of Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Antonio A. F. Loureiro

2010-03-01

Full Text Available Wireless Sensor Networks are presented as devices for signal sampling and reconstruction. Within this framework, the qualitative and quantitative influence of (i signal granularity, (ii spatial distribution of sensors, (iii sensors clustering, and (iv signal reconstruction procedure are assessed. This is done by defining an error metric and performing a Monte Carlo experiment. It is shown that all these factors have significant impact on the quality of the reconstructed signal. The extent of such impact is quantitatively assessed.

A multi-agent system architecture for sensor networks.

Science.gov (United States)

Fuentes-Fernández, Rubén; Guijarro, María; Pajares, Gonzalo

2009-01-01

The design of the control systems for sensor networks presents important challenges. Besides the traditional problems about how to process the sensor data to obtain the target information, engineers need to consider additional aspects such as the heterogeneity and high number of sensors, and the flexibility of these networks regarding topologies and the sensors in them. Although there are partial approaches for resolving these issues, their integration relies on ad hoc solutions requiring important development efforts. In order to provide an effective approach for this integration, this paper proposes an architecture based on the multi-agent system paradigm with a clear separation of concerns. The architecture considers sensors as devices used by an upper layer of manager agents. These agents are able to communicate and negotiate services to achieve the required functionality. Activities are organized according to roles related with the different aspects to integrate, mainly sensor management, data processing, communication and adaptation to changes in the available devices and their capabilities. This organization largely isolates and decouples the data management from the changing network, while encouraging reuse of solutions. The use of the architecture is facilitated by a specific modelling language developed through metamodelling. A case study concerning a generic distributed system for fire fighting illustrates the approach and the comparison with related work.

Impact of sensor detection limits on protecting water distribution systems from contamination events

International Nuclear Information System (INIS)

McKenna, Sean Andrew; Hart, David Blaine; Yarrington, Lane

2006-01-01

Real-time water quality sensors are becoming commonplace in water distribution systems. However, field deployable, contaminant-specific sensors are still in the development stage. As development proceeds, the necessary operating parameters of these sensors must be determined to protect consumers from accidental and malevolent contamination events. This objective can be quantified in several different ways including minimization of: the time necessary to detect a contamination event, the population exposed to contaminated water, the extent of the contamination within the network, and others. We examine the ability of a sensor set to meet these objectives as a function of both the detection limit of the sensors and the number of sensors in the network. A moderately sized distribution network is used as an example and different sized sets of randomly placed sensors are considered. For each combination of a certain number of sensors and a detection limit, the mean values of the different objectives across multiple random sensor placements are calculated. The tradeoff between the necessary detection limit in a sensor and the number of sensors is evaluated. Results show that for the example problem examined here, a sensor detection limit of 0.01 of the average source concentration is adequate for maximum protection. Detection of events is dependent on the detection limit of the sensors, but for those events that are detected, the values of the performance measures are not a function of the sensor detection limit. The results of replacing a single sensor in a network with a sensor having a much lower detection limit show that while this replacement can improve results, the majority of the additional events detected had performance measures of relatively low consequence.

Analyzing Multimode Wireless Sensor Networks Using the Network Calculus

Directory of Open Access Journals (Sweden)

Xi Jin

2015-01-01

Full Text Available The network calculus is a powerful tool to analyze the performance of wireless sensor networks. But the original network calculus can only model the single-mode wireless sensor network. In this paper, we combine the original network calculus with the multimode model to analyze the maximum delay bound of the flow of interest in the multimode wireless sensor network. There are two combined methods A-MM and N-MM. The method A-MM models the whole network as a multimode component, and the method N-MM models each node as a multimode component. We prove that the maximum delay bound computed by the method A-MM is tighter than or equal to that computed by the method N-MM. Experiments show that our proposed methods can significantly decrease the analytical delay bound comparing with the separate flow analysis method. For the large-scale wireless sensor network with 32 thousands of sensor nodes, our proposed methods can decrease about 70% of the analytical delay bound.

Dynamic Sensor Network Reprogramming using SensorScheme

NARCIS (Netherlands)

Evers, L.; Havinga, Paul J.M.; Kuper, Jan

2007-01-01

Building wireless sensor network applications is a challenging task, and it has become apparent that it is crucial for many sensor networks to be able to load or update the application after deployment. Since communication is a scarce resource and costly in terms of energy, it is important to

Insights into mountain precipitation and snowpack from a basin-scale wireless-sensor network

Science.gov (United States)

A spatially distributed wireless-sensor network, installed across the 2154 km2 portion of the 5311 km2 American River basin above 1500 m elevation, provided spatial measurements of temperature, relative humidity and snow depth. The network consisted of 10 sensor clusters, each with 10 measurement no...

Distributed parameter estimation in unreliable sensor networks via broadcast gossip algorithms.

Science.gov (United States)

Wang, Huiwei; Liao, Xiaofeng; Wang, Zidong; Huang, Tingwen; Chen, Guo

2016-01-01

In this paper, we present an asynchronous algorithm to estimate the unknown parameter under an unreliable network which allows new sensors to join and old sensors to leave, and can tolerate link failures. Each sensor has access to partially informative measurements when it is awakened. In addition, the proposed algorithm can avoid the interference among messages and effectively reduce the accumulated measurement and quantization errors. Based on the theory of stochastic approximation, we prove that our proposed algorithm almost surely converges to the unknown parameter. Finally, we present a numerical example to assess the performance and the communication cost of the algorithm. Copyright © 2015 Elsevier Ltd. All rights reserved.

Efficient Vector-Based Forwarding for Underwater Sensor Networks

Directory of Open Access Journals (Sweden)

Peng Xie

2010-01-01

Full Text Available Underwater Sensor Networks (UWSNs are significantly different from terrestrial sensor networks in the following aspects: low bandwidth, high latency, node mobility, high error probability, and 3-dimensional space. These new features bring many challenges to the network protocol design of UWSNs. In this paper, we tackle one fundamental problem in UWSNs: robust, scalable, and energy efficient routing. We propose vector-based forwarding (VBF, a geographic routing protocol. In VBF, the forwarding path is guided by a vector from the source to the target, no state information is required on the sensor nodes, and only a small fraction of the nodes is involved in routing. To improve the robustness, packets are forwarded in redundant and interleaved paths. Further, a localized and distributed self-adaptation algorithm allows the nodes to reduce energy consumption by discarding redundant packets. VBF performs well in dense networks. For sparse networks, we propose a hop-by-hop vector-based forwarding (HH-VBF protocol, which adapts the vector-based approach at every hop. We evaluate the performance of VBF and HH-VBF through extensive simulations. The simulation results show that VBF achieves high packet delivery ratio and energy efficiency in dense networks and HH-VBF has high packet delivery ratio even in sparse networks.

Sleep Deprivation Attack Detection in Wireless Sensor Network

Science.gov (United States)

Bhattasali, Tapalina; Chaki, Rituparna; Sanyal, Sugata

2012-02-01

Deployment of sensor network in hostile environment makes it mainly vulnerable to battery drainage attacks because it is impossible to recharge or replace the battery power of sensor nodes. Among different types of security threats, low power sensor nodes are immensely affected by the attacks which cause random drainage of the energy level of sensors, leading to death of the nodes. The most dangerous type of attack in this category is sleep deprivation, where target of the intruder is to maximize the power consumption of sensor nodes, so that their lifetime is minimized. Most of the existing works on sleep deprivation attack detection involve a lot of overhead, leading to poor throughput. The need of the day is to design a model for detecting intrusions accurately in an energy efficient manner. This paper proposes a hierarchical framework based on distributed collaborative mechanism for detecting sleep deprivation torture in wireless sensor network efficiently. Proposed model uses anomaly detection technique in two steps to reduce the probability of false intrusion.

ReTrust: attack-resistant and lightweight trust management for medical sensor networks.

Science.gov (United States)

He, Daojing; Chen, Chun; Chan, Sammy; Bu, Jiajun; Vasilakos, Athanasios V

2012-07-01

Wireless medical sensor networks (MSNs) enable ubiquitous health monitoring of users during their everyday lives, at health sites, without restricting their freedom. Establishing trust among distributed network entities has been recognized as a powerful tool to improve the security and performance of distributed networks such as mobile ad hoc networks and sensor networks. However, most existing trust systems are not well suited for MSNs due to the unique operational and security requirements of MSNs. Moreover, similar to most security schemes, trust management methods themselves can be vulnerable to attacks. Unfortunately, this issue is often ignored in existing trust systems. In this paper, we identify the security and performance challenges facing a sensor network for wireless medical monitoring and suggest it should follow a two-tier architecture. Based on such an architecture, we develop an attack-resistant and lightweight trust management scheme named ReTrust. This paper also reports the experimental results of the Collection Tree Protocol using our proposed system in a network of TelosB motes, which show that ReTrust not only can efficiently detect malicious/faulty behaviors, but can also significantly improve the network performance in practice.

Distributed sensor coordination for advanced energy systems

Energy Technology Data Exchange (ETDEWEB)

Tumer, Kagan [Oregon State Univ., Corvallis, OR (United States). School of Mechanical, Industrial and Manufacturing Engineering

2015-03-12

Motivation: The ability to collect key system level information is critical to the safe, efficient and reliable operation of advanced power systems. Recent advances in sensor technology have enabled some level of decision making directly at the sensor level. However, coordinating large numbers of sensors, particularly heterogeneous sensors, to achieve system level objectives such as predicting plant efficiency, reducing downtime or predicting outages requires sophisticated coordination algorithms. Indeed, a critical issue in such systems is how to ensure the interaction of a large number of heterogenous system components do not interfere with one another and lead to undesirable behavior. Objectives and Contributions: The long-term objective of this work is to provide sensor deployment, coordination and networking algorithms for large numbers of sensors to ensure the safe, reliable, and robust operation of advanced energy systems. Our two specific objectives are to: 1. Derive sensor performance metrics for heterogeneous sensor networks. 2. Demonstrate effectiveness, scalability and reconfigurability of heterogeneous sensor network in advanced power systems. The key technical contribution of this work is to push the coordination step to the design of the objective functions of the sensors, allowing networks of heterogeneous sensors to be controlled. By ensuring that the control and coordination is not specific to particular sensor hardware, this approach enables the design and operation of large heterogeneous sensor networks. In addition to the coordination coordination mechanism, this approach allows the system to be reconfigured in response to changing needs (e.g., sudden external events requiring new responses) or changing sensor network characteristics (e.g., sudden changes to plant condition). Impact: The impact of this work extends to a large class of problems relevant to the National Energy Technology Laboratory including sensor placement, heterogeneous sensor

Wireless smart shipboard sensor network

OpenAIRE

Nozik, Andrew B.

2005-01-01

This thesis studies the feasibility of developing a smart shipboard sensor network. The objective of the thesis is to prove that sensors can be made smart by keeping calibration constants and other relevant data such as network information stored on the sensor and a server computer. Study will focus on the design and implementation of an Ipsil IP(micro)8930 microcontroller, which is then connected, by the standard TCP/IP implementation, to a network where the sensor information can be see...

Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Roy Sohini

2015-09-01

Full Text Available Wireless Sensor Network (WSN has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC.

DCE: A Distributed Energy-Efficient Clustering Protocol for Wireless Sensor Network Based on Double-Phase Cluster-Head Election.

Science.gov (United States)

Han, Ruisong; Yang, Wei; Wang, Yipeng; You, Kaiming

2017-05-01

Clustering is an effective technique used to reduce energy consumption and extend the lifetime of wireless sensor network (WSN). The characteristic of energy heterogeneity of WSNs should be considered when designing clustering protocols. We propose and evaluate a novel distributed energy-efficient clustering protocol called DCE for heterogeneous wireless sensor networks, based on a Double-phase Cluster-head Election scheme. In DCE, the procedure of cluster head election is divided into two phases. In the first phase, tentative cluster heads are elected with the probabilities which are decided by the relative levels of initial and residual energy. Then, in the second phase, the tentative cluster heads are replaced by their cluster members to form the final set of cluster heads if any member in their cluster has more residual energy. Employing two phases for cluster-head election ensures that the nodes with more energy have a higher chance to be cluster heads. Energy consumption is well-distributed in the proposed protocol, and the simulation results show that DCE achieves longer stability periods than other typical clustering protocols in heterogeneous scenarios.

Hybrid architecture for building secure sensor networks

Science.gov (United States)

Owens, Ken R., Jr.; Watkins, Steve E.

2012-04-01

Sensor networks have various communication and security architectural concerns. Three approaches are defined to address these concerns for sensor networks. The first area is the utilization of new computing architectures that leverage embedded virtualization software on the sensor. Deploying a small, embedded virtualization operating system on the sensor nodes that is designed to communicate to low-cost cloud computing infrastructure in the network is the foundation to delivering low-cost, secure sensor networks. The second area focuses on securing the sensor. Sensor security components include developing an identification scheme, and leveraging authentication algorithms and protocols that address security assurance within the physical, communication network, and application layers. This function will primarily be accomplished through encrypting the communication channel and integrating sensor network firewall and intrusion detection/prevention components to the sensor network architecture. Hence, sensor networks will be able to maintain high levels of security. The third area addresses the real-time and high priority nature of the data that sensor networks collect. This function requires that a quality-of-service (QoS) definition and algorithm be developed for delivering the right data at the right time. A hybrid architecture is proposed that combines software and hardware features to handle network traffic with diverse QoS requirements.

Bluetooth-based wireless sensor networks

Science.gov (United States)

You, Ke; Liu, Rui Qiang

2007-11-01

In this work a Bluetooth-based wireless sensor network is proposed. In this bluetooth-based wireless sensor networks, information-driven star topology and energy-saved mode are used, through which a blue master node can control more than seven slave node, the energy of each sensor node is reduced and secure management of each sensor node is improved.

CONVERGING REDUNDANT SENSOR NETWORK INFORMATION FOR IMPROVED BUILDING CONTROL

Energy Technology Data Exchange (ETDEWEB)

Dale K. Tiller; Gregor P. Henze

2004-11-01

Knowing how many people occupy a building, and where they are located, is a key component of building energy management and security. Commercial, industrial and residential buildings often incorporate systems used to determine occupancy, however, current sensor technology and control algorithms limit the effectiveness of both energy management and security systems. This topical report describes results from the first phase of a project to design, implement, validate, and prototype new technologies to monitor occupancy, control indoor environment services, and promote security in buildings. Phase I of the project focused on instrumentation and data collection. In this project phase a new occupancy detection system was developed, commissioned and installed in a sample of private offices and open-plan office workstations. Data acquisition systems were developed and deployed to collect data on space occupancy profiles. Analysis tools based on Bayesian probability theory were applied to the occupancy data generated by the sensor network. The inference of primary importance is a probability distribution over the number of occupants and their locations in a building, given past and present sensor measurements. Inferences were computed for occupancy and its temporal persistence in individual offices as well as the persistence of sensor status. The raw sensor data were also used to calibrate the sensor belief network, including the occupancy transition matrix used in the Markov model, sensor sensitivity, and sensor failure models. This study shows that the belief network framework can be applied to the analysis of data streams from sensor networks, offering significant benefits to building operation compared to current practice.

Wireless sensor networks principles, design and applications

CERN Document Server

Yang, Shuang-Hua

2014-01-01

Wireless Sensor Networks presents the latest practical solutions to the design issues presented in wireless-sensor-network-based systems. Novel features of the text, distributed throughout, include workable solutions, demonstration systems and case studies of the design and application of wireless sensor networks (WSNs) based on the first-hand research and development experience of the author, and the chapters on real applications: building fire safety protection; smart home automation; and logistics resource management. Case studies and applications illustrate the practical perspectives of: ·         sensor node design; ·         embedded software design; ·         routing algorithms; ·         sink node positioning; ·         co-existence with other wireless systems; ·         data fusion; ·         security; ·         indoor location tracking; ·         integrating with radio-frequency identification; and ·         In...

Water Pollution Detection Based on Hypothesis Testing in Sensor Networks

Directory of Open Access Journals (Sweden)

Xu Luo

2017-01-01

Full Text Available Water pollution detection is of great importance in water conservation. In this paper, the water pollution detection problems of the network and of the node in sensor networks are discussed. The detection problems in both cases of the distribution of the monitoring noise being normal and nonnormal are considered. The pollution detection problems are analyzed based on hypothesis testing theory firstly; then, the specific detection algorithms are given. Finally, two implementation examples are given to illustrate how the proposed detection methods are used in the water pollution detection in sensor networks and prove the effectiveness of the proposed detection methods.

Network performance of a wireless sensor network for temperature monitoring in vineyards

DEFF Research Database (Denmark)

Liscano, Ramiro; Jacoub, John Khalil; Dersingh, Anand

2011-01-01

Wireless sensor networks (WSNs) are an emerging technology which can be used for outdoor environmental monitoring. This paper presents challenges that arose from the development and deployment of a WSN for environmental monitoring as well as network performance analysis of this network. Different...... components in our sensor network architecture are presented like the physical nodes, the sensor node code, and two messaging protocols; one for collecting sensor and network values and the other for sensor node commands. An information model for sensor nodes to support plug-and-play capabilities in sensor...... networks is also presented....

CONGESTION CONTROL IMPROVED QoS ROUTING SCHEME FOR WIRELESS SENSOR NETWORK

OpenAIRE

A. Elakkiya*, B. Santhana Krishnan, Dr. M. Ramaswamy

2016-01-01

Wireless sensor network is distributed self-governing sensors used to monitor the physical conditions of the environment. They are constructed by nodes where each of them is connected to sensors. These sensor nodes acquire real time information and transmit the information. When large number of sensor nodes are active in transmitting the information there is a possibility of congestion in the data packets. Congestion occurs due to buffer overflow, channel contention, packet collision, reporti...

The art of wireless sensor networks

CERN Document Server

2014-01-01

During the last one and a half decades, wireless sensor networks have witnessed significant growth and tremendous development in both academia and industry.   “The Art of Wireless Sensor Networks: Volume 1: Fundamentals” focuses on the fundamentals concepts in the design, analysis, and implementation of wireless sensor networks. It covers the various layers of the lifecycle of this type of network from the physical layer up to the application layer. Its rationale is that the first volume covers contemporary design issues, tools, and protocols for radio-based two-dimensional terrestrial sensor networks. All the book chapters in this volume include up-to-date research work spanning various classic facets of the physical properties and functional behavior of wireless sensor networks, including physical layer, medium access control, data routing, topology management, mobility management, localization, task management, data management, data gathering, security, middleware, sensor technology, standards, and ...

A Multi-Agent System Architecture for Sensor Networks

Directory of Open Access Journals (Sweden)

María Guijarro

2009-12-01

Full Text Available The design of the control systems for sensor networks presents important challenges. Besides the traditional problems about how to process the sensor data to obtain the target information, engineers need to consider additional aspects such as the heterogeneity and high number of sensors, and the flexibility of these networks regarding topologies and the sensors in them. Although there are partial approaches for resolving these issues, their integration relies on ad hoc solutions requiring important development efforts. In order to provide an effective approach for this integration, this paper proposes an architecture based on the multi-agent system paradigm with a clear separation of concerns. The architecture considers sensors as devices used by an upper layer of manager agents. These agents are able to communicate and negotiate services to achieve the required functionality. Activities are organized according to roles related with the different aspects to integrate, mainly sensor management, data processing, communication and adaptation to changes in the available devices and their capabilities. This organization largely isolates and decouples the data management from the changing network, while encouraging reuse of solutions. The use of the architecture is facilitated by a specific modelling language developed through metamodelling. A case study concerning a generic distributed system for fire fighting illustrates the approach and the comparison with related work.

Enhancing Sensor Network Data Quality via Collaborated Circuit and Network Operations

Directory of Open Access Journals (Sweden)

Lucas Vespa

2013-04-01

Full Text Available In many applications, the quality of data gathered by sensor networks is directly related to the signal-to-noise ratio (SNR of the sensor data being transmitted in the networks. Different from the SNR that is often used in measuring the quality of communication links, the SNR used in this work measures how accurately the data in the network packets represent the physical parameters being sensed. Hence, the signal here refers to the physical parameters that are being monitored by sensor networks; the noise is due to environmental interference and circuit noises at sensor nodes, and packet loss during network transmission. While issues affecting SNR at sensor nodes have been intensively investigated, the impact of network packet loss on data SNR has not attracted significant attention in sensor network design. This paper investigates the impact of packet loss on sensor network data SNR and shows that data SNR is dramatically affected by network packet loss. A data quality metric, based on data SNR, is developed and a cross-layer adaptive scheme is presented to minimize data quality degradation in congested sensor networks. The proposed scheme consists of adaptive downsampling and bit truncation at sensor nodes and intelligent traffic management techniques at the network level. Simulation results are presented to demonstrate the validity and effectiveness of the proposed techniques.

Clock Synchronization for Multihop Wireless Sensor Networks

Science.gov (United States)

Solis Robles, Roberto

2009-01-01

In wireless sensor networks, more so generally than in other types of distributed systems, clock synchronization is crucial since by having this service available, several applications such as media access protocols, object tracking, or data fusion, would improve their performance. In this dissertation, we propose a set of algorithms to achieve…

Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

Science.gov (United States)

Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing

2017-07-19

Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

Consistent sensor, relay, and link selection in wireless sensor networks

NARCIS (Netherlands)

Arroyo Valles, M.D.R.; Simonetto, A.; Leus, G.J.T.

2017-01-01

In wireless sensor networks, where energy is scarce, it is inefficient to have all nodes active because they consume a non-negligible amount of battery. In this paper we consider the problem of jointly selecting sensors, relays and links in a wireless sensor network where the active sensors need

Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

Science.gov (United States)

Song, W.-Z.; Yuan, F.; LaHusen, R.; Shirazi, B.

2007-01-01

This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted], N(u0)-1) time slots, assuming each node reports one unit of data in each round. Here [image omitted] is the total number of sensors, while [image omitted] denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle.

Distributed Energy-Efficient Topology Control Algorithm in Home M2M Networks

OpenAIRE

Lee, Chao-Yang; Yang, Chu-Sing

2012-01-01

Because machine-to-machine (M2M) technology enables machines to communicate with each other without human intervention, it could play a big role in sensor network systems. Through wireless sensor network (WSN) gateways, various information can be collected by sensors for M2M systems. For home M2M networks, this study proposes a distributed energy-efficient topology control algorithm for both topology construction and topology maintenance. Topology control is an effective method of enhancing e...

SmartPipes: Smart Wireless Sensor Networks for Leak Detection in Water Pipelines

Directory of Open Access Journals (Sweden)

Ali M. Sadeghioon

2014-02-01

Full Text Available Asset monitoring, specifically infrastructure monitoring such as water distribution pipelines, is becoming increasingly critical for utility owners who face new challenges due to an aging network. In the UK alone, during the period of 2009–2010, approximately 3281 mega litres (106 of water were wasted due to failure or leaks in water pipelines. Various techniques can be used for the monitoring of water distribution networks. This paper presents the design, development and testing of a smart wireless sensor network for leak detection in water pipelines, based on the measurement of relative indirect pressure changes in plastic pipes. Power consumption of the sensor nodes is minimised to 2.2 mW based on one measurement every 6 h in order to prolong the lifetime of the network and increase the sensor nodes’ compatibility with current levels of power available by energy harvesting methods and long life batteries. A novel pressure sensing method is investigated for its performance and capabilities by both laboratory and field trials. The sensors were capable of measuring pressure changes due to leaks. These pressure profiles can also be used to locate the leaks.

A Survey on Sensor Coverage and Visual Data Capturing/Processing/Transmission in Wireless Visual Sensor Networks

Directory of Open Access Journals (Sweden)

Florence G. H. Yap

2014-02-01

Full Text Available Wireless Visual Sensor Networks (WVSNs where camera-equipped sensor nodes can capture, process and transmit image/video information have become an important new research area. As compared to the traditional wireless sensor networks (WSNs that can only transmit scalar information (e.g., temperature, the visual data in WVSNs enable much wider applications, such as visual security surveillance and visual wildlife monitoring. However, as compared to the scalar data in WSNs, visual data is much bigger and more complicated so intelligent schemes are required to capture/process/ transmit visual data in limited resources (hardware capability and bandwidth WVSNs. WVSNs introduce new multi-disciplinary research opportunities of topics that include visual sensor hardware, image and multimedia capture and processing, wireless communication and networking. In this paper, we survey existing research efforts on the visual sensor hardware, visual sensor coverage/deployment, and visual data capture/ processing/transmission issues in WVSNs. We conclude that WVSN research is still in an early age and there are still many open issues that have not been fully addressed. More new novel multi-disciplinary, cross-layered, distributed and collaborative solutions should be devised to tackle these challenging issues in WVSNs.

Wireless Sensor Network Handles Image Data

Science.gov (United States)

2008-01-01

To relay data from remote locations for NASA s Earth sciences research, Goddard Space Flight Center contributed to the development of "microservers" (wireless sensor network nodes), which are now used commercially as a quick and affordable means to capture and distribute geographical information, including rich sets of aerial and street-level imagery. NASA began this work out of a necessity for real-time recovery of remote sensor data. These microservers work much like a wireless office network, relaying information between devices. The key difference, however, is that instead of linking workstations within one office, the interconnected microservers operate miles away from one another. This attribute traces back to the technology s original use: The microservers were originally designed for seismology on remote glaciers and ice streams in Alaska, Greenland, and Antarctica-acquiring, storing, and relaying data wirelessly between ground sensors. The microservers boast three key attributes. First, a researcher in the field can establish a "managed network" of microservers and rapidly see the data streams (recovered wirelessly) on a field computer. This rapid feedback permits the researcher to reconfigure the network for different purposes over the course of a field campaign. Second, through careful power management, the microservers can dwell unsupervised in the field for up to 2 years, collecting tremendous amounts of data at a research location. The third attribute is the exciting potential to deploy a microserver network that works in synchrony with robotic explorers (e.g., providing ground truth validation for satellites, supporting rovers as they traverse the local environment). Managed networks of remote microservers that relay data unsupervised for up to 2 years can drastically reduce the costs of field instrumentation and data rec

An Energy-Efficient Target Tracking Framework in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zhijun Yu

2009-01-01

Full Text Available This study devises and evaluates an energy-efficient distributed collaborative signal and information processing framework for acoustic target tracking in wireless sensor networks. The distributed processing algorithm is based on mobile agent computing paradigm and sequential Bayesian estimation. At each time step, the short detection reports of cluster members will be collected by cluster head, and a sensor node with the highest signal-to-noise ratio (SNR is chosen there as reference node for time difference of arrive (TDOA calculation. During the mobile agent migration, the target state belief is transmitted among nodes and updated using the TDOA measurement of these fusion nodes one by one. The computing and processing burden is evenly distributed in the sensor network. To decrease the wireless communications, we propose to represent the belief by parameterized methods such as Gaussian approximation or Gaussian mixture model approximation. Furthermore, we present an attraction force function to handle the mobile agent migration planning problem, which is a combination of the node residual energy, useful information, and communication cost. Simulation examples demonstrate the estimation effectiveness and energy efficiency of the proposed distributed collaborative target tracking framework.

Resource Discovery in Activity-Based Sensor Networks

DEFF Research Database (Denmark)

Bucur, Doina; Bardram, Jakob

This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level concept of computational activities (as logical bundles of data and resources) to give sensors in Activity-Based Sensor Networ....... ABSN enhances the generic Extended Zone Routing Protocol with logical sensor grouping and greatly lowers network overhead during the process of discovery, while keeping discovery latency close to optimal.......This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level concept of computational activities (as logical bundles of data and resources) to give sensors in Activity-Based Sensor Networks...... (ABSNs) knowledge about their usage even at the network layer. ABSN redesigns classical network-level service discovery protocols to include and use this logical structuring of the network for a more practically applicable service discovery scheme. Noting that in practical settings activity-based sensor...

Distributed Power Allocation for Wireless Sensor Network Localization: A Potential Game Approach.

Science.gov (United States)

Ke, Mingxing; Li, Ding; Tian, Shiwei; Zhang, Yuli; Tong, Kaixiang; Xu, Yuhua

2018-05-08

The problem of distributed power allocation in wireless sensor network (WSN) localization systems is investigated in this paper, using the game theoretic approach. Existing research focuses on the minimization of the localization errors of individual agent nodes over all anchor nodes subject to power budgets. When the service area and the distribution of target nodes are considered, finding the optimal trade-off between localization accuracy and power consumption is a new critical task. To cope with this issue, we propose a power allocation game where each anchor node minimizes the square position error bound (SPEB) of the service area penalized by its individual power. Meanwhile, it is proven that the power allocation game is an exact potential game which has one pure Nash equilibrium (NE) at least. In addition, we also prove the existence of an ϵ -equilibrium point, which is a refinement of NE and the better response dynamic approach can reach the end solution. Analytical and simulation results demonstrate that: (i) when prior distribution information is available, the proposed strategies have better localization accuracy than the uniform strategies; (ii) when prior distribution information is unknown, the performance of the proposed strategies outperforms power management strategies based on the second-order cone program (SOCP) for particular agent nodes after obtaining the estimated distribution of agent nodes. In addition, proposed strategies also provide an instructional trade-off between power consumption and localization accuracy.

On effectiveness of network sensor-based defense framework

Science.gov (United States)

Zhang, Difan; Zhang, Hanlin; Ge, Linqiang; Yu, Wei; Lu, Chao; Chen, Genshe; Pham, Khanh

2012-06-01

Cyber attacks are increasing in frequency, impact, and complexity, which demonstrate extensive network vulnerabilities with the potential for serious damage. Defending against cyber attacks calls for the distributed collaborative monitoring, detection, and mitigation. To this end, we develop a network sensor-based defense framework, with the aim of handling network security awareness, mitigation, and prediction. We implement the prototypical system and show its effectiveness on detecting known attacks, such as port-scanning and distributed denial-of-service (DDoS). Based on this framework, we also implement the statistical-based detection and sequential testing-based detection techniques and compare their respective detection performance. The future implementation of defensive algorithms can be provisioned in our proposed framework for combating cyber attacks.

Wireless Sensor Network –A Survey

OpenAIRE

Nirvika Chouhan; P.D.Vyavahare; Rekha Jain

2013-01-01

Wireless sensor networks are the networks consisting of large number of small and tiny sensor nodes. The nodes are supplied with limited power, memory and other resources and perform in-network processing. In this paper, various issues are discussed that actually put the limitations in the well working and the life time of the network. In Wireless sensor network, nodes should consume less power, memoryand so data aggregation should be performed. Security is another aspect which should be pres...

Efficient Hybrid Detection of Node Replication Attacks in Mobile Sensor Networks

Directory of Open Access Journals (Sweden)

Ze Wang

2017-01-01

Full Text Available The node replication attack is one of the notorious attacks that can be easily launched by adversaries in wireless sensor networks. A lot of literatures have studied mitigating the node replication attack in static wireless sensor networks. However, it is more difficult to detect the replicas in mobile sensor networks because of their node mobility. Considering the limitations of centralized detection schemes for static wireless sensor networks, a few distributed solutions have been recently proposed. Some existing schemes identified replicated attacks by sensing mobile nodes with identical ID but different locations. To facilitate the discovery of contradictory conflicts, we propose a hybrid local and global detection method. The local detection is performed in a local area smaller than the whole deployed area to improve the meeting probability of contradictory nodes, while the distant replicated nodes in larger area can also be efficiently detected by the global detection. The complementary two levels of detection achieve quick discovery by searching of the replicas with reasonable overhead.

Remote Autonomous Sensor Networks: A Study in Redundancy and Life Cycle Costs

Science.gov (United States)

Ahlrichs, M.; Dotson, A.; Cenek, M.

2017-12-01

The remote nature of the United States and Canada border and their extreme seasonal shifts has made monitoring much of the area impossible using conventional monitoring techniques. Currently, the United States has large gaps in its ability to detect movement on an as-needed-basis in remote areas. The proposed autonomous sensor network aims to meet that need by developing a product that is low cost, robust, and can be deployed on an as-needed-basis for short term monitoring events. This is accomplished by identifying radio frequency disturbance and acoustic disturbance. This project aims to validate the proposed design and offer optimization strategies by conducting a redundancy model as well as performing a Life Cycle Assessment (LCA). The model will incorporate topological, meteorological, and land cover datasets to estimate sensor loss over a three-month period, ensuring that the remaining network does not have significant gaps in coverage which preclude being able to receive and transmit data. The LCA will investigate the materials used to create the sensor to generate an estimate of the total environmental energy that is utilized to create the network and offer alternative materials and distribution methods that can lower this cost. This platform can function as a stand-alone monitoring network or provide additional spatial and temporal resolution to existing monitoring networks. This study aims to create the framework to determine if a sensor's design and distribution is appropriate for the target environment. The incorporation of a LCA will seek to answer if the data a proposed sensor network will collect outweighs the environmental damage that will result from its deployment. Furthermore, as the arctic continues to thaw and economic development grows, the methodology described in paper will function as a guidance document to ensure that future sensor networks have a minimal impact on these pristine areas.

Energy and round time estimation method for mobile wireless sensor networks

International Nuclear Information System (INIS)

Ismat, M.; Qureshi, R.; Imam, M.U.

2018-01-01

Clustered WSN (Wireless Sensor Networks) is a hierarchical network structure that conserves energy by distributing the task of sensing and data transfer to destination among the non-CH (Cluster-Head) and CH (Cluster Head) node in a cluster. In clustered MWSN (Mobile Wireless Sensor Network), cluster maintenance to increase at a reception at the destination during communication operation is difficult due to the movement of CHs and non-CH nodes in and out of the cluster. To conserve energy and increased data transfer to the destination, it is necessary to find the duration after which sensor node’s role should be changed from CH to non-CH and vice-versa. In this paper, we have proposed an energy independent round time scheme to identify the duration after which re-clustering procedure should be invoked for changing roles of sensor nodes as CHs and associated nodes to conserve energy and increased data delivery. This depends on the dissemination interval of the sensor nodes rather than sensor node’s energy. We have also provided a complete analytical estimate of network energy consumption with energy consumed in every phase of a around. (author)

Efficient Routing in Wireless Sensor Networks with Multiple Sessions

Directory of Open Access Journals (Sweden)

Dianjie Lu

2014-05-01

Full Text Available Wireless Sensor Networks (WSNs are subject to node failures because of limited energy and link unreliability which makes the design of routing protocols in such networks a challenging task. The multipath routing scheme is an optimal alternative to address this problem which splits the traffic across multiple paths instead of routing all the traffic along a single path. However, using more paths introduces more contentions which degrade energy efficiency. The problem becomes even more difficult in the scenario of multiple sessions since different source-destination pairs may pass the same link which makes the flow distribution of each link uncertain. Our goal is to minimize the energy cost and provide the robust transmission by choosing the optimal paths. We first study the problem from a theoretical standpoint by mapping it to the multi-commodity network design problem. Since it is hard to build a global addressing scheme due to the great number of sensor nodes, we propose a Distributed Energy Efficient Routing protocol (D2ER. In D2ER, we employ the transportation method which can optimize the flow distribution with minimal energy consumption. Simulation results demonstrate that our optimal algorithm can save energy drastically.

Collaborative Clustering for Sensor Networks

Science.gov (United States)

Wagstaff. Loro :/; Green Jillian; Lane, Terran

2011-01-01

Traditionally, nodes in a sensor network simply collect data and then pass it on to a centralized node that archives, distributes, and possibly analyzes the data. However, analysis at the individual nodes could enable faster detection of anomalies or other interesting events, as well as faster responses such as sending out alerts or increasing the data collection rate. There is an additional opportunity for increased performance if individual nodes can communicate directly with their neighbors. Previously, a method was developed by which machine learning classification algorithms could collaborate to achieve high performance autonomously (without requiring human intervention). This method worked for supervised learning algorithms, in which labeled data is used to train models. The learners collaborated by exchanging labels describing the data. The new advance enables clustering algorithms, which do not use labeled data, to also collaborate. This is achieved by defining a new language for collaboration that uses pair-wise constraints to encode useful information for other learners. These constraints specify that two items must, or cannot, be placed into the same cluster. Previous work has shown that clustering with these constraints (in isolation) already improves performance. In the problem formulation, each learner resides at a different node in the sensor network and makes observations (collects data) independently of the other learners. Each learner clusters its data and then selects a pair of items about which it is uncertain and uses them to query its neighbors. The resulting feedback (a must and cannot constraint from each neighbor) is combined by the learner into a consensus constraint, and it then reclusters its data while incorporating the new constraint. A strategy was also proposed for cleaning the resulting constraint sets, which may contain conflicting constraints; this improves performance significantly. This approach has been applied to collaborative

Opportunistic Carrier Sensing for Energy-Efficient Information Retrieval in Sensor Networks

Directory of Open Access Journals (Sweden)

Zhao Qing

2005-01-01

Full Text Available We consider distributed information retrieval for sensor networks with cluster heads or mobile access points. The performance metric used in the design is energy efficiency defined as the ratio of the average number of bits reliably retrieved by the access point to the total amount of energy consumed. A distributed opportunistic transmission protocol is proposed using a combination of carrier sensing and backoff strategy that incorporates channel state information (CSI of individual sensors. By selecting a set of sensors with the best channel states to transmit, the proposed protocol achieves the upper bound on energy efficiency when the signal propagation delay is negligible. For networks with substantial propagation delays, a backoff function optimized for energy efficiency is proposed. The design of this backoff function utilizes properties of extreme statistics and is shown to have mild performance loss in practical scenarios. We also demonstrate that opportunistic strategies that use CSI may not be optimal when channel acquisition at individual sensors consumes substantial energy. We show further that there is an optimal sensor density for which the opportunistic information retrieval is the most energy efficient. This observation leads to the design of the optimal sensor duty cycle.

Availability Issues in Wireless Visual Sensor Networks

Science.gov (United States)

Costa, Daniel G.; Silva, Ivanovitch; Guedes, Luiz Affonso; Vasques, Francisco; Portugal, Paulo

2014-01-01

Wireless visual sensor networks have been considered for a large set of monitoring applications related with surveillance, tracking and multipurpose visual monitoring. When sensors are deployed over a monitored field, permanent faults may happen during the network lifetime, reducing the monitoring quality or rendering parts or the entire network unavailable. In a different way from scalar sensor networks, camera-enabled sensors collect information following a directional sensing model, which changes the notions of vicinity and redundancy. Moreover, visual source nodes may have different relevancies for the applications, according to the monitoring requirements and cameras' poses. In this paper we discuss the most relevant availability issues related to wireless visual sensor networks, addressing availability evaluation and enhancement. Such discussions are valuable when designing, deploying and managing wireless visual sensor networks, bringing significant contributions to these networks. PMID:24526301

Real Time Assessment of Potable Water Quality in Distribution Network based on Low Cost Multi-Sensor Array

Science.gov (United States)

Bhardwaj, Jyotirmoy; Gupta, Karunesh K.; Khatri, Punit

2018-03-01

New concepts and techniques are replacing traditional methods of water quality parameters measurement systems. This paper proposed a new way of potable water quality assessment in distribution network using Multi Sensor Array (MSA). Extensive research suggests that following parameters i.e. pH, Dissolved Oxygen (D.O.), Conductivity, Oxygen Reduction Potential (ORP), Temperature and Salinity are most suitable to detect overall quality of potable water. Commonly MSA is not an integrated sensor array on some substrate, but rather comprises a set of individual sensors measuring simultaneously different water parameters all together. Based on research, a MSA has been developed followed by signal conditioning unit and finally, an algorithm for easy user interfacing. A dedicated part of this paper also discusses the platform design and significant results. The Objective of this proposed research is to provide simple, efficient, cost effective and socially acceptable means to detect and analyse water bodies regularly and automatically.

Multihopping Multilevel Clustering Heterogeneity-Sensitive Optimized Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Muhammad Aslam

2017-01-01

Full Text Available Effective utilization of energy resources in Wireless Sensor Networks (WSNs has become challenging under uncertain distributed cluster-formation and single-hop intercluster communication capabilities. So, sensor nodes are forced to operate at expensive full rate transmission power level continuously during whole network operation. These challenging network environments experience unwanted phenomena of drastic energy consumption and packet drop. In this paper, we propose an adaptive immune Multihopping Multilevel Clustering (MHMLC protocol that executes a Hybrid Clustering Algorithm (HCA to perform optimal centralized selection of Cluster-Heads (CHs within radius of centrally located Base Station (BS and distributed CHs selection in the rest of network area. HCA of MHMLC also produces optimal intermediate CHs for intercluster multihop communications that develop heterogeneity-aware economical links. This hybrid cluster-formation facilitates the sensors to function at short range transmission power level that enhances link quality and avoids packet drop. The simulation environments produce fair comparison among proposed MHMLC and existing state-of-the-art routing protocols. Experimental results give significant evidence of better performance of the proposed model in terms of network lifetime, stability period, and data delivery ratio.

Communication Buses and Protocols for Sensor Networks

Directory of Open Access Journals (Sweden)

Andrew Mason

2002-07-01

Full Text Available This paper overviews existing digital communication buses which are commonly used in sensor networks, discusses sensor network architectures, and introduces a new sensor bus for low power microsystem applications. The new intra-module multi-element microsystem (IM2 bus is nine-line interface with 8b serial data which implements several advanced features such as power management and plug-n-play while maintaining minimum hardware overhead at the sensor node. Finally, some issues in wireless sensor networking are discussed. The coverage of these issues provides a guideline for choosing the appropriate bus for different sensor network applications.

A Decentralized Approach for Nonlinear Prediction of Time Series Data in Sensor Networks

Directory of Open Access Journals (Sweden)

Richard Cédric

2010-01-01

Full Text Available Wireless sensor networks rely on sensor devices deployed in an environment to support sensing and monitoring, including temperature, humidity, motion, and acoustic. Here, we propose a new approach to model physical phenomena and track their evolution by taking advantage of the recent developments of pattern recognition for nonlinear functional learning. These methods are, however, not suitable for distributed learning in sensor networks as the order of models scales linearly with the number of deployed sensors and measurements. In order to circumvent this drawback, we propose to design reduced order models by using an easy to compute sparsification criterion. We also propose a kernel-based least-mean-square algorithm for updating the model parameters using data collected by each sensor. The relevance of our approach is illustrated by two applications that consist of estimating a temperature distribution and tracking its evolution over time.

A key distribution scheme using elliptic curve cryptography in wireless sensor networks

CSIR Research Space (South Africa)

Louw, J

2016-12-01

Full Text Available Wireless sensor networks (WSNs) have become increasingly popular in many applications across a broad range of fields. Securing WSNs poses unique challenges mainly due to their resource constraints. Traditional public key cryptography (PKC...

A Distributed Compressive Sensing Scheme for Event Capture in Wireless Visual Sensor Networks

Science.gov (United States)

Hou, Meng; Xu, Sen; Wu, Weiling; Lin, Fei

2018-01-01

Image signals which acquired by wireless visual sensor network can be used for specific event capture. This event capture is realized by image processing at the sink node. A distributed compressive sensing scheme is used for the transmission of these image signals from the camera nodes to the sink node. A measurement and joint reconstruction algorithm for these image signals are proposed in this paper. Make advantage of spatial correlation between images within a sensing area, the cluster head node which as the image decoder can accurately co-reconstruct these image signals. The subjective visual quality and the reconstruction error rate are used for the evaluation of reconstructed image quality. Simulation results show that the joint reconstruction algorithm achieves higher image quality at the same image compressive rate than the independent reconstruction algorithm.

Novel Framework for Data Collection in Wireless Sensor Networks Using Flying Sensors

DEFF Research Database (Denmark)

Mathur, Prateek; Nielsen, Rasmus Hjorth; Prasad, Neeli R.

2014-01-01

This paper proposes a novel framework for data collection from a sensor network using flying sensor nodes. Efficient data communication within the network is a necessity as sensor nodes are usually energy constrained. The proposed framework utilizes the various entities forming the network...... for a different utility compared to their usual role in sensor networks. Use of flying sensor nodes is usually considered for conventional purpose of sensing and monitoring. Flying sensing nodes are usually utilized collectively in the form of an aerial sensor network, they are not expected to function as a data...... collection entity, as proposed in this framework. Similarly, cluster heads (CHs) are usually expected to transfer the aggregated data to an adjoining CH or to the base station (BS) directly. In the proposed framework the CH transfers data directly to the flying sensor node, averting the need for energy...

Integration of RFID and Wireless Sensor Networks

Institute of Scientific and Technical Information of China (English)

Miodrag; Bolic; Amiya; Nayak; Ivan; Stojmenovi.

2007-01-01

Radio Frequency Identification (RFID) and Wireless Sensor Network (WSN) are two important wireless technologies that have wide variety of applications and provide limitless future potentials. However,RFID and sensor networks almost are under development in parallel way. Integration of RFID and wireless sensor networks attracts little attention from research community. This paper first presents a brief introduction on RFID,and then investigates recent research works,new products/patents and applications that integrate RFID with sensor networks. Four types of integration are discussed. They are integrating tags with sensors,integrating tags with wireless sensor nodes,integrating readers with wireless sensor nodes and wire-less devices,and mix of RFID and sensors. New challenges and future works are discussed in the end.

A Novel Energy-Aware Distributed Clustering Algorithm for Heterogeneous Wireless Sensor Networks in the Mobile Environment.

Science.gov (United States)

Gao, Ying; Wkram, Chris Hadri; Duan, Jiajie; Chou, Jarong

2015-12-10

In order to prolong the network lifetime, energy-efficient protocols adapted to the features of wireless sensor networks should be used. This paper explores in depth the nature of heterogeneous wireless sensor networks, and finally proposes an algorithm to address the problem of finding an effective pathway for heterogeneous clustering energy. The proposed algorithm implements cluster head selection according to the degree of energy attenuation during the network's running and the degree of candidate nodes' effective coverage on the whole network, so as to obtain an even energy consumption over the whole network for the situation with high degree of coverage. Simulation results show that the proposed clustering protocol has better adaptability to heterogeneous environments than existing clustering algorithms in prolonging the network lifetime.

TCPL: A Defense against wormhole attacks in wireless sensor networks

International Nuclear Information System (INIS)

Kumar, K. E. Naresh; Waheed, Mohd. Abdul; Basappa, K. Kari

2010-01-01

Do In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many sensor network routing protocols and location-based wireless security systems. For example, most existing ad hoc network routing protocols, without some mechanism to defend against the wormhole attack, would be unable to find routes longer than one or two hops, severely disrupting communication. We present a new, general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes.

Introduction to wireless sensor networks

CERN Document Server

Forster, Anna

2016-01-01

Explores real-world wireless sensor network development, deployment, and applications. The book begins with an introduction to wireless sensor networks and their fundamental concepts. Hardware components, operating systems, protocols, and algorithms that make up the anatomy of a sensor node are described in chapter two. Properties of wireless communications, medium access protocols, wireless links, and link estimation protocols are described in chapter three and chapter four. Routing basics and metrics, clustering techniques, time synchronization and localization protocols, as well as sensing techniques are introduced in chapter five to nine. The concluding chapter summarizes the learnt methods and shows how to use them to deploy real-world sensor networks in a structured way.

Steam distribution and energy delivery optimization using wireless sensors

Science.gov (United States)

Olama, Mohammed M.; Allgood, Glenn O.; Kuruganti, Teja P.; Sukumar, Sreenivas R.; Djouadi, Seddik M.; Lake, Joe E.

2011-05-01

The Extreme Measurement Communications Center at Oak Ridge National Laboratory (ORNL) explores the deployment of a wireless sensor system with a real-time measurement-based energy efficiency optimization framework in the ORNL campus. With particular focus on the 12-mile long steam distribution network in our campus, we propose an integrated system-level approach to optimize the energy delivery within the steam distribution system. We address the goal of achieving significant energy-saving in steam lines by monitoring and acting on leaking steam valves/traps. Our approach leverages an integrated wireless sensor and real-time monitoring capabilities. We make assessments on the real-time status of the distribution system by mounting acoustic sensors on the steam pipes/traps/valves and observe the state measurements of these sensors. Our assessments are based on analysis of the wireless sensor measurements. We describe Fourier-spectrum based algorithms that interpret acoustic vibration sensor data to characterize flows and classify the steam system status. We are able to present the sensor readings, steam flow, steam trap status and the assessed alerts as an interactive overlay within a web-based Google Earth geographic platform that enables decision makers to take remedial action. We believe our demonstration serves as an instantiation of a platform that extends implementation to include newer modalities to manage water flow, sewage and energy consumption.

Fixed SMRF Sensor Network Application Concepts

NARCIS (Netherlands)

Wit, J.J.M. de; Rossum, W.L. van; Smits, F.M.A.; Theije, P.A.M. de; Monni, S.; Huizing, A.G.

2010-01-01

Advantages of scalable multifunction RF (SMRF) sensors and networked operation of sensors are well-known. Some advantages are surveillance persistence, multipath resistance, and interference resistance. The particular benefits of applying multifunction RF sensors in a network still need to be

Distributed least-squares estimation of a remote chemical source via convex combination in wireless sensor networks.

Science.gov (United States)

Cao, Meng-Li; Meng, Qing-Hao; Zeng, Ming; Sun, Biao; Li, Wei; Ding, Cheng-Jun

2014-06-27

This paper investigates the problem of locating a continuous chemical source using the concentration measurements provided by a wireless sensor network (WSN). Such a problem exists in various applications: eliminating explosives or drugs, detecting the leakage of noxious chemicals, etc. The limited power and bandwidth of WSNs have motivated collaborative in-network processing which is the focus of this paper. We propose a novel distributed least-squares estimation (DLSE) method to solve the chemical source localization (CSL) problem using a WSN. The DLSE method is realized by iteratively conducting convex combination of the locally estimated chemical source locations in a distributed manner. Performance assessments of our method are conducted using both simulations and real experiments. In the experiments, we propose a fitting method to identify both the release rate and the eddy diffusivity. The results show that the proposed DLSE method can overcome the negative interference of local minima and saddle points of the objective function, which would hinder the convergence of local search methods, especially in the case of locating a remote chemical source.

Distributed Least-Squares Estimation of a Remote Chemical Source via Convex Combination in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Meng-Li Cao

2014-06-01

Full Text Available This paper investigates the problem of locating a continuous chemical source using the concentration measurements provided by a wireless sensor network (WSN. Such a problem exists in various applications: eliminating explosives or drugs, detecting the leakage of noxious chemicals, etc. The limited power and bandwidth of WSNs have motivated collaborative in-network processing which is the focus of this paper. We propose a novel distributed least-squares estimation (DLSE method to solve the chemical source localization (CSL problem using a WSN. The DLSE method is realized by iteratively conducting convex combination of the locally estimated chemical source locations in a distributed manner. Performance assessments of our method are conducted using both simulations and real experiments. In the experiments, we propose a fitting method to identify both the release rate and the eddy diffusivity. The results show that the proposed DLSE method can overcome the negative interference of local minima and saddle points of the objective function, which would hinder the convergence of local search methods, especially in the case of locating a remote chemical source.

Sinkhole Avoidance Routing in Wireless Sensor Networks

Science.gov (United States)

2011-05-09

COVERED (From- To) 09-05-2011 4. TITLE AND SUBTITLE 5a. CONTRACT NUMBER Sinkhole Avoidance Routing in Wireless Sensor Networks 5b . GRANT NUMBER . 5c...reliability of wireless sensor networks. 15. SUBJECT TERMS wireless sensor networks, sinkhole attack, routing protocol 16. SECURITY CLASSIFICATION...Include area code) Standard Form 298 (Rev. 8/98) Prescribed by ANSI Std . Z39.18 1 Sinkhole Avoidance Routing in Wireless Sensor Networks MIDN 1/C

Wireless rechargeable sensor networks

CERN Document Server

Yang, Yuanyuan

2015-01-01

This SpringerBrief provides a concise guide to applying wireless energy transfer techniques in traditional battery-powered sensor networks. It examines the benefits and challenges of wireless power including efficiency and reliability. The authors build a wireless rechargeable sensor networks from scratch and aim to provide perpetual network operation. Chapters cover a wide range of topics from the collection of energy information and recharge scheduling to joint design with typical sensing applications such as data gathering. Problems are approached using a natural combination of probability

A SMART MONITORING SYSTEM FOR CAMPUS USING ZIGBEE WIRELESS SENSOR NETWORKS

Directory of Open Access Journals (Sweden)

Alaa Azmi Allahham

2018-02-01

Full Text Available The wireless sensor networks are autonomous sensors that are distributed to monitor environmental and physical conditions and pass them across the network to other areas, which is considered one of the key elements that are used in the applications of smart cities. Therefore, this paper aims to provide a design to add more smart applications to the sanctuary and other compounds based on wireless sensor networks using ZigBee technology. The transition from reliance on the style of surveillance and controlled manually by staff to apply the principles of smart applications through wireless sensor network which provides the ability to getting all the necessary information and capabilities of controlling and monitoring are required to automatically and thus saving the time, effort, and money. The system proposed in this paper to design a smart monitoring system at the campus to control the opening and closing of the doors of many halls and the possibility of including lighting systems and appliances. The results obtained from OPNET program show that the network topology, which used within a ZigBee network vary in terms of performance, thus giving options for designers to build their network and choose technologies that suit their project.

Influence of Mobility Models in Precision Spray Aided by Wireless Sensor Networks

International Nuclear Information System (INIS)

Gonçalves, L B L; Neves, L A; Zafalon, G F D; Costa, F G; Ueyama, J; Montez, C; Pinto, A S R

2015-01-01

Precision Spray is a technique to increase performance of Precision Agriculture. This spray technique may be aided by a Wireless Sensor Network, however, for such approach, the communication between the agricultural input applicator vehicle and network is critical due to its proper functioning. Thus, this work analyzes how the number of nodes in a wireless sensor network, its type of distribution and different areas of scenario affects the performance of communication. We performed simulations to observe system's behavior changing to find the most fitted non-controlled mobility model to the system

Current distribution in conducting nanowire networks

Science.gov (United States)

Kumar, Ankush; Vidhyadhiraja, N. S.; Kulkarni, Giridhar U.

2017-07-01

Conducting nanowire networks find diverse applications in solar cells, touch-screens, transparent heaters, sensors, and various related transparent conducting electrode (TCE) devices. The performances of these devices depend on effective resistance, transmittance, and local current distribution in these networks. Although, there have been rigorous studies addressing resistance and transmittance in TCE, not much attention is paid on studying the distribution of current. Present work addresses this compelling issue of understanding current distribution in TCE networks using analytical as well as Monte-Carlo approaches. We quantified the current carrying backbone region against isolated and dangling regions as a function of wire density (ranging from percolation threshold to many multiples of threshold) and compared the wired connectivity with those obtained from template-based methods. Further, the current distribution in the obtained backbone is studied using Kirchhoff's law, which reveals that a significant fraction of the backbone (which is believed to be an active current component) may not be active for end-to-end current transport due to the formation of intervening circular loops. The study shows that conducting wire based networks possess hot spots (extremely high current carrying regions) which can be potential sources of failure. The fraction of these hot spots is found to decrease with increase in wire density, while they are completely absent in template based networks. Thus, the present work discusses unexplored issues related to current distribution in conducting networks, which are necessary to choose the optimum network for best TCE applications.

Increased Efficiency of Face Recognition System using Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Rajani Muraleedharan

2006-02-01

Full Text Available This research was inspired by the need of a flexible and cost effective biometric security system. The flexibility of the wireless sensor network makes it a natural choice for data transmission. Swarm intelligence (SI is used to optimize routing in distributed time varying network. In this paper, SI maintains the required bit error rate (BER for varied channel conditions while consuming minimal energy. A specific biometric, the face recognition system, is discussed as an example. Simulation shows that the wireless sensor network is efficient in energy consumption while keeping the transmission accuracy, and the wireless face recognition system is competitive to the traditional wired face recognition system in classification accuracy.

Resource Discovery in Activity-Based Sensor Networks

DEFF Research Database (Denmark)

Bucur, Doina; Bardram, Jakob

This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level concept of computational activities (as logical bundles of data and resources) to give sensors in Activity-Based Sensor Networks...... (ABSNs) knowledge about their usage even at the network layer. ABSN redesigns classical network-level service discovery protocols to include and use this logical structuring of the network for a more practically applicable service discovery scheme. Noting that in practical settings activity-based sensor...

In-node cognitive power control in Wireless Sensor Networks

NARCIS (Netherlands)

Chincoli, Michele; Liotta, Antonio

2017-01-01

Reliability, interoperability and efficiency are fundamental in Wireless Sensor Network deployment. Herein we look at how transmission power control may be used to reduce interference, which is particularly problematic in high-density conditions. We adopt a distributed approach where every node has

Cluster-based service discovery for heterogeneous wireless sensor networks

NARCIS (Netherlands)

Marin Perianu, Raluca; Scholten, Johan; Havinga, Paul J.M.; Hartel, Pieter H.

2007-01-01

We propose an energy-efficient service discovery protocol for heterogeneous wireless sensor networks. Our solution exploits a cluster overlay, where the clusterhead nodes form a distributed service registry. A service lookup results in visiting only the clusterhead nodes. We aim for minimizing the

Network hydraulics inclusion in water quality event detection using multiple sensor stations data.

Science.gov (United States)

Oliker, Nurit; Ostfeld, Avi

2015-09-01

Event detection is one of the current most challenging topics in water distribution systems analysis: how regular on-line hydraulic (e.g., pressure, flow) and water quality (e.g., pH, residual chlorine, turbidity) measurements at different network locations can be efficiently utilized to detect water quality contamination events. This study describes an integrated event detection model which combines multiple sensor stations data with network hydraulics. To date event detection modelling is likely limited to single sensor station location and dataset. Single sensor station models are detached from network hydraulics insights and as a result might be significantly exposed to false positive alarms. This work is aimed at decreasing this limitation through integrating local and spatial hydraulic data understanding into an event detection model. The spatial analysis complements the local event detection effort through discovering events with lower signatures by exploring the sensors mutual hydraulic influences. The unique contribution of this study is in incorporating hydraulic simulation information into the overall event detection process of spatially distributed sensors. The methodology is demonstrated on two example applications using base runs and sensitivity analyses. Results show a clear advantage of the suggested model over single-sensor event detection schemes. Copyright © 2015 Elsevier Ltd. All rights reserved.

Location-Aware Dynamic Session-Key Management for Grid-Based Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

I-Hsien Lin

2010-08-01

Full Text Available Security is a critical issue for sensor networks used in hostile environments. When wireless sensor nodes in a wireless sensor network are distributed in an insecure hostile environment, the sensor nodes must be protected: a secret key must be used to protect the nodes transmitting messages. If the nodes are not protected and become compromised, many types of attacks against the network may result. Such is the case with existing schemes, which are vulnerable to attacks because they mostly provide a hop-by-hop paradigm, which is insufficient to defend against known attacks. We propose a location-aware dynamic session-key management protocol for grid-based wireless sensor networks. The proposed protocol improves the security of a secret key. The proposed scheme also includes a key that is dynamically updated. This dynamic update can lower the probability of the key being guessed correctly. Thus currently known attacks can be defended. By utilizing the local information, the proposed scheme can also limit the flooding region in order to reduce the energy that is consumed in discovering routing paths.

Secure Wireless Sensor Networks: Problems and Solutions

Directory of Open Access Journals (Sweden)

Fei Hu

2003-08-01

Full Text Available As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis was placed on security. This paper analyzes security challenges in wireless sensor networks and summarizes key issues that should be solved for achieving the ad hoc security. It gives an overview of the current state of solutions on such key issues as secure routing, prevention of denial-of-service and key management service. We also present some secure methods to achieve security in wireless sensor networks. Finally we present our integrated approach to securing sensor networks.

A Novel Optical Sensor Platform Designed for Wireless Sensor Networks

International Nuclear Information System (INIS)

Yang, Shuo; Zhou, Bochao; Sun, Tong; Grattan, Kenneth T V

2013-01-01

This paper presents a novel design of an optical sensor platform, enabling effective integration of a number of optical fibre ('wired') sensors with wireless sensor networks (WSNs). In this work, a fibre Bragg grating-based temperature sensor with low power consumption is specially designed as a sensing module and integrated successfully into a WSN, making full use of the advantages arising from both the advanced optical sensor designs and the powerful network functionalities resident in WSNs. The platform is expected to make an important impact on many applications, where either the conventional optical sensor designs or WSNs alone cannot meet the requirements.

Cooperative robots and sensor networks 2014

CERN Document Server

Khelil, Abdelmajid

2014-01-01

This book is the second volume on Cooperative Robots and Sensor Networks. The primary objective of this book is to provide an up-to-date reference for cutting-edge studies and research trends related to mobile robots and wireless sensor networks, and in particular for the coupling between them. Indeed, mobile robots and wireless sensor networks have enabled great potentials and a large space for ubiquitous and pervasive applications. Robotics and wireless sensor networks have mostly been considered as separate research fields and little work has investigated the marriage between these two technologies. However, these two technologies share several features, enable common cyber-physical applications and provide complementary support to each other. The book consists of ten chapters, organized into four parts. The first part of the book presents three chapters related to localization of mobile robots using wireless sensor networks. Two chapters presented new solutions based Extended Kalman Filter and Particle Fi...

Wireless Sensor Network Security Analysis

OpenAIRE

Hemanta Kumar Kalita; Avijit Kar

2009-01-01

The emergence of sensor networks as one of the dominant technology trends in the coming decades hasposed numerous unique challenges to researchers. These networks are likely to be composed of hundreds,and potentially thousands of tiny sensor nodes, functioning autonomously, and in many cases, withoutaccess to renewable energy resources. Cost constraints and the need for ubiquitous, invisibledeployments will result in small sized, resource-constrained sensor nodes. While the set of challenges ...

Services in wireless sensor networks modelling and optimisation for the efficient discovery of services

CERN Document Server

Becker, Markus

2014-01-01

In recent years, originally static and single purpose Wireless Sensor Networks have moved towards applications that need support for mobility and multiple purposes. These heterogeneous applications and services demand for a framework which distributes and discovers the various services, so that other pieces of equipment can use them. Markus Becker studies, extends, analytically models, simulates and employs the so called Trickle algorithm in measurements in a Wireless Sensor Network test bed for the service distribution. The obtained results apply to the application of the Trickle algorithm at

On Connected Target k-Coverage in Heterogeneous Wireless Sensor Networks.

Science.gov (United States)

Yu, Jiguo; Chen, Ying; Ma, Liran; Huang, Baogui; Cheng, Xiuzhen

2016-01-15

Coverage and connectivity are two important performance evaluation indices for wireless sensor networks (WSNs). In this paper, we focus on the connected target k-coverage (CTC k) problem in heterogeneous wireless sensor networks (HWSNs). A centralized connected target k-coverage algorithm (CCTC k) and a distributed connected target k-coverage algorithm (DCTC k) are proposed so as to generate connected cover sets for energy-efficient connectivity and coverage maintenance. To be specific, our proposed algorithms aim at achieving minimum connected target k-coverage, where each target in the monitored region is covered by at least k active sensor nodes. In addition, these two algorithms strive to minimize the total number of active sensor nodes and guarantee that each sensor node is connected to a sink, such that the sensed data can be forwarded to the sink. Our theoretical analysis and simulation results show that our proposed algorithms outperform a state-of-art connected k-coverage protocol for HWSNs.

A Group Neighborhood Average Clock Synchronization Protocol for Wireless Sensor Networks

Science.gov (United States)

Lin, Lin; Ma, Shiwei; Ma, Maode

2014-01-01

Clock synchronization is a very important issue for the applications of wireless sensor networks. The sensors need to keep a strict clock so that users can know exactly what happens in the monitoring area at the same time. This paper proposes a novel internal distributed clock synchronization solution using group neighborhood average. Each sensor node collects the offset and skew rate of the neighbors. Group averaging of offset and skew rate value are calculated instead of conventional point-to-point averaging method. The sensor node then returns compensated value back to the neighbors. The propagation delay is considered and compensated. The analytical analysis of offset and skew compensation is presented. Simulation results validate the effectiveness of the protocol and reveal that the protocol allows sensor networks to quickly establish a consensus clock and maintain a small deviation from the consensus clock. PMID:25120163

A novel design of an automatic lighting control system for a wireless sensor network with increased sensor lifetime and reduced sensor numbers.

Science.gov (United States)

Mohamaddoust, Reza; Haghighat, Abolfazl Toroghi; Sharif, Mohamad Javad Motahari; Capanni, Niccolo

2011-01-01

Wireless sensor networks (WSN) are currently being applied to energy conservation applications such as light control. We propose a design for such a system called a lighting automatic control system (LACS). The LACS system contains a centralized or distributed architecture determined by application requirements and space usage. The system optimizes the calculations and communications for lighting intensity, incorporates user illumination requirements according to their activities and performs adjustments based on external lighting effects in external sensor and external sensor-less architectures. Methods are proposed for reducing the number of sensors required and increasing the lifetime of those used, for considerably reduced energy consumption. Additionally we suggest methods for improving uniformity of illuminance distribution on a workplane's surface, which improves user satisfaction. Finally simulation results are presented to verify the effectiveness of our design.

Data mining techniques in sensor networks summarization, interpolation and surveillance

CERN Document Server

Appice, Annalisa; Fumarola, Fabio; Malerba, Donato

2013-01-01

Sensor networks comprise of a number of sensors installed across a spatially distributed network, which gather information and periodically feed a central server with the measured data. The server monitors the data, issues possible alarms and computes fast aggregates. As data analysis requests may concern both present and past data, the server is forced to store the entire stream. But the limited storage capacity of a server may reduce the amount of data stored on the disk. One solution is to compute summaries of the data as it arrives, and to use these summaries to interpolate the real data.

Evaluating a Novel Cellular Automata-Based Distributed Power Management Approach for Mobile Wireless Sensor Networks

Science.gov (United States)

Adabi, Sepideh; Adabi, Sahar; Rezaee, Ali

According to the traditional definition of Wireless Sensor Networks (WSNs), static sensors have limited the feasibility of WSNs in some kind of approaches, so the mobility was introduced in WSN. Mobile nodes in a WSN come equipped with battery and from the point of deployment, this battery reserve becomes a valuable resource since it cannot be replenished. Hence, maximizing the network lifetime by minimizing the energy is an important challenge in Mobile WSN. Energy conservation can be accomplished by different approaches. In this paper, we presented an energy conservation solution based on Cellular Automata. The main objective of this solution is based on dynamically adjusting the transmission range and switching between operational states of the sensor nodes.

Study on the effect of sink moving trajectory on wireless sensor networks

Science.gov (United States)

Zhong, Peijun; Ruan, Feng

2018-03-01

Wireless sensor networks are developing very fast in recent years, due to their wide potential applications. However there exists the so-called hot spot problem, namely the nodes close to static sink node tend to die earlier than other nodes since they have heavier burden to forward. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we make extensive experimental simulations for circular sensor network, with one mobile sink moving along different radius circumference. The whole network is divided into several clusters and there is one cluster head (CH) inside each cluster. The ordinary sensors communicate with CH and CHs construct a chain until the sink node. Simulation results show that the best network performance appears when sink moves along 0.25 R in terms of network lifetime.

Scalable Coverage Maintenance for Dense Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jun Lu

2007-06-01

Full Text Available Owing to numerous potential applications, wireless sensor networks have been attracting significant research effort recently. The critical challenge that wireless sensor networks often face is to sustain long-term operation on limited battery energy. Coverage maintenance schemes can effectively prolong network lifetime by selecting and employing a subset of sensors in the network to provide sufficient sensing coverage over a target region. We envision future wireless sensor networks composed of a vast number of miniaturized sensors in exceedingly high density. Therefore, the key issue of coverage maintenance for future sensor networks is the scalability to sensor deployment density. In this paper, we propose a novel coverage maintenance scheme, scalable coverage maintenance (SCOM, which is scalable to sensor deployment density in terms of communication overhead (i.e., number of transmitted and received beacons and computational complexity (i.e., time and space complexity. In addition, SCOM achieves high energy efficiency and load balancing over different sensors. We have validated our claims through both analysis and simulations.

Wireless Sensor Network Safety Study

OpenAIRE

M.Shankar; Dr.M.Sridar; Dr.M.Rajani

2012-01-01

Few security mechanisms in wireless sensor networks (WSNs) have been implemented, and even fewer have been applied in real deployments. The limited resources of each sensor node makes security in WSNs hard, as the tradeoff between security and practicality must be carefully considered. These complex systems include in their design different types of information and communication technology systems, such as wireless (mesh) sensor networks, to carry out control processes in real time. This fact...

Application of «Sensor signal analysis network» complex for distributed, time synchronized analysis of electromagnetic radiation

Science.gov (United States)

Mochalov, Vladimir; Mochalova, Anastasia

2017-10-01

The paper considers a developing software-hardware complex «Sensor signal analysis network» for distributed and time synchronized analysis of electromagnetic radiations. The areas of application and the main features of the complex are described. An example of application of the complex to monitor natural electromagnetic radiation sources is considered based on the data recorded in VLF range. A generalized functional scheme of stream analysis of signals by a complex functional node is suggested and its application for stream detection of atmospherics, whistlers and tweaks is considered.

Maximizing lifetime of wireless sensor networks using genetic approach

DEFF Research Database (Denmark)

Wagh, Sanjeev; Prasad, Ramjee

2014-01-01

The wireless sensor networks are designed to install the smart network applications or network for emergency solutions, where human interaction is not possible. The nodes in wireless sensor networks have to self organize as per the users requirements through monitoring environments. As the sensor......-objective parameters are considered to solve the problem using genetic algorithm of evolutionary approach.......The wireless sensor networks are designed to install the smart network applications or network for emergency solutions, where human interaction is not possible. The nodes in wireless sensor networks have to self organize as per the users requirements through monitoring environments. As the sensor...

Maximization of Energy Efficiency in Wireless ad hoc and Sensor Networks With SERENA

Directory of Open Access Journals (Sweden)

Saoucene Mahfoudh

2009-01-01

Full Text Available In wireless ad hoc and sensor networks, an analysis of the node energy consumption distribution shows that the largest part is due to the time spent in the idle state. This result is at the origin of SERENA, an algorithm to SchEdule RoutEr Nodes Activity. SERENA allows router nodes to sleep, while ensuring end-to-end communication in the wireless network. It is a localized and decentralized algorithm assigning time slots to nodes. Any node stays awake only during its slot and the slots assigned to its neighbors, it sleeps the remaining time. Simulation results show that SERENA enables us to maximize network lifetime while increasing the number of user messages delivered. SERENA is based on a two-hop coloring algorithm, whose complexity in terms of colors and rounds is evaluated. We then quantify the slot reuse. Finally, we show how SERENA improves the node energy consumption distribution and maximizes the energy efficiency of wireless ad hoc and sensor networks. We compare SERENA with classical TDMA and optimized variants such as USAP in wireless ad hoc and sensor networks.

Physical Layer Secret-Key Generation Scheme for Transportation Security Sensor Network.

Science.gov (United States)

Yang, Bin; Zhang, Jianfeng

2017-06-28

Wireless Sensor Networks (WSNs) are widely used in different disciplines, including transportation systems, agriculture field environment monitoring, healthcare systems, and industrial monitoring. The security challenge of the wireless communication link between sensor nodes is critical in WSNs. In this paper, we propose a new physical layer secret-key generation scheme for transportation security sensor network. The scheme is based on the cooperation of all the sensor nodes, thus avoiding the key distribution process, which increases the security of the system. Different passive and active attack models are analyzed in this paper. We also prove that when the cooperative node number is large enough, even when the eavesdropper is equipped with multiple antennas, the secret-key is still secure. Numerical results are performed to show the efficiency of the proposed scheme.

Energy-Efficiency Analysis of a Distributed Queuing Medium Access Control Protocol for Biomedical Wireless Sensor Networks in Saturation Conditions

Directory of Open Access Journals (Sweden)

Christos Verikoukis

2011-01-01

Full Text Available The aging population and the high quality of life expectations in our society lead to the need of more efficient and affordable healthcare solutions. For this reason, this paper aims for the optimization of Medium Access Control (MAC protocols for biomedical wireless sensor networks or wireless Body Sensor Networks (BSNs. The hereby presented schemes always have in mind the efficient management of channel resources and the overall minimization of sensors’ energy consumption in order to prolong sensors’ battery life. The fact that the IEEE 802.15.4 MAC does not fully satisfy BSN requirements highlights the need for the design of new scalable MAC solutions, which guarantee low-power consumption to the maximum number of body sensors in high density areas (i.e., in saturation conditions. In order to emphasize IEEE 802.15.4 MAC limitations, this article presents a detailed overview of this de facto standard for Wireless Sensor Networks (WSNs, which serves as a link for the introduction and initial description of our here proposed Distributed Queuing (DQ MAC protocol for BSN scenarios. Within this framework, an extensive DQ MAC energy-consumption analysis in saturation conditions is presented to be able to evaluate its performance in relation to IEEE 802.5.4 MAC in highly dense BSNs. The obtained results show that the proposed scheme outperforms IEEE 802.15.4 MAC in average energy consumption per information bit, thus providing a better overall performance that scales appropriately to BSNs under high traffic conditions. These benefits are obtained by eliminating back-off periods and collisions in data packet transmissions, while minimizing the control overhead.

7th China Conference on Wireless Sensor Networks

CERN Document Server

Cui, Li; Guo, Zhongwen

2014-01-01

Advanced Technologies in Ad Hoc and Sensor Networks collects selected papers from the 7th China Conference on Wireless Sensor Networks (CWSN2013) held in Qingdao, October 17-19, 2013. The book features state-of-the-art studies on Sensor Networks in China with the theme of “Advances in wireless sensor networks of China”. The selected works can help promote development of sensor network technology towards interconnectivity, resource sharing, flexibility and high efficiency. Researchers and engineers in the field of sensor networks can benefit from the book. Xue Wang is a professor at Tsinghua University; Li Cui is a professor at Institute of Computing Technology, Chinese Academy of Sciences; Zhongwen Guo is a professor at Ocean University of China.

A Distributed Data Acquisition System for the Sensor Network of the TAWARA_RTM Project

Science.gov (United States)

Fontana, Cristiano Lino; Donati, Massimiliano; Cester, Davide; Fanucci, Luca; Iovene, Alessandro; Swiderski, Lukasz; Moretto, Sandra; Moszynski, Marek; Olejnik, Anna; Ruiu, Alessio; Stevanato, Luca; Batsch, Tadeusz; Tintori, Carlo; Lunardon, Marcello

This paper describes a distributed Data Acquisition System (DAQ) developed for the TAWARA_RTM project (TAp WAter RAdioactivity Real Time Monitor). The aim is detecting the presence of radioactive contaminants in drinking water; in order to prevent deliberate or accidental threats. Employing a set of detectors, it is possible to detect alpha, beta and gamma radiations, from emitters dissolved in water. The Sensor Network (SN) consists of several heterogeneous nodes controlled by a centralized server. The SN cyber-security is guaranteed in order to protect it from external intrusions and malicious acts. The nodes were installed in different locations, along the water treatment processes, in the waterworks plant supplying the aqueduct of Warsaw, Poland. Embedded computers control the simpler nodes, and are directly connected to the SN. Local-PCs (LPCs) control the more complex nodes that consist signal digitizers acquiring data from several detectors. The DAQ in the LPC is split in several processes communicating with sockets in a local sub-network. Each process is dedicated to a very simple task (e.g. data acquisition, data analysis, hydraulics management) in order to have a flexible and fault-tolerant system. The main SN and the local DAQ networks are separated by data routers to ensure the cyber-security.

A Robust Approach for Clock Offset Estimation in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Kim Jang-Sub

2010-01-01

Full Text Available The maximum likelihood estimators (MLEs for the clock phase offset assuming a two-way message exchange mechanism between the nodes of a wireless sensor network were recently derived assuming Gaussian and exponential network delays. However, the MLE performs poorly in the presence of non-Gaussian or nonexponential network delay distributions. Currently, there is a need to develop clock synchronization algorithms that are robust to the distribution of network delays. This paper proposes a clock offset estimator based on the composite particle filter (CPF to cope with the possible asymmetries and non-Gaussianity of the network delay distributions. Also, a variant of the CPF approach based on the bootstrap sampling (BS is shown to exhibit good performance in the presence of reduced number of observations. Computer simulations illustrate that the basic CPF and its BS-based variant present superior performance than MLE under general random network delay distributions such as asymmetric Gaussian, exponential, Gamma, Weibull as well as various mixtures.

Incremental Support Vector Machine Framework for Visual Sensor Networks

Directory of Open Access Journals (Sweden)

Yuichi Motai

2007-01-01

Full Text Available Motivated by the emerging requirements of surveillance networks, we present in this paper an incremental multiclassification support vector machine (SVM technique as a new framework for action classification based on real-time multivideo collected by homogeneous sites. The technique is based on an adaptation of least square SVM (LS-SVM formulation but extends beyond the static image-based learning of current SVM methodologies. In applying the technique, an initial supervised offline learning phase is followed by a visual behavior data acquisition and an online learning phase during which the cluster head performs an ensemble of model aggregations based on the sensor nodes inputs. The cluster head then selectively switches on designated sensor nodes for future incremental learning. Combining sensor data offers an improvement over single camera sensing especially when the latter has an occluded view of the target object. The optimization involved alleviates the burdens of power consumption and communication bandwidth requirements. The resulting misclassification error rate, the iterative error reduction rate of the proposed incremental learning, and the decision fusion technique prove its validity when applied to visual sensor networks. Furthermore, the enabled online learning allows an adaptive domain knowledge insertion and offers the advantage of reducing both the model training time and the information storage requirements of the overall system which makes it even more attractive for distributed sensor networks communication.

Security Threats on Wireless Sensor Network Protocols

OpenAIRE

H. Gorine; M. Ramadan Elmezughi

2016-01-01

In this paper, we investigate security issues and challenges facing researchers in wireless sensor networks and countermeasures to resolve them. The broadcast nature of wireless communication makes Wireless Sensor Networks prone to various attacks. Due to resources limitation constraint in terms of limited energy, computation power and memory, security in wireless sensor networks creates different challenges than wired network security. We will discuss several attempts at addressing the issue...

Constructing Battery-Aware Virtual Backbones in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Yang Yuanyuan

2007-01-01

Full Text Available A critical issue in battery-powered sensor networks is to construct energy efficient virtual backbones for network routing. Recent study in battery technology reveals that batteries tend to discharge more power than needed and reimburse the over-discharged power if they are recovered. In this paper we first provide a mathematical battery model suitable for implementation in sensor networks. We then introduce the concept of battery-aware connected dominating set (BACDS and show that in general the minimum BACDS (MBACDS can achieve longer lifetime than the previous backbone structures. Then we show that finding a MBACDS is NP-hard and give a distributed approximation algorithm to construct the BACDS. The resulting BACDS constructed by our algorithm is at most opt size, where is the maximum node degree and opt is the size of an optimal BACDS. Simulation results show that the BACDS can save a significant amount of energy and achieve up to longer network lifetime than previous schemes.

A Group Neighborhood Average Clock Synchronization Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Lin Lin

2014-08-01

Full Text Available Clock synchronization is a very important issue for the applications of wireless sensor networks. The sensors need to keep a strict clock so that users can know exactly what happens in the monitoring area at the same time. This paper proposes a novel internal distributed clock synchronization solution using group neighborhood average. Each sensor node collects the offset and skew rate of the neighbors. Group averaging of offset and skew rate value are calculated instead of conventional point-to-point averaging method. The sensor node then returns compensated value back to the neighbors. The propagation delay is considered and compensated. The analytical analysis of offset and skew compensation is presented. Simulation results validate the effectiveness of the protocol and reveal that the protocol allows sensor networks to quickly establish a consensus clock and maintain a small deviation from the consensus clock.

Cluster-based Data Gathering in Long-Strip Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

FANG, W.

2012-02-01

Full Text Available This paper investigates a special class of wireless sensor networks that are different from traditional ones in that the sensor nodes in this class of networks are deployed along narrowly elongated geographical areas and form a long-strip topology. According to hardware capabilities of current sensor nodes, a cluster-based protocol for reliable and efficient data gathering in long-strip wireless sensor networks (LSWSN is proposed. A well-distributed cluster-based architecture is first formed in the whole network through contention-based cluster head election. Cluster heads are responsible for coordination among the nodes within their clusters and aggregation of their sensory data, as well as transmission the data to the sink node on behalf of their own clusters. The intra-cluster coordination is based on the traditional TDMA schedule, in which the inter-cluster interference caused by the border nodes is solved by the multi-channel communication technique. The cluster reporting is based on the CSMA contention, in which a connected overlay network is formed by relay nodes to forward the data from the cluster heads through multi-hops to the sink node. The relay nodes are non-uniformly deployed to resolve the energy-hole problem which is extremely serious in the LSWSN. Extensive simulation results illuminate the distinguished performance of the proposed protocol.

A Parameter Communication Optimization Strategy for Distributed Machine Learning in Sensors.

Science.gov (United States)

Zhang, Jilin; Tu, Hangdi; Ren, Yongjian; Wan, Jian; Zhou, Li; Li, Mingwei; Wang, Jue; Yu, Lifeng; Zhao, Chang; Zhang, Lei

2017-09-21

In order to utilize the distributed characteristic of sensors, distributed machine learning has become the mainstream approach, but the different computing capability of sensors and network delays greatly influence the accuracy and the convergence rate of the machine learning model. Our paper describes a reasonable parameter communication optimization strategy to balance the training overhead and the communication overhead. We extend the fault tolerance of iterative-convergent machine learning algorithms and propose the Dynamic Finite Fault Tolerance (DFFT). Based on the DFFT, we implement a parameter communication optimization strategy for distributed machine learning, named Dynamic Synchronous Parallel Strategy (DSP), which uses the performance monitoring model to dynamically adjust the parameter synchronization strategy between worker nodes and the Parameter Server (PS). This strategy makes full use of the computing power of each sensor, ensures the accuracy of the machine learning model, and avoids the situation that the model training is disturbed by any tasks unrelated to the sensors.

An analytic Study of the Key Factors In uencing the Design and Routing Techniques of a Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Yogita Bahuguna

2017-03-01

Full Text Available A wireless sensor network contains various nodes having certain sensing, processing and communication capabilities. Actually they are multifunctional battery operated nodes called motes. These motes are small in size and battery constrained. They are operated by a power source. A wireless sensor network consists of a huge number of tiny sensor nodes which are deployed either randomly or according to some predefined distribution. The sensors nodes in a sensor network are cooperative among themselves having self-organizing ability. This ensures that a wireless network serves a wide variety of applications. Few of them are weather monitoring, health, security and military etc. As their applications are wide, this requires that sensors in a sensor network must play their role very efficiently. But, as discussed above, the sensor nodes have energy limitation. This limitation leads failure of nodes after certain round of communication. So, a sensor network suffers with sensors having energy limitations. Beside this, sensor nodes in a sensor network must fulfill connectivity and coverage requirements. In this paper, we have discussed various issues affecting the design of a wireless sensor network. This provides the readers various research issues in designing a wireless sensor network.

A Novel Design of an Automatic Lighting Control System for a Wireless Sensor Network with Increased Sensor Lifetime and Reduced Sensor Numbers

Science.gov (United States)

Mohamaddoust, Reza; Haghighat, Abolfazl Toroghi; Sharif, Mohamad Javad Motahari; Capanni, Niccolo

2011-01-01

Wireless sensor networks (WSN) are currently being applied to energy conservation applications such as light control. We propose a design for such a system called a Lighting Automatic Control System (LACS). The LACS system contains a centralized or distributed architecture determined by application requirements and space usage. The system optimizes the calculations and communications for lighting intensity, incorporates user illumination requirements according to their activities and performs adjustments based on external lighting effects in external sensor and external sensor-less architectures. Methods are proposed for reducing the number of sensors required and increasing the lifetime of those used, for considerably reduced energy consumption. Additionally we suggest methods for improving uniformity of illuminance distribution on a workplane’s surface, which improves user satisfaction. Finally simulation results are presented to verify the effectiveness of our design. PMID:22164114

Wireless Sensor Networks for Detection of IED Emplacement

Science.gov (United States)

2009-06-01

unclassified Standard Form 298 (Rev. 8-98) Prescribed by ANSI Std Z39-18 Abstract We are investigating the use of wireless nonimaging -sensor...networks for the difficult problem of detection of suspicious behavior related to IED emplacement. Hardware for surveillance by nonimaging -sensor networks...with people crossing a live sensor network. We conclude that nonimaging -sensor networks can detect a variety of suspicious behavior, but

Improvement on LEACH Agreement of Mine Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Yun-xiang Liu

2017-05-01

Full Text Available Based on the characteristics of wireless sensor network communication in mine, LEACH protocol clustering is optimized, and the factors of energy and distance are considered fully. The selection of cluster head nodes is optimized, and a routing algorithm based on K-means ++ clustering is proposed. The problem of uneven distribution of cluster head nodes, uneven energy consumption and network stability in LEACH algorithm is improved effectively. Simulation results show that the proposed algorithm can improve the energy consumption of the whole network and improve the energy utilization rate, extending the network life cycle effectively.

IMHRP: Improved Multi-Hop Routing Protocol for Wireless Sensor Networks

Science.gov (United States)

Huang, Jianhua; Ruan, Danwei; Hong, Yadong; Zhao, Ziming; Zheng, Hong

2017-10-01

Wireless sensor network (WSN) is a self-organizing system formed by a large number of low-cost sensor nodes through wireless communication. Sensor nodes collect environmental information and transmit it to the base station (BS). Sensor nodes usually have very limited battery energy. The batteries cannot be charged or replaced. Therefore, it is necessary to design an energy efficient routing protocol to maximize the network lifetime. This paper presents an improved multi-hop routing protocol (IMHRP) for homogeneous networks. In the IMHRP protocol, based on the distances to the BS, the CH nodes are divided into internal CH nodes and external CH nodes. The set-up phase of the protocol is based on the LEACH protocol and the minimum distance between CH nodes are limited to a special constant distance, so a more uniform distribution of CH nodes is achieved. In the steady-state phase, the routes of different CH nodes are created on the basis of the distances between the CH nodes. The energy efficiency of communication can be maximized. The simulation results show that the proposed algorithm can more effectively reduce the energy consumption of each round and prolong the network lifetime compared with LEACH protocol and MHT protocol.

Communications for unattended sensor networks

Science.gov (United States)

Nemeroff, Jay L.; Angelini, Paul; Orpilla, Mont; Garcia, Luis; DiPierro, Stefano

2004-07-01

The future model of the US Army's Future Combat Systems (FCS) and the Future Force reflects a combat force that utilizes lighter armor protection than the current standard. Survival on the future battlefield will be increased by the use of advanced situational awareness provided by unattended tactical and urban sensors that detect, identify, and track enemy targets and threats. Successful implementation of these critical sensor fields requires the development of advanced sensors, sensor and data-fusion processors, and a specialized communications network. To ensure warfighter and asset survivability, the communications must be capable of near real-time dissemination of the sensor data using robust, secure, stealthy, and jam resistant links so that the proper and decisive action can be taken. Communications will be provided to a wide-array of mission-specific sensors that are capable of processing data from acoustic, magnetic, seismic, and/or Chemical, Biological, Radiological, and Nuclear (CBRN) sensors. Other, more powerful, sensor node configurations will be capable of fusing sensor data and intelligently collect and process data images from infrared or visual imaging cameras. The radio waveform and networking protocols being developed under the Soldier Level Integrated Communications Environment (SLICE) Soldier Radio Waveform (SRW) and the Networked Sensors for the Future Force Advanced Technology Demonstration are part of an effort to develop a common waveform family which will operate across multiple tactical domains including dismounted soldiers, ground sensor, munitions, missiles and robotics. These waveform technologies will ultimately be transitioned to the JTRS library, specifically the Cluster 5 requirement.

Cluster-based Dynamic Energy Management for Collaborative Target Tracking in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Dao-Wei Bi

2007-07-01

Full Text Available A primary criterion of wireless sensor network is energy efficiency. Focused onthe energy problem of target tracking in wireless sensor networks, this paper proposes acluster-based dynamic energy management mechanism. Target tracking problem isformulated by the multi-sensor detection model as well as energy consumption model. Adistributed adaptive clustering approach is investigated to form a reasonable routingframework which has uniform cluster head distribution. Dijkstra’s algorithm is utilized toobtain optimal intra-cluster routing. Target position is predicted by particle filter. Thepredicted target position is adopted to estimate the idle interval of sensor nodes. Hence,dynamic awakening approach is exploited to prolong sleep time of sensor nodes so that theoperation energy consumption of wireless sensor network can be reduced. The sensornodes around the target wake up on time and act as sensing candidates. With the candidatesensor nodes and predicted target position, the optimal sensor node selection is considered.Binary particle swarm optimization is proposed to minimize the total energy consumptionduring collaborative sensing and data reporting. Experimental results verify that theproposed clustering approach establishes a low-energy communication structure while theenergy efficiency of wireless sensor networks is enhanced by cluster-based dynamic energymanagement.

ANALYTICAL MODELING OF INNOVATIVE SENSOR PLACEMENT STRATEGY FOR CORONA-BASED WIRELESS SENSOR NETWORKS

Directory of Open Access Journals (Sweden)

HASSAN H. EKAL

2017-09-01

Full Text Available Wireless Sensor Networks (WSNs applications are increasing rapidly, thanks to their broad potential in ecological monitoring, biomedical health monitoring, data gathering and many others. Imbalance energy of sensors causes significant reduction in the lifetime of the network. In many-to-one communication (corona WSNs, sensor nodes located nearby the data collector (sink forward data sensed data received from other nodes, hence, having heavier workloads. These nodes consume more energy than the others, leading to quicker energy depletion.Consequently, this results in energy hole problem, where the network becomes separate islands, which affect the lifetime of the network negatively. When this situation occurs, the sensed data will not be forwarded to the intended sink; accordingly, the network will not be able to completely fulfil its required tasks. In this paper, an effective sensors placement strategy is proposed to avoid or alleviate energy hole problem in such type of WSNs. The proposed strategy aims to improve, scale, and balance the energy consumption among sensor nodes and to maximize the network lifetime, by sustaining the network coverage and connectivity. To achieve this aim, the number of sensors should be optimized to create sub-balanced coronas in the sense of energy consumption, while satisfying the network coverage and connectivity requirements. The theoretical design and modelling of the proposed sensors placement strategy promise a considerable improvement in the lifetime of corona-based networks. The Experimental evaluation results have shown that the proposed sensors placement strategy is capable to increase the network lifetime considerably compared to conventional uniform strategy.

Outage probability analysis of wireless sensor networks in the presence of channel fading and spatial correlation

KAUST Repository

Al-Murad, Tamim M.

2011-07-01

Evaluating the reliability of wireless sensor networks is becoming more important as theses networks are being used in crucial applications. The outage probability defined as the probability that the error in the system exceeds a maximum acceptable threshold has recently been used as a measure of the reliability of such systems. In this work we find the outage probability of wireless sensor network in different scenarios of distributed sensing where sensors\\' readings are affected by spatial correlation and in the presence of channel fading. © 2011 IEEE.

Using Integer Clocks to Verify the Timing-Sync Sensor Network Protocol

Science.gov (United States)

Huang, Xiaowan; Singh, Anu; Smolka, Scott A.

2010-01-01

We use the UPPAAL model checker for Timed Automata to verify the Timing-Sync time-synchronization protocol for sensor networks (TPSN). The TPSN protocol seeks to provide network-wide synchronization of the distributed clocks in a sensor network. Clock-synchronization algorithms for sensor networks such as TPSN must be able to perform arithmetic on clock values to calculate clock drift and network propagation delays. They must be able to read the value of a local clock and assign it to another local clock. Such operations are not directly supported by the theory of Timed Automata. To overcome this formal-modeling obstacle, we augment the UPPAAL specification language with the integer clock derived type. Integer clocks, which are essentially integer variables that are periodically incremented by a global pulse generator, greatly facilitate the encoding of the operations required to synchronize clocks as in the TPSN protocol. With this integer-clock-based model of TPSN in hand, we use UPPAAL to verify that the protocol achieves network-wide time synchronization and is devoid of deadlock. We also use the UPPAAL Tracer tool to illustrate how integer clocks can be used to capture clock drift and resynchronization during protocol execution

Multi-source feature extraction and target recognition in wireless sensor networks based on adaptive distributed wavelet compression algorithms

Science.gov (United States)

Hortos, William S.

2008-04-01

Proposed distributed wavelet-based algorithms are a means to compress sensor data received at the nodes forming a wireless sensor network (WSN) by exchanging information between neighboring sensor nodes. Local collaboration among nodes compacts the measurements, yielding a reduced fused set with equivalent information at far fewer nodes. Nodes may be equipped with multiple sensor types, each capable of sensing distinct phenomena: thermal, humidity, chemical, voltage, or image signals with low or no frequency content as well as audio, seismic or video signals within defined frequency ranges. Compression of the multi-source data through wavelet-based methods, distributed at active nodes, reduces downstream processing and storage requirements along the paths to sink nodes; it also enables noise suppression and more energy-efficient query routing within the WSN. Targets are first detected by the multiple sensors; then wavelet compression and data fusion are applied to the target returns, followed by feature extraction from the reduced data; feature data are input to target recognition/classification routines; targets are tracked during their sojourns through the area monitored by the WSN. Algorithms to perform these tasks are implemented in a distributed manner, based on a partition of the WSN into clusters of nodes. In this work, a scheme of collaborative processing is applied for hierarchical data aggregation and decorrelation, based on the sensor data itself and any redundant information, enabled by a distributed, in-cluster wavelet transform with lifting that allows multiple levels of resolution. The wavelet-based compression algorithm significantly decreases RF bandwidth and other resource use in target processing tasks. Following wavelet compression, features are extracted. The objective of feature extraction is to maximize the probabilities of correct target classification based on multi-source sensor measurements, while minimizing the resource expenditures at

Time-domain fiber loop ringdown sensor and sensor network

Science.gov (United States)

Kaya, Malik

Optical fibers have been mostly used in fiber optic communications, imaging optics, sensing technology, etc. Fiber optic sensors have gained increasing attention for scientific and structural health monitoring (SHM) applications. In this study, fiber loop ringdown (FLRD) sensors were fabricated for scientific, SHM, and sensor networking applications. FLRD biosensors were fabricated for both bulk refractive index (RI)- and surface RI-based DNA sensing and one type of bacteria sensing. Furthermore, the effect of glucose oxidase (GOD) immobilization at the sensor head on sensor performance was evaluated for both glucose and synthetic urine solutions with glucose concentration between 0.1% and 10%. Detection sensitivities of the glucose sensors were achieved as low as 0.05%. For chemical sensing, heavy water, ranging from 97% to 10%, and several elemental solutions were monitored by using the FLRD chemical sensors. Bulk index-based FLRD sensing showed that trace elements can be detected in deionized water. For physical sensing, water and cracking sensors were fabricated and embedded into concrete. A partially-etched single-mode fiber (SMF) was embedded into a concrete bar for water monitoring while a bare SMF without any treatment was directly embedded into another concrete bar for monitoring cracks. Furthermore, detection sensitivities of water and crack sensors were investigated as 10 ml water and 0.5 mm surface crack width, respectively. Additionally fiber loop ringdown-fiber Bragg grating temperature sensors were developed in the laboratory; two sensor units for water, crack, and temperature sensing were deployed into a concrete cube in a US Department of Energy test bed (Miami, FL). Multi-sensor applications in a real concrete structure were accomplished by testing the six FLRD sensors. As a final stage, a sensor network was assembled by multiplexing two or three FLRD sensors in series and parallel. Additionally, two FLRD sensors were combined in series and

An Energy Efficient Stable Election-Based Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Weiwei Yuan

2013-10-01

Full Text Available Sensor nodes usually have limited energy supply and they are impractical to recharge. How to balance traffic load in sensors in order to increase network lifetime is a very challenging research issue. Many clustering algorithms have been proposed recently for wireless sensor networks (WSNs. However, sensor networks with one fixed sink node often suffer from a hot spots problem since nodes near sinks have more traffic burden to forward during a multi-hop transmission process. The use of mobile sinks has been shown to be an effective technique to enhance network performance features such as latency, energy efficiency, network lifetime, etc. In this paper, a modified Stable Election Protocol (SEP, which employs a mobile sink, has been proposed for WSNs with non-uniform node distribution. The decision of selecting cluster heads by the sink is based on the minimization of the associated additional energy and residual energy at each node. Besides, the cluster head selects the shortest path to reach the sink between the direct approach and the indirect approach with the use of the nearest cluster head. Simulation results demonstrate that our algorithm has better performance than traditional routing algorithms, such as LEACH and SEP.

Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks

NARCIS (Netherlands)

Marin Perianu, Raluca; Scholten, Johan; Havinga, Paul J.M.; Hartel, Pieter H.

We propose an energy-efficient service discovery protocol for wireless sensor networks. Our solution exploits a cluster overlay, where the clusterhead nodes form a distributed service registry. A service lookup results in visiting only the clusterhead nodes. We aim for minimizing the communication

Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks

NARCIS (Netherlands)

Marin Perianu, Raluca; Scholten, Johan; Havinga, Paul J.M.; Hartel, Pieter H.

2006-01-01

We propose an energy-efficient service discovery protocol for wireless sensor networks. Our solution exploits a cluster overlay, where the clusterhead nodes form a distributed service registry. A service lookup results in visiting only the clusterhead nodes. We aim for minimizing the communication

Mobile Sensor Networks for Leak and Backflow Detection in Water Distribution Systems

KAUST Repository

Suresh, M. Agumbe; Smith, L.; Rasekh, A.; Stoleru, R.; Banks, M.K.; Shihada, Basem

2014-01-01

Leak and backflow detection are essential aspects of Water Distribution System (WDS) monitoring. Most existing solutions for leak/backflow detection in WDSs focus on the placement of expensive static sensors located strategically. In contrast to these, we propose a solution whereby mobile sensors (i.e., their movement aided only by the inherent water flow in the system) detect leaks/backflow. Information about the leaks/backflow is collected from the sensors either by physically capturing them, or through wireless communication. Specifically, we propose models to maximize leak/backflow detection given a cost constraint (a limit on the number of sensors). Through extensive simulations, we demonstrate the superior performance of our proposed solution when compared with the state of the art solutions (e.g., algorithms/protocols and analysis).

Mobile Sensor Networks for Leak and Backflow Detection in Water Distribution Systems

KAUST Repository

Suresh, M. Agumbe

2014-05-01

Leak and backflow detection are essential aspects of Water Distribution System (WDS) monitoring. Most existing solutions for leak/backflow detection in WDSs focus on the placement of expensive static sensors located strategically. In contrast to these, we propose a solution whereby mobile sensors (i.e., their movement aided only by the inherent water flow in the system) detect leaks/backflow. Information about the leaks/backflow is collected from the sensors either by physically capturing them, or through wireless communication. Specifically, we propose models to maximize leak/backflow detection given a cost constraint (a limit on the number of sensors). Through extensive simulations, we demonstrate the superior performance of our proposed solution when compared with the state of the art solutions (e.g., algorithms/protocols and analysis).

Low-cost failure sensor design and development for water pipeline distribution systems.

Science.gov (United States)

Khan, K; Widdop, P D; Day, A J; Wood, A S; Mounce, S R; Machell, J

2002-01-01

This paper describes the design and development of a new sensor which is low cost to manufacture and install and is reliable in operation with sufficient accuracy, resolution and repeatability for use in newly developed systems for pipeline monitoring and leakage detection. To provide an appropriate signal, the concept of a "failure" sensor is introduced, in which the output is not necessarily proportional to the input, but is unmistakably affected when an unusual event occurs. The design of this failure sensor is based on the water opacity which can be indicative of an unusual event in a water distribution network. The laboratory work and field trials necessary to design and prove out this type of failure sensor are described here. It is concluded that a low-cost failure sensor of this type has good potential for use in a comprehensive water monitoring and management system based on Artificial Neural Networks (ANN).

Handbook of sensor networks compact wireless and wired sensing systems

CERN Document Server

Ilyas, Mohammad

2004-01-01

INTRODUCTION Opportunities and Challenges in Wireless Sensor Networks, M. Haenggi, Next Generation Technologies to Enable Sensor Networks, J. I.  Goodman, A. I. Reuther, and D. R. Martinez Sensor Networks Management, L. B. Ruiz, J. M. Nogueira, and A. A. F. Loureiro Models for Programmability in Sensor Networks, A. Boulis Miniaturizing Sensor Networks with MEMS, Brett Warneke A Taxonomy of Routing Techniques in Wireless Sensor Networks, J. N. Al-Karaki and A. E. Kamal Artificial Perceptual Systems, A. Loutfi, M. Lindquist, and P. Wide APPLICATIONS Sensor Network Architecture and Appl

Complex networks-based energy-efficient evolution model for wireless sensor networks

Energy Technology Data Exchange (ETDEWEB)

Zhu Hailin [Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, P.O. Box 106, Beijing 100876 (China)], E-mail: zhuhailin19@gmail.com; Luo Hong [Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, P.O. Box 106, Beijing 100876 (China); Peng Haipeng; Li Lixiang; Luo Qun [Information Secure Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China)

2009-08-30

Based on complex networks theory, we present two self-organized energy-efficient models for wireless sensor networks in this paper. The first model constructs the wireless sensor networks according to the connectivity and remaining energy of each sensor node, thus it can produce scale-free networks which have a performance of random error tolerance. In the second model, we not only consider the remaining energy, but also introduce the constraint of links to each node. This model can make the energy consumption of the whole network more balanced. Finally, we present the numerical experiments of the two models.

Complex networks-based energy-efficient evolution model for wireless sensor networks

International Nuclear Information System (INIS)

Zhu Hailin; Luo Hong; Peng Haipeng; Li Lixiang; Luo Qun

2009-01-01

Based on complex networks theory, we present two self-organized energy-efficient models for wireless sensor networks in this paper. The first model constructs the wireless sensor networks according to the connectivity and remaining energy of each sensor node, thus it can produce scale-free networks which have a performance of random error tolerance. In the second model, we not only consider the remaining energy, but also introduce the constraint of links to each node. This model can make the energy consumption of the whole network more balanced. Finally, we present the numerical experiments of the two models.

System-level Modeling of Wireless Integrated Sensor Networks

DEFF Research Database (Denmark)

Virk, Kashif M.; Hansen, Knud; Madsen, Jan

2005-01-01

Wireless integrated sensor networks have emerged as a promising infrastructure for a new generation of monitoring and tracking applications. In order to efficiently utilize the extremely limited resources of wireless sensor nodes, accurate modeling of the key aspects of wireless sensor networks...... is necessary so that system-level design decisions can be made about the hardware and the software (applications and real-time operating system) architecture of sensor nodes. In this paper, we present a SystemC-based abstract modeling framework that enables system-level modeling of sensor network behavior...... by modeling the applications, real-time operating system, sensors, processor, and radio transceiver at the sensor node level and environmental phenomena, including radio signal propagation, at the sensor network level. We demonstrate the potential of our modeling framework by simulating and analyzing a small...

Patrol Detection for Replica Attacks on Wireless Sensor Networks

OpenAIRE

Wang, Liang-Min; Shi, Yang

2011-01-01

Replica attack is a critical concern in the security of wireless sensor networks. We employ mobile nodes as patrollers to detect replicas distributed in different zones in a network, in which a basic patrol detection protocol and two detection algorithms for stationary and mobile modes are presented. Then we perform security analysis to discuss the defense strategies against the possible attacks on the proposed detection protocol. Moreover, we show the advantages of the proposed protocol by d...

Enhanced SWEET protocol for energy efficient wireless sensor networks

CSIR Research Space (South Africa)

Dludla, AG

2013-10-01

Full Text Available operate independently and yet in cohesion, constituting a network through a way of self-organization. MIS’s are characterized by their low transmit power, small-size and inexpensiveness. However, energy management remains a major topic in most research..., Rosenberg, C., ”Homogeneous vs heterogeneous clustered sensor networks: a comparative study,” IEEE International Conference on Communications, pp.3646-3651 Jun. 2004 [4] A. Bari, R. Chaturvedi, A. aekel, S. Bandyopadhyay, “Energy Aware Distributed...

On Applicability of Network Coding Technique for 6LoWPAN-based Sensor Networks.

Science.gov (United States)

Amanowicz, Marek; Krygier, Jaroslaw

2018-05-26

In this paper, the applicability of the network coding technique in 6LoWPAN-based sensor multihop networks is examined. The 6LoWPAN is one of the standards proposed for the Internet of Things architecture. Thus, we can expect the significant growth of traffic in such networks, which can lead to overload and decrease in the sensor network lifetime. The authors propose the inter-session network coding mechanism that can be implemented in resource-limited sensor motes. The solution reduces the overall traffic in the network, and in consequence, the energy consumption is decreased. Used procedures take into account deep header compressions of the native 6LoWPAN packets and the hop-by-hop changes of the header structure. Applied simplifications reduce signaling traffic that is typically occurring in network coding deployments, keeping the solution usefulness for the wireless sensor networks with limited resources. The authors validate the proposed procedures in terms of end-to-end packet delay, packet loss ratio, traffic in the air, total energy consumption, and network lifetime. The solution has been tested in a real wireless sensor network. The results confirm the efficiency of the proposed technique, mostly in delay-tolerant sensor networks.

Efficient and Adaptive Node Selection for Target Tracking in Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Juan Feng

2016-01-01

Full Text Available In target tracking wireless sensor network, choosing the proper working nodes can not only minimize the number of active nodes, but also satisfy the tracking reliability requirement. However, most existing works focus on selecting sensor nodes which are the nearest to the target for tracking missions and they did not consider the correlation of the location of the sensor nodes so that these approaches can not meet all the goals of the network. This work proposes an efficient and adaptive node selection approach for tracking a target in a distributed wireless sensor network. The proposed approach combines the distance-based node selection strategy and particle filter prediction considering the spatial correlation of the different sensing nodes. Moreover, a joint distance weighted measurement is proposed to estimate the information utility of sensing nodes. Experimental results show that EANS outperformed the state-of-the-art approaches by reducing the energy cost and computational complexity as well as guaranteeing the tracking accuracy.

Testing a Firefly-Inspired Synchronization Algorithm in a Complex Wireless Sensor Network.

Science.gov (United States)

Hao, Chuangbo; Song, Ping; Yang, Cheng; Liu, Xiongjun

2017-03-08

Data acquisition is the foundation of soft sensor and data fusion. Distributed data acquisition and its synchronization are the important technologies to ensure the accuracy of soft sensors. As a research topic in bionic science, the firefly-inspired algorithm has attracted widespread attention as a new synchronization method. Aiming at reducing the design difficulty of firefly-inspired synchronization algorithms for Wireless Sensor Networks (WSNs) with complex topologies, this paper presents a firefly-inspired synchronization algorithm based on a multiscale discrete phase model that can optimize the performance tradeoff between the network scalability and synchronization capability in a complex wireless sensor network. The synchronization process can be regarded as a Markov state transition, which ensures the stability of this algorithm. Compared with the Miroll and Steven model and Reachback Firefly Algorithm, the proposed algorithm obtains better stability and performance. Finally, its practicality has been experimentally confirmed using 30 nodes in a real multi-hop topology with low quality links.

Practical Considerations in the Implementation of Collaborative Beamforming on Wireless Sensor Networks.

Science.gov (United States)

Felici-Castell, Santiago; Navarro, Enrique A; Pérez-Solano, Juan J; Segura-García, Jaume; García-Pineda, Miguel

2017-01-26

Wireless Sensor Networks (WSNs) are composed of spatially distributed autonomous sensor devices, named motes. These motes have their own power supply, processing unit, sensors and wireless communications However with many constraints, such as limited energy, bandwidth and computational capabilities. In these networks, at least one mote called a sink, acts as a gateway to connect with other networks. These sensor networks run monitoring applications and then the data gathered by these motes needs to be retrieved by the sink. When this sink is located in the far field, there have been many proposals in the literature based on Collaborative Beamforming (CB), also known as Distributed or Cooperative Beamforming, for these long range communications to reach the sink. In this paper, we conduct a thorough study of the related work and analyze the requirements to do CB. In order to implement these communications in real scenarios, we will consider if these requirements and the assumptions made are feasible from the point of view of commercial motes and their constraints. In addition, we will go a step further and will consider different alternatives, by relaxing these requirements, trying to find feasible assumptions to carry out these types of communications with commercial motes. This research considers the nonavailability of a central clock that synchronizes all motes in the WSN, and all motes have identical hardware. This is a feasibility study to do CB on WSN, using a simulated scenario with randomized delays obtained from experimental data from commercial motes.

A New Energy-Efficient Data Transmission Scheme Based on DSC and Virtual MIMO for Wireless Sensor Network

OpenAIRE

Li, Na; Zhang, Liwen; Li, Bing

2015-01-01

Energy efficiency in wireless sensor network (WSN) is one of the primary performance parameters. For improving the energy efficiency of WSN, we introduce distributed source coding (DSC) and virtual multiple-input multiple-output (MIMO) into wireless sensor network and then propose a new data transmission scheme called DSC-MIMO. DSC-MIMO compresses the source data using distributed source coding before transmitting, which is different from the existing communication schemes. Data compression c...

Distributed Software-Attestation Defense against Sensor Worm Propagation

Directory of Open Access Journals (Sweden)

Jun-Won Ho

2015-01-01

Full Text Available Wireless sensor networks are vulnerable to sensor worm attacks in which the attacker compromises a few nodes and makes these compromised nodes initiate worm spread over the network, targeting the worm infection of the whole nodes in the network. Several defense mechanisms have been proposed to prevent worm propagation in wireless sensor networks. Although these proposed schemes use software diversity technique for worm propagation prevention under the belief that different software versions do not have common vulnerability, they have fundamental drawback in which it is difficult to realize the aforementioned belief in sensor motes. To resolve this problem, we propose on-demand software-attestation based scheme to defend against worm propagation in sensor network. The main idea of our proposed scheme is to perform software attestations against sensor nodes in on-demand manner and detect the infected nodes by worm, resulting in worm propagation block in the network. Through analysis, we show that our proposed scheme defends against worm propagation in efficient and robust manner. Through simulation, we demonstrate that our proposed scheme stops worm propagation at the reasonable overhead while preventing a majority of sensor nodes from being infected by worm.

Distributed adaptive diagnosis of sensor faults using structural response data

Science.gov (United States)

Dragos, Kosmas; Smarsly, Kay

2016-10-01

The reliability and consistency of wireless structural health monitoring (SHM) systems can be compromised by sensor faults, leading to miscalibrations, corrupted data, or even data loss. Several research approaches towards fault diagnosis, referred to as ‘analytical redundancy’, have been proposed that analyze the correlations between different sensor outputs. In wireless SHM, most analytical redundancy approaches require centralized data storage on a server for data analysis, while other approaches exploit the on-board computing capabilities of wireless sensor nodes, analyzing the raw sensor data directly on board. However, using raw sensor data poses an operational constraint due to the limited power resources of wireless sensor nodes. In this paper, a new distributed autonomous approach towards sensor fault diagnosis based on processed structural response data is presented. The inherent correlations among Fourier amplitudes of acceleration response data, at peaks corresponding to the eigenfrequencies of the structure, are used for diagnosis of abnormal sensor outputs at a given structural condition. Representing an entirely data-driven analytical redundancy approach that does not require any a priori knowledge of the monitored structure or of the SHM system, artificial neural networks (ANN) are embedded into the sensor nodes enabling cooperative fault diagnosis in a fully decentralized manner. The distributed analytical redundancy approach is implemented into a wireless SHM system and validated in laboratory experiments, demonstrating the ability of wireless sensor nodes to self-diagnose sensor faults accurately and efficiently with minimal data traffic. Besides enabling distributed autonomous fault diagnosis, the embedded ANNs are able to adapt to the actual condition of the structure, thus ensuring accurate and efficient fault diagnosis even in case of structural changes.

Dynamic Sensor Networks

National Research Council Canada - National Science Library

Schott, Brian

2004-01-01

...: Declarative Languages and Execution Environment includes topographical soldier interface and a sensor network simulation environment for algorithm development, deployment planning, and operational support. Finally, Task 3...

Adapting Mobile Beacon-Assisted Localization in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Wei Dong

2009-04-01

Full Text Available The ability to automatically locate sensor nodes is essential in many Wireless Sensor Network (WSN applications. To reduce the number of beacons, many mobile-assisted approaches have been proposed. Current mobile-assisted approaches for localization require special hardware or belong to centralized localization algorithms involving some deterministic approaches due to the fact that they explicitly consider the impreciseness of location estimates. In this paper, we first propose a range-free, distributed and probabilistic Mobile Beacon-assisted Localization (MBL approach for static WSNs. Then, we propose another approach based on MBL, called Adapting MBL (A-MBL, to increase the efficiency and accuracy of MBL by adapting the size of sample sets and the parameter of the dynamic model during the estimation process. Evaluation results show that the accuracy of MBL and A-MBL outperform both Mobile and Static sensor network Localization (MSL and Arrival and Departure Overlap (ADO when both of them use only a single mobile beacon for localization in static WSNs.

Adapting mobile beacon-assisted localization in wireless sensor networks.

Science.gov (United States)

Teng, Guodong; Zheng, Kougen; Dong, Wei

2009-01-01

The ability to automatically locate sensor nodes is essential in many Wireless Sensor Network (WSN) applications. To reduce the number of beacons, many mobile-assisted approaches have been proposed. Current mobile-assisted approaches for localization require special hardware or belong to centralized localization algorithms involving some deterministic approaches due to the fact that they explicitly consider the impreciseness of location estimates. In this paper, we first propose a range-free, distributed and probabilistic Mobile Beacon-assisted Localization (MBL) approach for static WSNs. Then, we propose another approach based on MBL, called Adapting MBL (A-MBL), to increase the efficiency and accuracy of MBL by adapting the size of sample sets and the parameter of the dynamic model during the estimation process. Evaluation results show that the accuracy of MBL and A-MBL outperform both Mobile and Static sensor network Localization (MSL) and Arrival and Departure Overlap (ADO) when both of them use only a single mobile beacon for localization in static WSNs.

Adaptive intelligent power systems: Active distribution networks

International Nuclear Information System (INIS)

McDonald, Jim

2008-01-01

Electricity networks are extensive and well established. They form a key part of the infrastructure that supports industrialised society. These networks are moving from a period of stability to a time of potentially major transition, driven by a need for old equipment to be replaced, by government policy commitments to cleaner and renewable sources of electricity generation, and by change in the power industry. This paper looks at moves towards active distribution networks. The novel transmission and distribution systems of the future will challenge today's system designs. They will cope with variable voltages and frequencies, and will offer more flexible, sustainable options. Intelligent power networks will need innovation in several key areas of information technology. Active control of flexible, large-scale electrical power systems is required. Protection and control systems will have to react to faults and unusual transient behaviour and ensure recovery after such events. Real-time network simulation and performance analysis will be needed to provide decision support for system operators, and the inputs to energy and distribution management systems. Advanced sensors and measurement will be used to achieve higher degrees of network automation and better system control, while pervasive communications will allow networks to be reconfigured by intelligent systems

SOUNET: Self-Organized Underwater Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Hee-won Kim

2017-02-01

Full Text Available In this paper, we propose an underwater wireless sensor network (UWSN named SOUNET where sensor nodes form and maintain a tree-topological network for data gathering in a self-organized manner. After network topology discovery via packet flooding, the sensor nodes consistently update their parent node to ensure the best connectivity by referring to the timevarying neighbor tables. Such a persistent and self-adaptive method leads to high network connectivity without any centralized control, even when sensor nodes are added or unexpectedly lost. Furthermore, malfunctions that frequently happen in self-organized networks such as node isolation and closed loop are resolved in a simple way. Simulation results show that SOUNET outperforms other conventional schemes in terms of network connectivity, packet delivery ratio (PDR, and energy consumption throughout the network. In addition, we performed an experiment at the Gyeongcheon Lake in Korea using commercial underwater modems to verify that SOUNET works well in a real environment.

SOUNET: Self-Organized Underwater Wireless Sensor Network.

Science.gov (United States)

Kim, Hee-Won; Cho, Ho-Shin

2017-02-02

In this paper, we propose an underwater wireless sensor network (UWSN) named SOUNET where sensor nodes form and maintain a tree-topological network for data gathering in a self-organized manner. After network topology discovery via packet flooding, the sensor nodes consistently update their parent node to ensure the best connectivity by referring to the timevarying neighbor tables. Such a persistent and self-adaptive method leads to high network connectivity without any centralized control, even when sensor nodes are added or unexpectedly lost. Furthermore, malfunctions that frequently happen in self-organized networks such as node isolation and closed loop are resolved in a simple way. Simulation results show that SOUNET outperforms other conventional schemes in terms of network connectivity, packet delivery ratio (PDR), and energy consumption throughout the network. In addition, we performed an experiment at the Gyeongcheon Lake in Korea using commercial underwater modems to verify that SOUNET works well in a real environment.