CFP last date
22 April 2024
Reseach Article

An Improvement of Network Life Time using DLQAR Protocol in Wireless Sensor Network

by Kulvir Singh, Sunny Behal, Vishal Kumar Arora
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 119 - Number 21
Year of Publication: 2015
Authors: Kulvir Singh, Sunny Behal, Vishal Kumar Arora
10.5120/21362-4378

Kulvir Singh, Sunny Behal, Vishal Kumar Arora . An Improvement of Network Life Time using DLQAR Protocol in Wireless Sensor Network. International Journal of Computer Applications. 119, 21 ( June 2015), 28-32. DOI=10.5120/21362-4378

@article{ 10.5120/21362-4378,
author = { Kulvir Singh, Sunny Behal, Vishal Kumar Arora },
title = { An Improvement of Network Life Time using DLQAR Protocol in Wireless Sensor Network },
journal = { International Journal of Computer Applications },
issue_date = { June 2015 },
volume = { 119 },
number = { 21 },
month = { June },
year = { 2015 },
issn = { 0975-8887 },
pages = { 28-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume119/number21/21362-4378/ },
doi = { 10.5120/21362-4378 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:04:41.190482+05:30
%A Kulvir Singh
%A Sunny Behal
%A Vishal Kumar Arora
%T An Improvement of Network Life Time using DLQAR Protocol in Wireless Sensor Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 119
%N 21
%P 28-32
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A Wireless Sensor Network(WSN) is critical network defined with restricted resources and constraints . Wireless Sensor Network are used multiple application like security ,military and health application. To optimize the network route and network life, under these constraints is always a challenge. In this paper, a multi parameter based hop selection analysis based algorithm is proposed to generate the optimized route over the sensor network based on Residual energy ,Failure rate and sensing range using DLQAR protocol. The no. of alive node , dead node, residual energy, energy consumption terms are used to analyze the proposed algorithm. These parameter dynamic analyze the network route and change the network route as per requirements . The proposed work uses the threshold value to perform the critical node elimination. The results obtained show that the proposed algorithm is better as compared to existing algorithm in terms of alive node, dead node, residual energy, energy consumption.

References
  1. M. . MChandane,"Distributed Link Quality Aware Routung in Wireless Sensor Network:,978-1-4 673-0089-6/12@2012 IEEE
  2. Vishal Arora, Sunny Behal , Charanjit Singh ," Communication in WSN", 2nd National Conference on challenges & opportunities in Information Technology(COIT-2008),RIMT-IET, Mar 29-2008,Pg no 202-206.
  3. Amandeep Singh , Sunny Behal," Termite Hill Protocol for network life time in Wireless Sensor Network : Review of Selected Techniques", International journal of Emerging Technology and Advanced Engineering (IJETAE) , Volume 2,Issue 10 ,Page No 453-458, October 2012Tavel, P. 2007 Modeling and Simulation Design. AK Peters Ltd.
  4. AmandeepSingh , Sunny Behal ,"Ant Colony Optimization for improving Network Lifetime in Wireless Sensor Network ", IJAIEM,Vol-2, Issue -4, April 2013, page no 346-352.
  5. Kulvir Singh Sunny Behall, "A Review on Routing Protocols in Wireless Mesh Network" , International Journal of Application or Innovation in Engineering & Management (IJAIEM),pg no. 143-149,Vol-2,Issue-2, Feb 2013
  6. Navjot Sharma, Sunny Behal, "A Systematic way of Soft – Computing Implementation for Wireless Sensor Network Optimization using Bacteria Foraging Optimization Algorithm : A Review", International Journal of Applicaion or Innovation in Engineering & Management (IJAIEM), Vol-2, Issue-2pg no. 150-154, Feb 2014. [ISSN:2319-4847]
  7. DivyaPrabha, Vishal Kumar Arora," A Survey on LEACH & its descendent Protocols in WSN ", International Conference on Communication ,Compunting& System ,2014
  8. Hao Wen," RENA: Region-based Routing in Intermittently Connected Mobile Network", MSWiM'09, October 26–29, 2009, Tenerife, Canary Islands, Spain. ACM 978-1-60558-616-9/09/10.
  9. Jiejun Kong,"ANODR: ANonymous On Demand Routing with Untraceable Routes for Mobile Adhoc Networks", MobiHoc'03, June 1–3, 2003, Annapolis, Maryland, USA ACM 1-58113-684-6/03/0006
  10. Kyu-Hwan Lee," Routing based Authentication for Mobile Ad hoc Network in Home Environment".
  11. AthanasiosBamis," A Mobility Sensitive Approach for Efficient Routing in Ad Hoc Mobile Networks", MSWiM'06, October 2–6, 2006, Torremolinos, Malaga, Spain. ACM 1-59593-477-4/06/0010
  12. Khaleel Ur Rahman Khan," An Efficient Integrated Routing Protocol for Interconnecting Mobile Ad Hoc Networks and the Internet", International Conference on Advances in Computing, Communication and Control (ICAC3'09) ICAC3'09, January 23–24, 2009, Mumbai, Maharashtra, India. ACM 978-1-60558-351-8
  13. S. Sathish," Cache Based Ant Colony Routing Algorithm for Mobile Ad hoc Networks".
  14. Giovanni Comarela," Robot Routing in Sparse Wireless Body Sensor Networks with Continuous Ant Colony Optimization", GECCO'11, July 12–16, 2011, Dublin, Ireland. Copyright 2011 ACM 978-1-4503-0690-4/11/07
  15. C D'Souza," Implementation of Particle Swarm Optimization Based Methodology for Node Placement in Wireless Body Sensor Networks", International Conference and Workshop on Emerging Trends in Technology (ICWET 2011) – TCET, Mumbai, India ICWET'11, February 25–26, 2011, Mumbai, Maharashtra, India. ACM 978-1-4503-0449-8/11/02
  16. Taesoo Jun," Automated Routing Protocol Selection in Mobile Ad Hoc Networks", SAC'07March 1115, 2007, Seoul, Korea ACM 1-59593-480-4/07/0003
  17. Jing-huiZhong," Ant Colony Optimization Algorithm for Lifetime Maximization in Wireless Body Sensor Network with Mobile Sink", GECCO'12, July 7-11, 2012, Philadelphia, Pennsylvania, USA. ACM 978-1-4503-1177-9/12/07
Index Terms

Computer Science
Information Sciences

Keywords

WSN Routing Constraints Failure Probability .