A survey of localization in wireless sensor network

Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network

A resilient key predistribution scheme for multiphase wireless sensor networks

In wireless sensor networks, sensor nodes eventually die due to battery depletion. Wireless sensor networks (WSNs) in which new nodes are periodically redeployed with certain intervals, called generations, to replace the dead nodes are called multi-phase wireless sensor networks. In the literature, there are several key predistribution schemes proposed for secure operation of WSNs. However, these schemes are designed for single phase networks which are not resilient against continuous node capture attacks; even under temporary attacks on the network, the harm caused by the attacker does not heal in time. However, the periodic deployments in multi-phase sensor networks could be utilized to improve the resiliency of the WSNs by deploying nodes with fresh keys. In the literature, there is limited work done in this area. In this paper, we propose a key predistribution scheme for multi-phase wireless sensor networks which is highly resilient under node capture attacks. In our scheme, called RGM (random generation material) key predistribution scheme, each generation of deployment has its own random keying material and pairwise keys are established between node pairs of particular generations. These keys are specific to these generations. Therefore, a captured node cannot be abused to obtain keys of other generations. We compare the performance of our RGM scheme with a well-known multi-phase key predistribution scheme and showed that RGM achieves up to three-fold more resiliency. Even under heavy attacks, our scheme's resiliency performance is 50% better in steady state

Adjacency Matrix Based Energy Efficient Scheduling using S-MAC Protocol in Wireless Sensor Networks

Communication is the main motive in any Networks whether it is Wireless Sensor Network, Ad-Hoc networks, Mobile Networks, Wired Networks, Local Area Network, Metropolitan Area Network, Wireless Area Network etc, hence it must be energy efficient. The main parameters for energy efficient communication are maximizing network lifetime, saving energy at the different nodes, sending the packets in minimum time delay, higher throughput etc. This paper focuses mainly on the energy efficient communication with the help of Adjacency Matrix in the Wireless Sensor Networks. The energy efficient scheduling can be done by putting the idle node in to sleep node so energy at the idle node can be saved. The proposed model in this paper first forms the adjacency matrix and broadcasts the information about the total number of existing nodes with depths to the other nodes in the same cluster from controller node. When every node receives the node information about the other nodes for same cluster they communicate based on the shortest depths and schedules the idle node in to sleep mode for a specific time threshold so energy at the idle nodes can be saved.Comment: 20 pages, 2 figures, 14 tables, 5 equations, International Journal of Computer Networks & Communications (IJCNC),March 2012, Volume 4, No. 2, March 201

AM-DisCNT: Angular Multi-hop DIStance based Circular Network Transmission Protocol for WSNs

The nodes in wireless sensor networks (WSNs) contain limited energy resources, which are needed to transmit data to base station (BS). Routing protocols are designed to reduce the energy consumption. Clustering algorithms are best in this aspect. Such clustering algorithms increase the stability and lifetime of the network. However, every routing protocol is not suitable for heterogeneous environments. AM-DisCNT is proposed and evaluated as a new energy efficient protocol for wireless sensor networks. AM-DisCNT uses circular deployment for even consumption of energy in entire wireless sensor network. Cluster-head selection is on the basis of energy. Highest energy node becomes CH for that round. Energy is again compared in the next round to check the highest energy node of that round. The simulation results show that AM-DisCNT performs better than the existing heterogeneous protocols on the basis of network lifetime, throughput and stability of the system.Comment: IEEE 8th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA'13), Compiegne, Franc

A Non-Cooperative Game Theoretical Approach For Power Control In Virtual MIMO Wireless Sensor Network

Power management is one of the vital issue in wireless sensor networks, where the lifetime of the network relies on battery powered nodes. Transmitting at high power reduces the lifetime of both the nodes and the network. One efficient way of power management is to control the power at which the nodes transmit. In this paper, a virtual multiple input multiple output wireless sensor network (VMIMO-WSN)communication architecture is considered and the power control of sensor nodes based on the approach of game theory is formulated. The use of game theory has proliferated, with a broad range of applications in wireless sensor networking. Approaches from game theory can be used to optimize node level as well as network wide performance. The game here is categorized as an incomplete information game, in which the nodes do not have complete information about the strategies taken by other nodes. For virtual multiple input multiple output wireless sensor network architecture considered, the Nash equilibrium is used to decide the optimal power level at which a node needs to transmit, to maximize its utility. Outcome shows that the game theoretic approach considered for VMIMO-WSN architecture achieves the best utility, by consuming less power.Comment: 12 pages, 8 figure

Energy Harvesting and Management for Wireless Autonomous Sensors

Wireless autonomous sensors that harvest ambient energy are attractive solutions, due to their convenience and economic benefits. A number of wireless autonomous sensor platforms which consume less than 100?W under duty-cycled operation are available. Energy harvesting technology (including photovoltaics, vibration harvesters, and thermoelectrics) can be used to power autonomous sensors. A developed system is presented that uses a photovoltaic module to efficiently charge a supercapacitor, which in turn provides energy to a microcontroller-based autonomous sensing platform. The embedded software on the node is structured around a framework in which equal precedent is given to each aspect of the sensor node through the inclusion of distinct software stacks for energy management and sensor processing. This promotes structured and modular design, allowing for efficient code reuse and encourages the standardisation of interchangeable protocols