Scheme For Sensor Networks Research Articles

A unified approach to combinatorial key predistribution schemes for sensor networks

There have been numerous recent proposals for key predistribution schemes for wireless sensor networks based on various types of combinatorial structures such as designs and codes. Many of these schemes have very similar properties and are analysed in a similar manner. We seek to provide a unified framework to study these kinds of schemes. To do so, we define a new, general class of designs, termed “partially balanced t-designs”, that is sufficiently general that it encompasses almost all of the designs that have been proposed for combinatorial key predistribution schemes. However, this new class of designs still has sufficient structure that we are able to derive general formulas for the metrics of the resulting key predistribution schemes. These metrics can be evaluated for a particular scheme simply by substituting appropriate parameters of the underlying combinatorial structure into our general formulas. We also compare various classes of schemes based on different designs, and point out that some existing proposed schemes are in fact identical, even though their descriptions may seem different. We believe that our general framework should facilitate the analysis of proposals for combinatorial key predistribution schemes and their comparison with existing schemes, and also allow researchers to easily evaluate which scheme or schemes present the best combination of performance metrics for a given application scenario.

A novel area coverage management scheme for sensor network with mobile sensor nodes

A novel area coverage management scheme for sensor network with mobile sensor nodes

Distributed Privacy-Preserving Access Control in Sensor Networks

The owner and users of a sensor network may be different, which necessitates privacy-preserving access control. On the one hand, the network owner need enforce strict access control so that the sensed data are only accessible to users willing to pay. On the other hand, users wish to protect their respective data access patterns whose disclosure may be used against their interests. This paper presents DP <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> AC, a Distributed Privacy-Preserving Access Control scheme for sensor networks, which is the first work of its kind. Users in DP <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> AC purchase tokens from the network owner whereby to query data from sensor nodes which will reply only after validating the tokens. The use of blind signatures in token generation ensures that tokens are publicly verifiable yet unlinkable to user identities, so privacy-preserving access control is achieved. A central component in DP <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> AC is to prevent malicious users from reusing tokens, for which we propose a suite of distributed token reuse detection (DTRD) schemes without involving the base station. These schemes share the essential idea that a sensor node checks with some other nodes (called witnesses) whether a token has been used, but they differ in how the witnesses are chosen. We thoroughly compare their performance with regard to TRD capability, communication overhead, storage overhead, and attack resilience. The efficacy and efficiency of DP <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> AC are confirmed by detailed performance evaluations.

An Efficient Pairwise Key Establishment Scheme for Sensor Networks

Seurity communication is an important requirement in many sensor network applications. A new kind of pairwise key establishment scheme based on hierarchical hypercube model H(k,u,m,v,n) for clusters-deployed sensor networks distribution model is presented. Theoretic analysis and experimental figures show that the new pairwise key model has better performance and provides higher possibilities for sensor to establish pairwise key, compared with previous related works.

Cross-layer analysis of error control in underwater wireless sensor networks

Several error control schemes have been introduced for Underwater Wireless Sensor Networks (UWSNs) to combat the effects of high error rates. However, these schemes have only been evaluated based on point-to-point communication metrics and do not consider the different underwater propagation phenomena. On the other hand, the unique properties of UWSNs such as the three-dimensional architecture and the underwater channel characteristics prevent existing studies of error control schemes for terrestrial sensor networks to be applied to this domain.In this paper, a cross-layer analysis framework is developed to evaluate existing error control techniques in three-dimensional multi-hop UWSNs. The developed framework captures the effects of automatic repeat request (ARQ), forward error correction (FEC), and hybrid ARQ schemes on end-to-end energy, latency, and packet error rate. In addition, different underwater propagation phenomena are considered with a particular attention on the presence of shadow zones. The theoretical analysis and the numerical evaluations reveal that exploiting FEC schemes with channel-aware routing reduces the end-to-end energy consumption and latency under all propagation phenomena for all water depths in UWSNs. The selection of the suitable error control scheme depends also on the water depth (shallow/deep water) and on the different underwater propagation phenomena.

