Wireless Sensor Network is a group of sensor nodes aimed to monitor various environmental conditions at the field locations. Eventually the sensed data is sent to a processing center. Each sensor node consists of a different number of sensors for sensing different parameters in the field area. The sensor nodes are usually equipped with a pair of limited alkaline battery. Achieving maximum coverage deployment is a major problem in wireless sensor networks. In the Existing system, by using the Random Deployment some nodes may get overlapping this will cause unbalanced structure. By using maximum coverage sensor deployment problem, the Coverage achieved only for static nodes. In the proposed system, a Genetic Algorithm is used to deploy Sensor Nodes for the Maximum coverage within the area, where the sensors are of different types. In this work, first analyze the total coverage area the WSN, identify the types of Sensor nodes and Coverage sensing distance, and calculate the coverage sensing distance for the combination of all sensor types based on radius of each node. Improving the deployment of Dynamic nodes for achieving maximum coverage deployment by using Genetic Algorithm. As a result, we were implemented this work in Java. This will show the best performance in coverage and network lifetime.

Improving Coverage Deployment for Dynamic Nodes using Genetic Algorithm in Wireless Sensor Networks

There are many facets of Wireless Sensor Networks (WSN), which provoke research interest. One of the major being routing protocol, i.e. the task of transmitting data from source node to sink node. SPIN (Sensor Protocols for Information via Negotiation) being one of them, which efficiently disseminates information among sensor node in an energy-constrained wireless sensor network. Although in time constrained operation like war zone it is not suited because it take much more time to deliver information among sensor node, also it consume more energy to broadcast data among sensor node that results energy drain faster and node dead quickly. Hence we proposed a modified version of SPIN routing protocol with network being formed using clustering technique, called Cluster Based SPIN (CB-SPIN) routing protocol. For simulation of both protocols SPIN and CB-SPIN, MATLAB platform is used and result show that CB-SPIN gives better performance in terms of time and energy.

Cluster based - SPIN Routing Protocol for Wireless Sensors Networks

Background/Objectives: Improving performances of routing protocols which use the multipath scheme and the hop count routing metric in ad hoc networks in order to satisfy quality of service requirements of different application traffics. Methods/Statistical Analysis: This paper proposes a technique to estimate the values of delay and packet loss ratio of MAC layer’s links by using the ETX technique and the service time calculation of DCF in CSMA/CA principle, respectively. After that, these values are combined with the weights which are obtained from application traffic classification using cross-layer approach to establish new routing metrics. These metrics are suitable for Quality of Service (QoS) requirements of applications. Findings: Traditional multipath routing protocols operate only in Network layer and utilize a static routing metric which leads them to be unable to give route priority to different traffic classes from Application layer. After applying the suitable dynamic routing metrics of delay and packet loss ratio for application traffic classes when implementing new multipath routing protocol named QCLR in NS2 simulator, the results of performance evaluations show that the performance of proposed protocol higher than AOMDV protocol regarding to higher throughput, lower overhead traffic, higher packet delivery ratio and smaller end-to-end delay for both of Class 1 and Class 2 traffics. Applications/Improvements: Improving quality of routing service for applications which have different traffic classes, especially for multimedia applications.

Improving Multipath Routing Protocols Performance in Mobile Ad Hoc Networks based on QoS Cross-Layer Routing

Wireless Sensor Networks(WSN) used in a variety of applications are usually unattended in nature and are highly susceptible to attacks such as eavesdropping, hardware tampering and false messages. For secure communication among the nodes, Secret key cryptography is used since it provides high security with low computing power. Existing key management schemes does not guarantee the level of security and network performance. To handle such problems, random seed distribution with transitory cluster key, a hybrid approach is used which is the integration of both random key distribution and the transitory master key. The security analysis shows that our approach provides enhanced resilience and better connectivity by establishing secure channels among the communicating nodes in a hierarchical clustered wireless sensor network. It over persuades the state-of-the-art protocols by providing always the best security features.

A Hybrid Key Management Approach for Secure Communication in Wireless Sensor Networks

More energy in wireless sensor network is spent in routing part as compare to other operation in sensor network. To route data in efficient manner detecting optimal path for routing is better solution. For time critical application, detection of optimal path should be faster enough to make the application efficient. This paper focus on detecting of optimal path by using parallel ant colony optimization algorithm. K-Mean clustering approach is used for grouping of sensor nodes because it is faster than other hierarchical clustering algorithm. Rotating the cluster head while implementing algorithm based on friss free space propagation model, increases the lifetime of the network. This proposed system is developed using Java. The results shows that proposed system detect the optimal path faster than existing system with better lifetime of the network.

A Novel Approach using Parallel Ant Colony Optimization Algorithm for Detecting Routing Path based on Cluster Head in Wireless Sensor Network

QoS of WSN routing protocols are measured in terms of energy-efficiency, end-to-end delay and packet delivery ratio Multi-path routing provides an easy mechanism to distribute traffic, balance networks load and fault tolerance However disadvantage of employing multipath routing is delay in path switching and every node has to maintain information of every other node and has to update the whole information periodically which consumes lot of energy So to overcome this drawback we employ clustering mechanism which divides the entire network in to clusters and multipaths are restricted to these clusters by which traffic will be distributed only to the cluster without propagating entire network and does not cause delay, energy wastage and increases delivery ratio between nodes Performance is compared between proposed protocol and EQSR protocol by simulating in NS2

G. Aswani Kumar Reddy

Papers

Cluster Based Multipath Dynamic Routing (CBDR) Protocol for Wireless Sensor Networks