Scheme For Wireless Sensor Networks Research Articles

Performance Analysis of Cluster based Routing Protocols in Heterogeneous Wireless Sensor Network

the network lifetime is considered as one of the major issue in wireless sensor network (WSN). The network lifetime can be increased with the introduction of the heterogeneity in sensor nodes. Many heterogeneous routing algorithms in WSN are proposed. In this paper, we have analyzed the performance of distributed energy efficient clustering algorithm (DEEC), developed distributed energy- efficient clustering algorithm (DDEEC), and energy efficient heterogeneous clustered scheme for WSN (EEHC) in terms of network lifetime and number of messages received by base station. Keywordsheterogeneous WSN, clustering algorithm

Efficient Data Aggregation with Tolerable Bias for WSNs

To improving the efficiency of data aggregation in wireless sensor networks (WSNs), , authors proposed an efficient data aggregation scheme for WSNs with tolerable measurement bias. Due to sensors located in the same relative small area have similar readings, it is unnecessary for all nodes in this area transmit their values to the aggregator. Comparison with all nodes send their data to the base station, part of sensors keep silent to the servers request will has little impact on the final aggregation result and reducing the energy consumption effectively. Experiment shows the proposed scheme lowers the energy consumption effectively with tolerable bias.

An Efficient Grid-Based Pairwise Key Predistribution Scheme for Wireless Sensor Networks

Research on wireless sensor networks (WSNs) has been receiving a lot of attention recently. Because of the constraints on the cost of hardware, there are a lot of restrictions regarding memory, computational ability, and energy consumption, hampering WSN research. So far, many key establishment schemes have been proposed for WSNs. For the proposed schemes, random key predistribution is a practical solution. With this, each sensor shares a common key with its neighbors via predistributed keys. However, it may happen that two sensor nodes do not share a common key. In this paper, an efficient grid-based pairwise key predistribution scheme for WSNs is proposed. In the proposed scheme, multiple polynomials for each row, each column, and each diagonal in the grid are constructed. Then, each sensor node in each row, column, and diagonal in the grid establishes a pairwise key with the other node using the predistributed symmetric polynomial. Simulation results demonstrate the effectiveness of the proposed scheme in increasing the probability of establishing pairwise keys and reducing communication overhead.

A Strong Authentication Scheme with User Privacy for Wireless Sensor Networks

Wireless sensor networks (WSNs) are used for many real-time applications. User authentication is an important security service for WSNs to ensure only legitimate users can access the sensor data within the network. In 2012, Yoo and others proposed a security-performance-balanced user authentication scheme for WSNs, which is an enhancement of existing schemes. In this paper, we show that Yoo and others' scheme has security flaws, and it is not efficient for real WSNs. In addition, this paper proposes a new strong authentication scheme with user privacy for WSNs. The proposed scheme not only achieves end-party mutual authentication (that is, between the user and the sensor node) but also establishes a dynamic session key. The proposed scheme preserves the security features of Yoo and others' scheme and other existing schemes and provides more practical security services. Additionally, the efficiency of the proposed scheme is more appropriate for real-world WSNs applications.

Key Distribution using Double Keyed-hash Chains for Wireless Sensor Networks

As a security primitive, key establishment plays the most crucial role in the designing of the security mechanism in the wireless sensor networks (WSNs). Unfortunately, the resource limitation of sensor nodes poses a great challenge for designing an efficient and effective key establishment scheme for WSNs. In this paper, we propose an effective key predistribution scheme using double keyed-hash chain schemes. In the proposed scheme, there are two key pools: upward key pools and downward key pools, and the key ring in each sensor is picked from these two key pools. The proposed scheme is analyzed based on connectivity, resistance against attacks, memory consumption and communication overhead. Comparing with the EG scheme and the q-composite scheme, our scheme performs better in terms of network resilience to node capture with little additional overhead cost.

A Survey of Cluster-based Routing Schemes for Wireless Sensor Networks