Distributed H∞ Filtering with Consensus Strategies in Sensor Networks: Considering Consensus Tracking Error

AbstractThe existing distributed filtering with consensus strategies consists of two steps: the consensus step through locally communicating with neighboring sensor nodes and the local filtering step. In this paper, the influence of consensus tracking error on the local estimation error is analyzed, and a distributed H∞ filtering algorithm considering the consensus tracking error is proposed. When the number of consensus iterations per sampling period is limited, the proposed method can suppress the effect of consensus tracking error on local estimation error; when the number of consensus iterations per sampling period goes to infinity, i.e., the consensus tracking error converges to zero, the local filtering in the distributed algorithm reduces to the centralized filtering. Simulation shows the effectiveness of the proposed method.

Lightweight Data Synchronization Scheme in Heterogeneous Sensor Networks

Data synchronization is critical for many sensor network operations including collaborative sensing, sensor scheduling and data fusion. Currently, large number of synchronization schemes have been proposed for the sensor network under the assumption that sensors work with the same network structure, network protocol and radio module. These techniques cannot survive in the heterogeneous sensor networks with the development of internet of things. In this paper, we propose a lightweight data synchronization scheme with low power which consists of two phases: first, we propose a heterogeneous clock synchronization algorithm based on the gateway which can synchronize the multi-hop sensor network with the TCP/IP network immediately without introducing amount of communication overhead; then, we also propose a synchronization control scheme in the gateway and we can balance the synchronization requirements through the adaptive buffer management. We implement the proposed scheme in real heterogeneous sensor network platform, and the experiment results show that our scheme can achieve high synchronization accuracy.

A sensitive data aggregation scheme for body sensor networks based on data hiding

Body sensor networks (BSNs) enable the pervasive, long-term, and real-time monitoring in any environment and without restriction of activity. Security and privacy are extremely critical issues of BSNs, as sensitive information is transmitted through the wireless network. This paper proposes a novel sensitive data aggregation scheme based on data hiding for BSNs, namely SDAS. SDAS adopts the packet combination based on the sensitive data aggregation tree built in each BSN to reduce the transmission energy consumption by eliminating transmitted redundancy. After lossless compression, the compressed sensitive data are embedded into various ordinary data in the combined packet by using a lightweight data hiding algorithm to prevent the disclosure of the sensitive data and avoid arousing the attention of attackers. Extensive analysis demonstrates that our proposed scheme can ensure a high level of security and privacy of the sensitive data without affecting the ordinary data quality, while delivering low power consumption.

Min-Distance Hop Count based Multi-Hop Clustering In Non-uniform Wireless Sensor Networks

In wireless sensor networks, an energy efficient data gathering scheme is one of core technologies to process a query. The clusterbased data gathering methods minimize the energy consumption of sensor nodes by maximizing the efficiency of data aggregation. However, since the existing clustering methods consider only uniform network environments, they are not suitable for the real world applications that sensor nodes can be distributed unevenly. To solve such a problem, we propose a balanced multi-hop clustering scheme in non-uniform wireless sensor networks. The proposed scheme constructs a cluster based on the logical distance to the cluster head using a min-distance hop count. To show the superiority of our proposed scheme, we compare it with the existing clustering schemes in sensor networks. Our experimental results show that our proposed scheme prolongs about 48% lifetime over the existing methods on average.

Distributed H H H ∞ Filtering with Consensus Strategies in Sensor Networks: Considering Consensus Tracking Error

Distributed H H <i>H</i> _∞ Filtering with Consensus Strategies in Sensor Networks: Considering Consensus Tracking Error

Latency bounded and energy efficient MAC for wireless sensor networks

