Scheme For Sensor Networks Research Articles

An Empirical Approach - Distributed Mobility Management for Target Tracking in MANETs

Mobility management is a major challenge in mobile ad hoc networks (MANETs) due in part to the dynamically changing network topologies. For mobile sensor networks that are deployed for surveillance applications, it is important to use a mobility management scheme that can empower nodes to make better decisions regarding their positions such that strategic tasks such as target tracking can benefit from node movement. In this paper, we describe a distributed mobility management scheme for mobile sensor networks. The proposed scheme considers node movement decisions as part of a distributed optimization problem which integrates mobility-enhanced improvement in the quality of target tracking data with the associated negative consequences of increased energy consumption due to locomotion, potential loss of network connectivity, and loss of sensing coverage.

Parallel Decentralized Network for the Detection of Unknown Signals Through Wireless Nakagami Fading Channels

In this paper analytical and simulation results for the decentralized detection of unknown signals are introduced. Parallel sensor network scheme is assumed. Additive White Gaussian Noise (AWGN) and Nakagami fading are assumed in both links, that is, from the source to the decentralized local sensors and from the sensors to the fusion center. Furthermore, diversity employing Square Law Combining (SLC) or Square Law Selection (SLS) is considered at each sensor, for both independent and correlated branches. Appreciable improvements are obtained with the increase of the number of sensors and the diversity employment.

A Location-aware and Secret-share Based Dynamic Key Management Scheme for Heterogeneous Sensor Networks

Recently, Numerous dynamic key management schemes have been proposed for WSN, and it has long-lived networks , more sustained security and survivability, such as SH E LL and LCOK. But most of these schemes are greatly depend on some central nodes (gateways), if these nodes were compromised , there will be great threat to the whole networks security and survivability. In this paper, we proposed a Location-aware and secret share based dynamic key management scheme to effectively replace the compromised central node and enhance the security level of the network.

Novel Anti Co-Channel Interference Scheme for Sensor Networks

With improvement of the automation level, wireless sensors are widely used, but various kinds of interference lead to problems in the application. In order to deal with co-channel interference, a throughput efficient scheme based on Extended Binary Phase Shift Keying (EBPSK) modulation is introduced in physical layer. On this basis, the corresponding transmission scheme and the important impacting filter are presented. Effects of co-channel interference on the EBPSK waveform in different cases are analyzed. Simulation results illustrate the excellent anti-interference performance of the EBPSK system itself, when the initial phase of the co-channel interference is small.

Improved algorithm for distributed localization in wireless sensor networks

Many sensor network applications require location awareness, but it is often too expensive to equip a global positioning system (GPS) receiver for each network node. Hence, localization schemes for sensor networks typically use a small number of seed nodes that know their locations and protocols whereby other nodes estimate their locations from the messages they receive. For the inherent shortcomings of general particle filter (the sequential Monte Carlo method) this paper introduces particle swarm optimization and weighted centroid algorithm to optimize it. Based on improvement a distributed localization algorithm named WC-IPF (weighted centroid algorithm improved particle filter) has been proposed for localization. In this localization scheme the initial estimate position can be acquired by weighted centroid algorithm. Then the accurate position can be gotten via improved particle filter recursively. The extend simulation results show that the proposed algorithm is efficient for most condition.

A novel key pre-distribution scheme for wireless distributed sensor networks

A novel key pre-distribution scheme for sensor networks is proposed, which enables sensor nodes to communicate securely with each other using cryptographic techniques. The approach uses the rational normal curves in the projective space with the dimension n over the finite field \( \mathbb{F}_q \). Both secure connectivity and resilience of the resulting sensor networks are analyzed. By choosing the parameters q and n properly, this key pre-distribution scheme has some advantages over the previous known schemes. In addition, if the number of the rational normal curves in the scheme becomes too large for an application, the size may be reduced by choosing a part of the curves randomly. This reduction has, shown by our experiments, only minimal impact on secure connectivity and resilience of the resulting sensor network.

A Stochastic Analysis of a Greedy Routing Scheme in Sensor Networks