In recent times, wireless sensor networks (WSNs) have become progressively more attractive and have found their way into a wide variety of applications and systems because of their low cost, self-organizing behavior, and sensing ability in harsh environments. A WSN is a collection of nodes organized into a network. Routing is a vital technology in WSNs and can be roughly divided into two categories: flat routing and hierarchical routing. In a flat routing topology, all nodes have identical functionality and carry out the same task in the network. Nodes in a hierarchical topology do different tasks in WSNs and are usually arranged into clusters. In this paper, a survey on cluster-based routing schemes for WSNs has been done and comparisons made on the basis of performance factors such as latency, scalability, and energy awareness. Strengths and limitations of each scheme are presented, and open issues that must be addressed in the design of cluster-based routing algorithms are discussed.

An advanced temporal credential-based security scheme with mutual authentication and key agreement for wireless sensor networks.

Wireless sensor networks (WSNs) can be quickly and randomly deployed in any harsh and unattended environment and only authorized users are allowed to access reliable sensor nodes in WSNs with the aid of gateways (GWNs). Secure authentication models among the users, the sensor nodes and GWN are important research issues for ensuring communication security and data privacy in WSNs. In 2013, Xue et al. proposed a temporal-credential-based mutual authentication and key agreement scheme for WSNs. However, in this paper, we point out that Xue et al.'s scheme cannot resist stolen-verifier, insider, off-line password guessing, smart card lost problem and many logged-in users' attacks and these security weaknesses make the scheme inapplicable to practical WSN applications. To tackle these problems, we suggest a simple countermeasure to prevent proposed attacks while the other merits of Xue et al.'s authentication scheme are left unchanged.

An enhanced two-factor user authentication in wireless sensor networks

Since wireless sensor networks (WSN) are often deployed in an unattended environment and sensor nodes are equipped with limited computing power modules, user authentication is a critical issue when a user wants to access data from sensor nodes. Recently, M.L. Das proposed a two-factor user authentication scheme in WSN and claimed that his scheme is secure against different kinds of attack. Later, Khan and Alghathbar (K-A) pointed out that Das' scheme has some security pitfalls and showed several improvements to overcome these weaknesses. However, we demonstrate that in the K-A-scheme, there is no provision of non-repudiation, it is susceptible to the attack due to a lost smart card, and mutual authentication between the user and the GW-node does not attained. Moreover, the GW-node cannot prove that the first message comes from the user. To overcome these security weaknesses of the K-A-scheme, we propose security patches and prove our scheme.

Trust management system in wireless sensor networks: design considerations and research challenges

AbstractTrust is an important factor in wireless sensor networks (WSNs) in terms of security enhancement and successful collaboration. Trust management (TM) can ensure that all communicating nodes are trustworthy during authentication, authorisation, or key management, which makes traditional security services more robust and reliable. Moreover, by helping to find reliable nodes, TM improves cooperation among nodes, which is vital for improvement of system performance. Trust estimations and management are highly challenging issues because of the unique features and susceptibility of WSNs to different attacks. These factors prevent direct application of schemes suited to other networks and require careful design in a TM system. Hence, our objective is to discuss and present the concept and design factors of TM in WSNs in detail. Moreover, we explore the current state of research as well as open research issues by reviewing proposed trust computation and management schemes in WSNs. Copyright © 2013 John Wiley & Sons, Ltd.

A Novel Approach for Authentication Technique in Wireless Sensor Network

Authentication of user in Wireless Sensor Network (WSN) needs research and investigation due to all the characteristics of these networks, such as limitations of power, computation capability and storage resources with the increasing security threats and attacks. All of the popular User Authentication (UA) schemes in WSN are provide only log in time authentication and for checking the authenticity of user no biometric (physical) property of user is applied. In this paper, we enlighten different new approaches that can be effectively used as a UA scheme in WSN.

Omni Directional Antenna Assisted Scheme to Minimize Redundancy in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) incorporate smart antennas for information propagation to offer connected coverage with reduced interference. This paper presents an omni directional antenna assisted scheme for WSNs to reduce network redundancy besides offering connected coverage. The directivity of an omni directional antenna outfitted on a sink node is exploited to reduce network redundancy and at the same time the connectivity of sensor nodes with the sink node is retained. The relationship between lobe count, beam width, rotation angle and directivity of an omni directional antenna in context of sensor networks is also discussed. Simulation results show a significant reduction in overall network redundancy if the rotation angle of the omni directional antenna fitted on the sink node is minimized from 360° to 30° .