This study presents the design and performance evaluation of a latency bounded and medium access control (MAC) scheme (abbreviated to LB-MAC) for wireless sensor networks that require time-critical communication. LB-MAC provides the predictability for an end-to-sink data delivery time through the time division multiple access (TDMA) multi-channel transmission frame assignment considering the routing path of a tree network. In addition, it uses the traffic-based slot assignment mechanism at every transmission frame to achieve energy efficiency. The feasibility and effectiveness of LB-MAC is demonstrated through extensive simulation based comparisons with prior research.

A mutual authentication and key establishment scheme for heterogeneous sensor networks supporting nodes mobility

In the last two decades, wireless sensor networks (WSNs) have greatly attracted the attention of the research community because their flexibility, adaptability and self-organising properties make them a technology solution suitable for diverse application scenarios ranging from home and industrial automation to military surveillance. Since these networks consist of resource constrained devices and can be deployed in remote and unattended areas, supporting security could represent a challenging task especially if mobility scenarios are taken into consideration. In this context, key management facilitates the adoption of cryptography techniques to support secure data communication and to protect the resource constrained devices from various security attacks. This paper specifically focuses on mobile heterogeneous wireless sensor networks consisting of mobile sensor nodes with few fixed sensor nodes and presents a mutual authentication and key management scheme suitable for the considered scenario. Analytical and OMNET++ simulation results show that the proposed scheme provides better network connectivity, consumes less memory, has better network resilience against attacks and introduces lower communication overhead compared to state-of-the-art solutions.

Securing Wireless Sensor Networks Against Broadcast Service Attacks

Attacks against broadcast services in wireless sensor networks will have the most catastrophic effects on power and other resource consumptions. As bogus broadcast packets are propagated through sensor nodes without being filtered out, sensor nodes will waste their resources such as power and memory on transmitting and buffering those false packets. In networks where complex Denial-of-Service (DoS) attacks may be launched, each node should be able to limit its effects on resource consumptions. In addition, it is strongly desired to identify compromised sensor node(s) which has injected invalid packets (intrusion detection) and to isolate the nodes (remediation) such that no more DoS attack is possible through the compromised sensor node(s) in the future. A new secure broadcast authentication scheme for sensor networks is proposed in this paper based upon predictive hashing and μTESLA techniques. This new scheme may be used to detect invalid packets as quickly as possible and to isolate links that are from the compromised nodes, which results in enhanced resistance to various security attacks including DoS attacks. We present the details of the scheme along with the simulation results.

ITFBS: adaptive intrusion-tolerant scheme for body sensor networks in smart space applications

As an important part of the smart space, body sensor networks (BSNs) provide continuous health monitoring and automation assistance for smart environment residents. A high degree of security and reliability for BSN is extremely required. An adaptive and flexible intrusion-tolerant scheme for BSN, namely ITFBS, is proposed. ITFBS dynamically detects intrusions according to the collected intrusion-related information, and it can provide an adaptive intrusion-tolerant strategy with passive replication by utilising two-step threshold-based intrusion detection and replicas classification. The correctness and effectiveness of ITFBS is theoretically proved, and the experimental results show that ITFBS can effectively tolerate intrusions with low power consumption and high adaptability.

On optimizing sensing quality with guaranteed coverage in autonomous mobile sensor networks

The advancements in robotics and wireless communications provide us with the opportunity to combine the mobility and wireless sensor networks so that various objectives can be achieved simultaneously with less required resources. Specifically, mobility enables sensors to dynamically adjust their positions for better sensing quality, and offers a higher probability for guaranteeing the required coverage at the same time. In this paper, we propose a novel coordinating scheme for autonomous mobile sensor networks to optimize the target sensing quality while guaranteeing the required coverage of the field of interest. The whole problem is transformed into a finite horizon optimization problem, to which several solving algorithms are designed. Extensive simulations demonstrate the effectiveness of the proposed method.

Optimal quantisation bit budget for a spectrum sensing scheme in bandwidth-constrained cognitive sensor networks

