Abstract

In WSN sensor nodes are connected to their neighbor nodes by a wireless channel and these all nodes are operated on a battery to perform any operations. So improving the lifetime of WSN is a major research challenge by effective utilization of each and every node’s energy. The lifetime of WSNs can be improved in three steps: path creation, path selection, and power saving. In existing works, path selection has the major role to utilize and enhance lifetime. In the proposed PStack algorithm, path generation is a major concern, and routing is applied. It takes advantage of and solves the limitations of existing algorithms using the stack concept in WSN. The proposed algorithm shows a better result than the improved LEACH protocol because it uses the data structure with graph theory.

Introduction 

Basic foundation of any kind of network communication is path generation from source to destination. Especially in the WSN path generation has a major role. A better path generating between source and destination leads to optimized load balancing and achieves high lifetime. Most of the existing models have single backbone meaning that it creates a single path in network with single backbone, may not be ideal to prolong the lifetime[1]. A simple WSN model is considered with six sensor nodes and a sink as depicted in figure1. It is understood that all sensor nodes are kept active 24X7 irrespective of whether is it in use or not. This leads to unnecessary usage of battery power leading to drain down quickly. Therefore the node automatically disconnected itself from its neighbours[5].

In this work node’s energy means all node’s energy not only the selected nodes energy. Because improving the node’s energy may not able to prolong the lifetime, it can be happen only when all nodes energy will be utilize effectively without wasting any nodes energy. According to the review of literature, there are various techniques introduced and implemented to improve the lifetime of WSN. All these techniques were applied either in routing algorithms or region (area) of WSN as cluster. These techniques may be categories as: 1. WSN with single sink and 2.WSN with more than one sink.

CONCLUSION

PStack algorithm in WSN eliminate the drawbacks of all existing protocol, which is used for the improvement of lifetime of WSN such as AODV, CDS, KMAT, DSR, NBS, VBS and cluster. PStack algorithm results will be in form of the number of stacks with different sizes. Number of stacks represents the number of paths from source to sink and size of stack represents the number of sensor nodes in particular path which having the significant roles for path selection technique. This is the great way to improve the lifetime of any kinds of WSN. This algorithm works more effectively when density of nodes are high. It also supports for static as well as dynamic nodes in WSN.

Limitation of this work is that this assumption may have chances to become wrong if sensor nodes participated in any communication without knowledge of sink, or sink didn’t able to update the energy level of nodes properly