A reversible watermarking authentication scheme for wireless sensor networks

Authentication is a very important demand in wireless sensor networks (WSNs), especially in some critical applications. Previous watermarking-based approaches always make irreversible modifications in the watermarked data. In this paper, we propose a novel reversible watermarking authentication scheme for WSNs, which is based on prediction-error expansion. The sensor node groups the stream data, and two adjacent data groups compose the non-overlapping authentication group. The watermark bits are computed from the first data group and embedded into the second one before transmission. The sink does the verification and complete restoration. Compared with the previous work, our approach only buffers copy of current data element instead of the entire data group, which greatly reduces the delay. Analysis and experimental results show that our scheme losslessly authenticates the sensory stream data with low cost.

Automatic ARIMA modeling-based data aggregation scheme in wireless sensor networks

Data aggregation is a very important method to conserve energy by eliminating the inherent redundancy of raw data in wireless sensor networks (WSNs). In this article, we developed an automatic auto regressive-integrated moving averagemodeling-based data aggregation scheme in WSNs. The main idea behind this scheme is to decrease the number of transmitted data values between sensor nodes and aggregators by utilizing time series prediction model. The proposed scheme can effectively save the precious battery energy of wireless sensor nodes while keeping the predicted data values of aggregators within application-defined error threshold. We show through experiments with real data that the predicted data values of our proposed scheme fit the real sensed data values very well and fewer messages are transmitted between sensor nodes and aggregators than the native data aggregation scheme. Furthermore, the characteristics of the proposed data aggregation scheme are also discussed in this article.

Energy-efficient distributed wireless sensor network scheme for cluster detection

Detection of an environmental phenomenon, e.g. air pollution and oil spills, occurs when a group of sensors continuously produces similar readings (i.e. data streams) over a period of time. Thus, detection of environmental phenomena is basically a process of clustering the sensors' data streams, which commonly involves the processing of hundreds and maybe thousands of data streams in real time. Since the sensor network environment is wireless, energy conservation of the sensors would be the main concern. Thus in this paper, we propose an efficient and energy friendly distributed scheme to detect phenomena in a wireless sensor network (WSN). To achieve fast response, the proposed algorithms reduce the dimensionality of the streams. Then, each stream is represented by a point in a multi-dimensional grid. The algorithm uses a grid-based clustering technique to detect clusters of similar stream values. The processing of the algorithm is distributed among different elements of the WSN in a hierarchical topology for more energy efficiency. The paper shows the feasibility of the proposed fully distributed scheme by comparing it with three other WSN schemes in terms of clustering accuracy and energy consumption.

A Heterogeneous-aware Cooperative MIMO Transmission Scheme in WSN

A heterogeneous-aware cooperative MIMO transmission scheme (HAMS) is proposed to optimize the network lifetime and save energy for energy heterogeneous wireless sensor networks (WSN). This scheme extends the traditional low-energy adaptive clustering hierarchy (LEACH) protocol to enable the cooperative MIMO transmission between the sink and clusters. Through the adaptive selection of cooperative nodes and the cooperative MIMO transmission, HAMS can gain effective performance improvement in terms of taking advantage of the presence of node heterogeneity. Based on the energy consumption model developed in this paper, the optimal parameter to minimize the overall energy consumption is found. Simulation results exhibit that HAMS can effectively save energy and prolong the network time. Furthermore, HAMS displays more resilient in different degree of heterogeneous wireless sensor networks.

Traffic-Distributed Clustering Scheme for Cluster-Based WSNs with Various Non-Uniform Traffic Fluctuations

