Call for Paper - September 2020 Edition
IJCA solicits original research papers for the September 2020 Edition. Last date of manuscript submission is August 20, 2020. Read More

Optimization and Energy Efficient Analysis of Shortest Path Algorithm in WSN for Node Failure

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Authors:
Preeti Rathore, Vivek Kumar
10.5120/ijca2017914396

Preeti Rathore and Vivek Kumar. Optimization and Energy Efficient Analysis of Shortest Path Algorithm in WSN for Node Failure. International Journal of Computer Applications 167(10):36-42, June 2017. BibTeX

@article{10.5120/ijca2017914396,
	author = {Preeti Rathore and Vivek Kumar},
	title = {Optimization and Energy Efficient Analysis of Shortest Path Algorithm in WSN for Node Failure},
	journal = {International Journal of Computer Applications},
	issue_date = {June 2017},
	volume = {167},
	number = {10},
	month = {Jun},
	year = {2017},
	issn = {0975-8887},
	pages = {36-42},
	numpages = {7},
	url = {http://www.ijcaonline.org/archives/volume167/number10/27811-2017914396},
	doi = {10.5120/ijca2017914396},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

The performance of the heterogeneous protocols in terms of stability and network lifetime, DEEC preformed better as compare to others protocols. It is compare the different levels of DEECs performance in terms of number of node alive, number of node fail, stability, network lifetime and energy. Nodes are randomly deployed and each node has initially limited energy. Sensor nodes transmit sensed information to the sink or Base Station (BS) with minimum time delay. When the large numbers of rounds (Rmax) have been involved in the system, the energy has been sharply decreases, so the first node has been died due to low battery and the connection has been broken. Thus, result in unsuccessful information transmission. To overcome this problem, the simulation results of the heterogeneous protocols performance in term of network lifetime, number of nodes alive during rounds and data packets sent to BS.

References

  1. Guo-Lie Lan, Zhi-Ming Ma and Su-Yong Sun ,”Coverage Of Wireless Sensor Networks.”,2002
  2. S.K L V Sai Prakash and P. Niranjan.” Area Based Covered For Three Deployment Distributions And Their Connectivity In Wireless Sensor Networks.” The International Conference on Communication Systems and Network Technologies, 2014.
  3. E.P.De Freitas T. Heimfarth, I.F Netto, C.E. Pereira, A.M. Ferreira F.R. Wagner, and T. Larsson, “Handling Failure of Static Sensor Nodes in Wireless Sensor Network by Use of Mobile Sensors.” In Advanced Information Networking and Applications (Waina), 2011 IEEE Workshops of International Conference On. IEEE, 2011, Pp.127-134.
  4. S.K L V Sai Prakash and P. Niranjan,” Movement Minimization of Randomly Deployed Mobile Nodes for Complete Coverage and Connectivity.” The International Conference on Advance Communication Control and Computing Technologies (ICACCCT), 2014.
  5. Seema V, Pinki, N, And Rekha Agarwal, “Energy Efficient Routing In Mobile Adhoc Networks Based On AODV Protocol,” International Journal Of Computer Science. Nov, 2012.
  6. Sourabh Jain, Praveen Kaushik, and Jyoti Singhai, “Energy Efficient Maximum Lifetime Routing For Wireless Sensor Network.” International Journal Of Advanced Smart Sensor Network Systems (IJSSAN); Jan 2012.
  7. Sarvesh Singh Rai, D. Ahirwar,” Improvement Of AODV Routing Protocol Algorithm With Link Stability And Energy Efficient Routing For MANET , International Journal Of Computer Science Engineering And Technology(IJCSET) Feb 2014.
  8. Neeti Nema,” Gateway Based Shortest Path Detection Using Dijkastra’s Algorithm and Closest Adjacency Condition (DA-CAC) In WSN.” International Journal of Advanced Research in Computer Science and Software Engineering. Nov 2014
  9. Jin W, J.U.Kim, L. Shu, Yu Niu and S. Lee,” A Distance Based Energy Aware Routing Algorithm for WSN.”SENSORS 2010.
  10. P. Rani, Satish Kumar,” New Cluster Making Scenario for Next Generation System Using Graph Theory System.” IJRECE, Apr- June 2015.
  11. Jin Wang, Z. Zhang, F. Xia, W. Yuan and S. Lee, “An Energy Efficient Stable Election Based Routing Algorithm for Wireless Sensor Networks,” Sensors 2013.
  12. M. Kamath, Nandini .M,” Cluster Head Selection Algorithm to Minimize Energy Consumption in WSN,”IJIRCCE May 2014, ICACCE (ACCE- Apr 2014).
  13. Monika Raghatate And Prof Dipak W. Wajgi,” An Energy Saving Algorithm To Prolong The Lifetime Of WSN. International Journal of Wireless and Mobile Network (IJWMN), Oct 2014.
  14. L.Qing, Q. Zhu, M. Wang,” Design Of A Distributed Energy Efficient Clustering (DEEC) Algorithm for Heterogeneous Wireless Sensor Networks,” Science Direct, Elsevier 10 March 2006.
  15. Bra him E., S.Rachid, Sanna E .L.Fkihi, Driss, “A Developed Distributed Energy Efficient Clustering (DDEEC) For Heterogeneous WSNs,” IEEE 2010.
  16. Parul Saini, Ajay .K. Sharma,” Enhanced Distributed Energy Efficient Clustering (EDEEC) Scheme for Heterogeneous WSN. 2010 1st International Conference on Parallel, Distributed and Grid Computing.
  17. Parul Saini, Ajay .K. Sharma,”Energy Efficient Scheme for Clustering Protocol Prolonging the Lifetime of Heterogeneous WSN (TDEEC).”International Journal Of Computer Application Sep
  18. Georgiou S. Ibrahim Matta, Azer. B “Sep- A Stable Election Protocol for Clustering Heterogeneous Wireless Sensor Networks.”

Keywords

Energy Efficient, heterogeneous protocols life time, stability, node failure, static nodes, mobiles nodes, shortest distance;