Providing Privacy and security of Wireless sensor network using ACTOR nodes

Wireless Sensor Networks (WSN) consists of large number sensor nodes. Wireless sensor nodes are generally deployed in the far places like forests deserts and used to sense the network conditions like temperature pressure etc. In such far places it is very difficult to recharge or replace the battery of the sensor node.  The sensor nodes are battery powered devices, they communicate over a wireless medium and consumes energy during data transmission. The various types of active and passive attacks are possible in routing the data from source to sink. In this paper, we propose new technique to prevent these attacks. The mobile sinks is been deployed in the network which collect data from the sensor node and deliver data to fixed base station. In the proposed technique, the data privacy is ensured in the mobile sink. KEYWORDS WSN, Mobile Sinks, Sensor node, Query, batter

Addressing and Solving the problem of Data Authenticity due to Packet Dropping by Selfish Nodes in WSN

Wireless Sensor Networks (WSN) consists of large number sensor nodes. Wireless sensor nodes are generally deployed in the far places like forests deserts and used to sense the network conditions like temperature pressure etc. In such far places it is very difficult to recharge or replace the battery of the sensor node.  The sensor nodes are battery powered devices, they communicate over a wireless medium and consumes energy during data transmission. The various types of active and passive attacks are possible in routing the data from source to sink. In this paper, we propose new technique to prevent these attacks. The mobile sinks is been deployed in the network which collect data from the sensor node and deliver data to fixed base station. In the proposed technique, the data privacy is ensured in the mobile sink. KEYWORDS WSN, Mobile Sinks, Sensor node, Query, batter

ENHANCE FAIR ROUTING WITH RESOURCE FLEXIBLE NODE ALLOCATION IN WIRELESS SENSOR NETWORKS

Wireless sensor network is a network composed of a large number of sensor nodes with limited radio capabilities and one or a few sinks that collect data from sensor nodes. Sensor nodes are powered by small batteries, hence, the energy consumption in operating a WSN should be as low as possible. The wireless sensor network present all sensor nodes generate an equal amount of data packets in a WSN, nodes around a sink have to relay more packets and tend to die earlier than other nodes because the energy consumption of sensor nodes is almost completely dominated by data communication rather than by sensing and processing. Hence, the whole network lifetime can be prolonged by balancing the communication load at heavily loaded nodes around a sink. This problem is called the energy hole problem and is one of the most important issues for WSNs. Existing system analysis the heterogeneity of networks and a fair cooperative routing method, to avoid unfair improvement only on certain networks and to introduce one or a few shared nodes that can use multiple channels to relay data packets

A Closer look on Clustering Protocols in Wireless Sensor Networks

Abstract: -A wireless sensor network is basically a collection of nodes that are organized into a cooperative network. Each node consists of processing capability that contain multiple types of memory and have a transceiver, a power source and accommodate various sensors. These sensor nodes can sense, measure and collect information from the environment and, based on some local decision process, they can transmit the sensed data to the user. In our work we have studied the various cluster formation algorithms. In this study clustering of the nodes are considered with the approach of reducing energy consumption of nodes and a protocol is presented. Due to network clustering there is scalability potential in such a network. According to frequent change of cluster head nodes load distribution is performed in the cluster and eventually increase the network lifetime

Distributed Power Allocation for Sink-Centric Clusters in Multiple Sink Wireless Sensor Networks

Due to the battery resource constraints, saving energy is a critical issue in wireless sensor networks, particularly in large sensor networks. One possible solution is to deploy multiple sink nodes simultaneously. Another possible solution is to employ an adaptive clustering hierarchy routing scheme. In this paper, we propose a multiple sink cluster wireless sensor networks scheme which combines the two solutions, and propose an efficient transmission power control scheme for a sink-centric cluster routing protocol in multiple sink wireless sensor networks, denoted as MSCWSNs-PC. It is a distributed, scalable, self-organizing, adaptive system, and the sensor nodes do not require knowledge of the global network and their location. All sinks effectively work out a representative view of a monitored region, after which power control is employed to optimize network topology. The simulations demonstrate the advantages of our new protocol

Fair Routing for Overlapped Cooperative Heterogeneous Wireless Sensor Networks

In recent years, as WSNs (Wireless Sensor Networks) are diffused widely, multiple overlapping WSNs constructed on the same area become more common. In such a situation, their lifetime is expected to be extended by cooperative packet forwarding. Although some researchers have studied about cooperation in multiple WSNs, most of them do not consider the heterogeneity in characteristics of each WSN such as battery capacity, operation start time, the number of nodes, nodes locations, energy consumption, packet size and/or data transmission timing, and so on. In a heterogeneous environment, naive lifetime improvement with cooperation may not be fair. In this paper, we propose a fair cooperative routing method for heterogeneous overlapped WSNs. It introduces an energy pool to maintain the total amount of energy consumption by cooperative forwarding. The energy pool plays a role of broker for fair cooperation. Finally, simulation results show the excellent performance of the proposed method

Battery allocation for wireless sensor network lifetime maximization under cost constraints

Wireless sensor networks hold the potential to open new domains to distributed data acquisition. However, such net-works are prone to premature failure because some nodes deplete their batteries more rapidly than others due to work-load variations, non-uniform communication, and heteroge-nous hardware. Many-to-one traffic patterns are common in sensor networks, further increasing node power consump-tion heterogeneity. Most previous sensor network lifetime enhancement techniques focused on balancing power distri-bution, based on the assumption of uniform battery capacity allocation among homogeneous nodes. This paper gives a formulation and solution to the cost-constrained lifetime-aware battery allocation problem for sensor networks with arbitrary topologies and heterogeneous power distributions. An integer nonlinear programming for-mulation is given. Based on an energy–cost battery pack model and optimal node partitioning algorithm, a rapid bat-tery pack selection heuristic is developed and its deviation from optimality is quantified. Experimental results indicate that the proposed technique achieves network lifetime im-provements ranging from 3–11 × compared to uniform bat-tery allocation, with no more than 10 battery pack energy levels. The proposed technique achieves 2–5 orders of mag-nitude speedup compared to a general-purpose commercial nonlinear program solver, solution quality improves, and lit-tle approximation error is observed