In wireless sensor networks (WSNs), it is essential to save energy consumption at sensor nodes (SNs). A clustering technique is one of the approaches to save energy consumption, where several neighboring SNs form a cluster and transmit the sensed data to their cluster head (CH), and then the CH sends the aggregated data to a sink node. Under spatial non-uniform traffic environments, the clustering technique causes the non-uniformity in data gathering performance and energy consumption between clusters in WSNs. In this paper, we propose a clustering scheme for the WSNs employing IEEE802.15.4 beacon enabled mode under various non-uniform traffic environments. The proposed scheme distributes network traffic uniformly to the clusters through cluster area control by adjusting beacon transmission power, and thereby achieves uniform and improved data gathering performance. In the clusters with expanded area, however, the performance degradation arises from long distance communications. To solve this problem, the proposed scheme controls transmission power at SNs. In addition, to reduce energy consumption the proposed scheme sets the appropriate active period length in duty cycle operation to the current traffic condition. The performance evaluations by computer simulation show the effectiveness of the proposed scheme for the WSNs under various non-uniform traffic environments.

Modeling of Location Estimation for Object Tracking in WSN

Location estimation for object tracking is one of the important topics in the research of wireless sensor networks (WSNs). Recently, many location estimation or position schemes in WSN have been proposed. In this paper, we will propose the procedure and modeling of location estimation for object tracking in WSN. The designed modeling is a simple scheme without complex processing. We will use Matlab to conduct the simulation and numerical analyses to find the optimal modeling variables. The analyses with different variables will include object moving model, sensing radius, model weighting valueα, and power-level increasing ratiokof neighboring sensor nodes. For practical consideration, we will also carry out the shadowing model for analysis.

Virtual Energy Based Encryption & Keying on Wireless Sensor Network

Since the secure communication for Wireless Sensor Network (WSNs) is a challenging problem because sensors are resources limited and cost is the most dominant factor in a energy consumption, for this we introduce an energy-efficient Virtual Energy-Based Encryption and Keying(VEBEK) scheme for WSNs that reduces the number of transmission needed for rekeying the packets. VEBEK is a secure communication framework where sensed data is encoded by a RC4 encryption mechanism based on a permutation code generator. In the RC4 encryption mechanism keys changes dynamically as a function of the residual virtual energy of the sensor. Thus, one-time dynamic key is employed for one packet only and different keys for different packets. VEBEK unbundles key generation from other security services, namely authentication, integrity, non-repudiation. VEBEK is able to efficiently detect & filter false data injected by malicious outsiders. The VEBEK framework consists of two operational modes (VEBEK-1 and VEBEK-2). Our results show that VEBEK, without incurring transmission overhead is able to eliminate malicious data from the network in an energy efficient manner. Keywords- Authentication, Integrity, Non-Repudiation, RC4, Rekeying, VEBEK, WSNs.

Regenerating Code based Secure Distributed Storage for Wireless Sensor Networks

In certain wireless sensor network (WSN) scenarios the data fragments should be stored in a number of sensor nodes, and for the self-sustaining purposes, the storage should possess the ability to repair the lost fragment and to protect data secrecy. For achieving the above goals, we propose employment of the regenerating codes and symmetric-key encryption with a Blom based key management. Particularly note that the encoded blocks stored in the i-th node and originating from the j-th node are encrypted by symmetric key Kij. A common and desirable feature regarding the considered regenerating codes and Blom's key management scheme is that the both are based on employment of Vandermonde matrix, and accordingly yield a unified implementation framework. Preliminary consideration of the implementation complexity of the proposed scheme implies that the energy costs in the both cases, regarding the scenarios with and without the faults, are lower in comparison with related WSN schemes and accordingly suitable for applications related to resources-constrained WSNs. Resource consumption evaluations show the feasibility of the proposed scheme for WSNs. To our best knowledge, this paper is the first to realize the distributed storage with repair capability.

An Analytical Study of Variable Preamble Length-Based Broadcasting Scheme for WSNs

In this paper, we present a detailed analytical study of previously proposed variable preamble length-based broadcasting scheme for wireless sensor networks (WSNs). Analytical results show that in dense wireless sensor networks, broadcasting a packet with a small size preamble can significantly improve the energy conservation on already limited battery powered sensor nodes. For fairer comparison with variable preamble length-based broadcasting scheme, a comprehensive analytical study for an existing probability-based broadcasting scheme is also presented. Analytically calculated results show that variable preamble length-based broadcasting scheme is more energy-efficient than the probability-based broadcasting scheme.