The problem of spectrum sensing in bandwidth-constrained cognitive sensor networks with quantised sensing observation is studied. In particular, the quantisation bit budget for achieving performance close to that of spectrum sensing with raw sensing observation is investigated. Both single-user spectrum sensing and collaborative spectrum sensing schemes are proposed. In single-user spectrum sensing, a sensor quantises its sensing observation and sends the quantised sensing observation to a processing point. The processing point performs spectrum sensing based on the reconstructed sensing observation. In collaborative spectrum sensing, each sensor sends a quantised sensing observation to a processing point and each processing point performs local spectrum sensing based on the reconstructed sensing observation. Then, each processing point sends a binary decision bit to a fusion centre. The fusion centre combines the decision bits by using a counting rule to generate the final spectrum sensing result. The detection probability and the false alarm probability are derived and simulated. The results show that there exists an optimal quantisation bit budget for which the detection probability and the false alarm probability are almost the same as those in spectrum sensing with raw sensing observation. Compared to existing spectrum sensing schemes with quantised sensing observation, the proposed schemes are more suitable for implementation in cognitive sensor networks.

Random Access Compressed Sensing for Energy-Efficient Underwater Sensor Networks

Inspired by the theory of compressed sensing and employing random channel access, we propose a distributed energy-efficient sensor network scheme denoted by Random Access Compressed Sensing (RACS). The proposed scheme is suitable for long-term deployment of large underwater networks, in which saving energy and bandwidth is of crucial importance. During each frame, a randomly chosen subset of nodes participate in the sensing process, then share the channel using random access. Due to the nature of random access, packets may collide at the fusion center. To account for the packet loss that occurs due to collisions, the network design employs the concept of sufficient sensing probability. With this probability, sufficiently many data packets - as required for field reconstruction based on compressed sensing - are to be received. The RACS scheme prolongs network life-time while employing a simple and distributed scheme which eliminates the need for scheduling.

Distributed Active Sensor Scheduling for Target Tracking in Ultrasonic Sensor Networks

Active ultrasonic sensors for target tracking application may suffer from inter-sensor-interference if these highly dense deployed sensors are not scheduled, which can degrade the tracking performance. In this paper, we propose a dynamic distributed sensor scheduling (DSS) scheme, where the tasking sensor is elected spontaneously from the sensors with pending sensing tasks via random competition based on Carrier Sense Multiple Access (CSMA). The channel will be released immediately when sensing task is completed. Both simulation results and testbed experiment demonstrate the effectiveness of DSS scheme for large scale sensor networks in terms of system scalability and high tracking performance.

Data Dissemination Scheme Research in Opportunistic Sensor Networks

This paper mainly discusses the performance of three typical data dissemination schemes in opportunistic sensor networks, which include rumor spread protocol, direct dissemination protocol and the protocol based on evolvement strategy. The main idea of the protocol based on evolvement strategy is that in the process of data dissemination, those nodes with higher dissemination validity are dynamically to substitute the node with lower dissemination validity. This paper makes detail theory analysis on the performance of these protocols. The performance of these protocols also is compared with simulation experiments further more.

Public-key based access control in sensornet

Symmetric cryptography has been mostly used in security schemes in sensor networks due to the concern that public key cryptography (PKC) is too expensive for sensor devices. While these schemes are efficient in processing time, they generally require complicated key management, which may introduce high memory and communication overhead. On the contrary, PKC-based schemes have simple and clean key management, but cost more computational time. The recent progress in PKC implementation, specially elliptic curve cryptography (ECC), on sensors motivates us to design a PKC-based security scheme and compare its performance with the symmetric-key counterparts. This paper proposes a practical PKC-based access control for sensor networks, which consists of pairwise key establishment, local access control, and remote access control. We have implemented both cryptographic primitives on commercial off-the-shelf sensor devices. Building the user access control as a case study, we show that PKC-based protocol is more advantageous than those built on symmetric cryptography in terms of the memory usage, message complexity, and security resilience. Meanwhile, our work also provides insights in integrating and designing PKC-based security protocols for sensor networks.