We address the stochastic characteristics of a recently proposed greedy routing scheme. The behavior of individual hop advancements is examined, and asymptotic expressions for the hop length moments are obtained. The change of the hop distribution as the sink distance is varied is quantified with a Kullback–Leibler analysis. We discuss the effects of the assumptions made, the inherent dependencies of the model, and the influence of a sleep scheme. We propose a renewal process model for multiple hop advancements and justify its suitability under our assumptions. We obtain the renewal process distributions via fast Fourier transform convolutions. We conclude by giving future research tasks and directions.

Secure Cluster Head Election Using Mark Based Exclusion in Wireless Sensor Networks

In clustered sensor networks, because CHs (Cluster Heads) are the collection points of data, they are likely to be compromise targets of attackers. So, they need to be changed through a CH election scheme as frequently as possible. Besides, because the compromised nodes must try to become a CH, a CH election scheme should prevent them from being a CH. This paper presents a secure CH election scheme for clustered sensor networks, which changes the CH role nodes securely by excluding the compromised nodes from CH candidates. In the proposed scheme, each node gives marks for behavior of all other nodes in the same CH election region and exchanges the mark list with them. Then, each node computes the average marks for all nodes in the region, and nodes whose average mark is less than a specific threshold are excluded from CH candidates. A CH is elected among the remaining candidates. Simulation results show that our scheme provides strong resilience against misbehavior of compromised nodes and reduces energy consumption of nodes. Another simulation results show that our scheme well operates in the environment where some packets are often lost.

Connectivity-Guaranteed Hybrid Topology Management Scheme for Improving the Operational Lifetime of 3-Dimensional Wireless Sensor Networks

The battery of limited energy operates wireless sensor nodes, it is important to increase the lifetime of the wireless sensor network. The aim of our work is to design a hybrid topology management scheme for improving the lifetime of the wireless sensor networks with guaranteed connectivity. The sensing range of the sensor node is smaller than the radio range and hence there is a large number of nodes within the coverage area of a node. Hence the network connectivity can be maintained with less number of nodes. By using this fact, we can save energy by switching off the transceiver, which consumes most of the energy. On the other hand, the sensor node spends most of the time in monitoring state and the transceiver is idle. In the idle state the transceiver consumes almost the same energy as in receiving state. Hence putting the transceiver in the sleep mode when it is idle can save the significant energy. We have designed a hybrid topology management scheme for 3-Dimensional sensor networks by making use of these facts. Our hybrid scheme improves the lifetime of the 3-Dimensional sensor network by a factor of 19.

Simplified watermarking scheme for sensor networks

Wireless sensor networks (WSNs) are used in a variety of applications including military, environmental, and smart spaces. These applications might deal with sensitive information like enemy movements in the battlefield. Sensors are susceptible to various types of attack, such as data modification, data insertion and deletion, or even physical capture and sensor replacement. Therefore, checking the integrity of the transmitted data is critical for WSNs' applications. The inherited constraints in WSNs, e.g., computational capability and limited energy resources, pose extra challenges for providing data security. This makes traditional security techniques, which are based on data encryption, not suitable for WSNs. This paper focuses on the integrity of sensor data in WSNs. Motivated by the work of Guo et al. (2007) we propose a fragile watermarking technique, called light weight chained watermark (LWC watermark), to detect unauthorised data alterations. Watermarking techniques are usually computationally lightweight and do not require much memory resources. We provide detailed security analysis of the proposed LWC watermark and compare it with a recent work of Guo et al. (2007) for watermarking data streams. While the robustness of LWC is similar to that of Guo et al. (2007), LWC offers significant performance improvement. We implemented both techniques (the proposed LWC and Guo et al., 2007) and performed extensive performance experiments. The experimental results on synthetic sensor data streams prove that the proposed LWC watermarking scheme is much faster than Guo et al. (2007) watermarking technique. This makes the proposed schemes more suitable for wireless sensor network environment where computing and power resources are very limited.

Optimal Selective Transmission under Energy Constraints in Sensor Networks

