Showing papers on "Wireless sensor network published in 1969"

Anomaly Detection in Wireless Sensor Network

Abstract: Wireless sensor networks (WSNs) are prone to vulnerabilities due to their resource constraints and deployment in remote and unattended areas. A sensor node exhibits anomaly in behaviour due to its dying energy level or being compromised by the intruders. The node showing anomalous behaviours being a leader node (LN) of a cluster/group multifolds the vulnerability problem. To identify the anomalous nodes in WSNs, this paper presents a model, which uses a Voronoi diagram based network architecture. The network architecture, which deploys mobile data collectors (MDCs), ensures the compatibility of the anomaly detection model for the resource constrained WSNs, and warrants data integrity between the MDCs and the LNs. Our empirical evidence shows the effectiveness of the proposed approach.

Data monitoring system

Abstract: A data monitoring system for use with yarn winders and the like including a yarn-break sensor network which senses the existence of a yarn break for each bobbin-cone or spindle combination of the winder. An indicator network or red-light network is provided for determining when a red light occurs as a result of the failure of the winder to successfully tie together broken strands of yarn. A full-cone sensor and accumulator network is provided in circuit with the yarn-break sensor network and the indicator network and an efficiency determining network is connected in circuit with the yarn-break sensor network, the indicator network and the full-cone sensor and accumulator network for determining and indicating the efficiency of operation of the winder. A slub count accumulator system is also provided.

An Improved DV-Hop Localization Algorithm Based on Energy-saving Non-ranging Optimization

Abstract: In order to reduce energy-consumption and hardware investment in wireless sensor networks, an improved DV-Hop localization algorithm based on energy-saving non-ranging optimization is proposed. In this algorithm, only one anchor node broadcasts its position coordinate information to other node, thus greatly reducing the energy consumption of the node. Non-ranging energy-saving optimization algorithm is first adopted, where the size of the anchor node’s average hop and the distance of average hop between anchor nodes are used to estimate the distance between anchor node and unknown node so as to obtain the location coordinates of unknown node. In order to improve the localization accuracy, the ratio of position is introduced to reduce the localization error after obtaining the estimation of coordinates. Simulation experiment results show that compared with the DV-Hop algorithm based on least squares and the DV-Hop algorithm based on improved particle swarm optimization, our proposed localization algorithm can significantly reduce the localization error and the number of anchor nodes, which has better results in the localization accuracy and the energy-saving performance

Dynamic Cluster-based Routing for Wireless Sensor Networks

Abstract: This paper proposes a new clustering scheme for wireless sensor networks, which efficiently balances the energy usage inter- and intra-clusters, by using the k - medoids method and the intra-cluster head update policy. Particularly, we propose a simple-but-effective routing tree algorithm to maintain a dynamic energy-efficient tree structure over all cluster heads, in order to further reduce the energy consumption for those heads to relay data to the sink. We also conduct simulations with realistic configurations to evaluate our design in terms of system lifetime, by comparing with LEACH. The experimental results show the efficiency and effectiveness of our work.

Energy-Efficient Routing Protocol for Network Life Enhancement in Wireless Sensor Networks

Abstract: The Wireless Sensor Network (WSN) is composed of autonomous nodes consist of sensors to collect the status of the surrounding environment. These nodes are equipped with limited batteries. One cannot recharge or replace the batteries of the nodes during the mission, as the applications of WSNs include in underwater, forest driven and mountain based. Thus available energy must be utilized effectively. Energy efficient routing is one of the primary sources of energy management. Cluster-based routing in WSN is a prevalent method to achieve network performance and energy efficiency. In literature, the number of cluster-based energy efficient routing protocols and their route selection metric is designed based on the residual status of node energy. However, this metric causes some of the intermediate nodes to drain energy instantly. In wireless networks this situation roots intermediate nodes to turn into a bottleneck node, and thereby performance degradation in terms of efficiency and packet delivery caused. Thus our paper aims to design a cluster based routing protocol to prevent the creation of intermediate bottleneck node. We introduce a novel routing metric called “ranking status” for the bottleneck problem. Performances results indicate that the proposed routing protocol prevents the creation of intermediate bottleneck node, and improve the network's performance.

Improved Privacy in Wireless Sensor Network using QoS Routing Protocols

Abstract: Full network level privacy has often been categorized into four sub-categories:Identity, Route, Location and Data privacy. Achieving full network level privacy is a challenging problem due to the conditions imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). This proposed paper consists of two algorithms IRL algorithm and data privacy mechanism that addresses this problem. The proposed system provides additional trustworthiness, less computation power, less storage space and more reliability. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.