The Preserving energy or battery power in Wireless Sensor Network is a major concern, as battery capacity is very limited. A node can transmit data to a longer distance if it has sufficient energy level. It had been researched that the power required to transmit data from source to destination is directly proportional to the distance between nodes. So, in order to transmit data we have to find optimal path with optimal power conservation methodology. This work is aim to reduce power conservation for routing in Wireless Sensor Network using Dijkstra’s algorithm with set of optimal path and available nodes, threshold value of nodes is assumed to be 50% of maximum energy of nodes. The innovative idea in proposed work is to check the sleeping and awaked nodes, which is necessary in order to reduce data loss.

 

Published In : IJCSN Journal Volume 3, Issue 3

Date of Publication : 01 June 2014

Pages : 115 - 118

Figures : 01

Tables : --

Publication Link : A New WSN Scheme Benefited with Low Cost and Power Efficiency

 

 

 

Nidhi Sewal : is persuing M.Tech in Computer Science from Manav Rachna International University and completed her Bachelor’s Degree from Maharishi Dayanand University.

Urvashi chugh : obtained her Master’s Degree from Maharishi Dayanand University, Rohtak. She completed her Bachelor’s Degree from Kurukshetra University. She has six years teaching experience and is now working as an Assistant Professor in Manav Rachna International University.

 

 

 

 

 

 

 

Wireless sensor network

Dijkstra’s algorithm

Optimal Path

Sleeping and Awake nodes

This paper basically focuses to decrease the energy consumption of nodes and to increase network lifetime. Here basically an algorithm is proposed to find a set a of optimal path to reduce power consumption .A wake up signal is send to the selected nodes of the optimal path to reduce data loss. The main advantage of this algorithm lies in its simplicity and battery life of nodes gets increased to great extend.

 

 

 

 

 

 

 

 

 

[1] A. Cerpa and D. Estrin. 2004. ASCENT: Adaptive self-configuring sensor networks topologies,” IEEE Transactions on Mobile Computing, vol. 3, no. 3, pp. 272–285.

[2] Babar Nazir, Halabi Hasbullah and Sajjad A Madani. 2011. Sleep/wake scheduling scheme for minimizing end-to-end delay in multi-hop wireless sensor networks’’, EURASIP Journal on Wireless Communications and Networking.

[3] Feng Zeng, Lan Yao ,Zhigang Chen ,Huamei Qi. 2011. A Distributed and Shortest-Path-Based Algorithm for Maximum Cover Sets Problem in Wireless Sensor Networks.

[4] G. Tan, M. Bertier, and A.-M. Kermarrec.2009 Visibility-graph-based shortest-path geographic routes in sensor networks,” in Proc. of IEEE INFOCOM.

[5] M.Nemaraj,V.Jayaprakashan nd V.Senthil kumar.2013 Power Optimization Technique For Sensor Network",IJCATR,vol.2-Issue 3,255-260.

[6 ] N. Pushpalatha and Dr.B.Anuradha.2012 Distribution of Nodes on Square Method for Wireless Sensor Networks”, in International Journal of Computer Science and Telecommunications [Volume 3, Issue 1, January 2012].

[7] N. Pushpalatha1, Dr.B.Anuradha.2012 Shortest Path Position Estimation between Source and Destination nodes in Wireless Sensor Networks with Low Cost”, Volume 2, Issue 4

[8] N.Pushpalatha and Dr.B.Anuradha.2011 Study of Various Methods of Wireless Ad-hoc Sensor Networks using Multidimensional Scaling for Position Estimation” Global Journal Engineering and AppliedSciences-ISSN2249-2631(online): 2249- 2623(Print) GJEAS Vol.1(3).

[9] Shilpa Mahajan1, Jyoteesh Malhotra.2011. Energy Efficient Path Determination in Wireless Sensor Network Using BFS Approach”, Published Online November 2011.