An optimum selective transmission scheme for energy-limited sensor networks, where sensors send or forward messages of different importance (priority), is developed. Considering the energy costs, the available battery, the message importances and their statistical distribution, sensors decide whether to transmit or discard a message so that the importance sum of the effectively transmitted messages is maximized. It turns out that the optimal decision is made comparing the message importance with a time-variant threshold. Moreover, the gain of the selective transmission scheme, compared to a nonselective one, critically depends on the energy expenses, among other factors. Albeit suboptimal, practical schemes that operate under less demanding conditions than those for the optimal one are developed. Effort is placed into three directions: 1) the analysis of the optimal transmission policy for several stationary importance distributions; 2) the design of a transmission policy with invariant threshold that entails asymptotic optimality; and 3) the design of an adaptive algorithm that estimates the importance distribution from the actual received (or sensed) messages. Numerical results corroborating our theoretical claims and quantifying the gains of implementing the selective scheme close this paper.

A Collaborative sensor-fault detection scheme for robust distributed estimation in sensor networks

This work addresses the problem of robust distributed estimation in the presence of sensor faults when the fusion center sequentially receives quantized messages from local sensors. The mean square error (MSE) of distributed estimation schemes increases dramatically if the information received from the faulty sensors within the network is not excluded from the estimation process. Accordingly, an efficient collaborative sensor-fault detection (CSFD) scheme is proposed in which the results of a homogeneity test are used to identify the faulty nodes within the network such that their quantized messages can be filtered out when estimating the parameter of interest. Utilizing an asymptotic analytical technique, a lower bound is derived for the MSE of the proposed distributed estimation scheme. A good agreement is observed between the simulated MSE results and the lower bound values, and thus it is inferred that the lower bound provides a convenient and reliable means of predicting the performance of the proposed estimation scheme in real-world sensor networks. In addition, a low-complexity CSFD (LC-CSFD) scheme is proposed to identify faulty sensors in WSNs with a very large number of nodes. The simulation results confirm that the accuracy of the estimates obtained from the CSFD and LCCSFD schemes is significantly better than that obtained from a conventional estimation scheme when applied in sensor networks characterized by an unknown number of sensor faults of various types.

Transactions papers a routing-driven Elliptic Curve Cryptography based key management scheme for Heterogeneous Sensor Networks

Previous research on sensor network security mainly considers homogeneous sensor networks, where all sensor nodes have the same capabilities. Research has shown that homogeneous ad hoc networks have poor performance and scalability. The many-to-one traffic pattern dominates in sensor networks, and hence a sensor may only communicate with a small portion of its neighbors. Key management is a fundamental security operation. Most existing key management schemes try to establish shared keys for all pairs of neighbor sensors, no matter whether these nodes communicate with each other or not, and this causes large overhead. In this paper, we adopt a Heterogeneous Sensor Network (HSN) model for better performance and security. We propose a novel routing-driven key management scheme, which only establishes shared keys for neighbor sensors that communicate with each other. We utilize Elliptic Curve Cryptography in the design of an efficient key management scheme for sensor nodes. The performance evaluation and security analysis show that our key management scheme can provide better security with significant reductions on communication overhead, storage space and energy consumption than other key management schemes.

Asymmetric Key Pre-distribution Scheme for sensor networks

A key pre-distribution scheme is a method by which initially an off-line trusted authority distributes pieces of information among a set of users. Later, each member of a group of users can compute a common key for secure communication. In this paper we present an asymmetric key pre-distribution scheme. Instead of assuming that the network is comprised entirely of identical users in conventional key pre-distribution schemes, the network now consists of a mix of users with different missions, i.e., ordinary users and keying material servers. A group of users, using secret keys preloaded in their memory and public keying material retrieved from one keying material server, can compute a session key. The properties of this method are that, the compromise of keying material servers does not reveal any information about users' secret keys and the session keys of privileged subset of users; if computational assumptions are considered, each user has very low storage requirement. These properties make it attractive for sensor networks. We first formally define the asymmetric key pre-distribution scheme in terms of the entropy and give lower bounds on user's storage requirement and the public keying material size. Then, we present its constructions and applications for sensor networks.

BoSS: a moving strategy for mobile sinks in wireless sensor networks

Since sink mobility can alleviate the effects of the hotspot problem in wireless sensor networks and improve network performance, it has attracted much research interest in recent years. Considering the unawareness of energy efficiency in random moving strategies and the lack of flexibility in fixed-track moving strategies, we propose an autonomous moving strategy for the mobile sinks in periodically data-gathering applications in this paper. We first suggest a data-gathering scheme for low-duty cycle sensor networks and then present a mechanics-inspired moving strategy, called BoSS. The moving strategy drives a sink to move towards the nodes with high residual energy and meanwhile, balances energy consumption among the nodes with low energy. Finally, we compare our moving strategy with three near-optimal fixed-track strategies by simulations. The results show that our strategy can not only extend network lifetime notably, but also provide scalability and topology adaptability.

Energy efficient node addressing scheme in self-organised sensor networks

Sensor networks are envisioned to support autonomous and spontaneous networking for a wide range of applications such as environment monitoring. Due to energy constraints, it is difficult for wireless sensor nodes to handle heavy protocol stacks with a large protocol overhead. In this paper, we present a novel address auto configuration scheme, which we call SMallest-size sensor AddRess auToconfiguration scheme (SMART), to configure potential shortest-size local unique addresses for sensor networks with energy efficiency. SMART achieves energy efficiency in three ways. First, it automatically configures node address within a potential smallest address space for a number of sensor nodes, in order to achieve the small address size. Second, it avoids address conflicts during the address configuration. Third, it configures addresses with a small configuration overhead and achieves load balance among sensor nodes.

Hierarchical Hypercube Based Pairwise Key Establishment Scheme for Sensor Networks

Security schemes of pairwise key establishment, which enable sensors to communicate with each other se-curely, play a fundamental role in research on security issue in wireless sensor networks. A general frame-work for key predistribution is presented, based on the idea of KDC (Key Distribution Center) and polyno-mial pool schemes. By utilizing nice properties of H2 (Hierarchical Hypercube) model, a new security mechanism for key predistribution based on such model is also proposed. Furthermore, the working per-formance of tolerance resistance is seriously inspected in this paper. Theoretic analysis and experimental fig-ures show that the algorithm addressed in this paper has better performance and provides higher possibilities for sensor to establish pairwise key, compared with previous related works.

Location discovery for sensor networks with short range beacons

In this paper, we present TPSS, a time-based positioning scheme for sensor networks with short-range beacons. By measuring Time Difference of Arrival (TDoA) of signals from nearby beacons, nodes can use TPSS to effectively estimate their locations through trilateration iteratively. We also propose iTPSS as an enhancement to improve the localisation accuracy by a clustering-based position refinement. Extensive simulations have been conducted and the results indicate that both schemes are effective and efficient for location discovery, and iTPSS outperforms TPSS in positioning accuracy.

A traffic aware, energy-efficient MAC protocol for Wireless Sensor Networks

In this paper, we propose TA-MAC, a traffic load adaptive, energy-efficient Medium Access Control (MAC) protocol for Wireless Sensor Networks (WSNs). TA-MAC modifies the contention window mechanism of S-MAC, a mostly well-known MAC scheme for sensor networks. Each sensor node chooses an optimal size of initial contention window according to the number of its neighbours. Then, it adjusts the initial contention window according to the current traffic load to reduce the collision probability while employing a fast back-off scheme to reduce the time for idle listening during back-off procedure, which both reduce the energy consumption. Simulation results show that TA-MAC outperforms S-MAC under high load.

An efficient scheme for removing compromised sensor nodes from wireless sensor networks

AbstractThe goal of key management is to establish the required keys between sensor nodes which exchange data. A key management protocol includes two aspects: key distribution and key revocation. Key distribution has been extensively studied in the context of sensor networks. However, key revocation has received relatively little attention. In this paper, we first review and summarize the current key revocation schemes for sensor networks. Then, we present an efficient scheme, KeyRev, for removing compromised sensor nodes from a wireless sensor network (WSN). Unlike most proposed key revocation schemes focusing on removing the compromised keys on the sensor nodes, the KeyRev scheme uses key update techniques to obsolesce the keys owned by the compromised sensor nodes and thus remove the nodes from the network. We analyze the security of the KeyRev scheme and compare its performance against another centralized key revocation scheme and a distributed key revocation scheme. Our analyses show that the KeyRev scheme is secure in spite of not removing the pre‐distributed key materials at compromised sensor nodes. Simulation results also indicate that the KeyRev scheme is scalable and performs very well compared with other key revocation schemes in WSNs. Copyright © 2008 John Wiley & Sons, Ltd.