CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Bio Inspired Energy Efficient Routing Approach to Resolve Broken Link Problem in WSN

by Neelam Chauhan, Amit Nain, Durgesh Srivastava
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 48 - Number 25
Year of Publication: 2012
Authors: Neelam Chauhan, Amit Nain, Durgesh Srivastava
10.5120/7545-0194

Neelam Chauhan, Amit Nain, Durgesh Srivastava . A Bio Inspired Energy Efficient Routing Approach to Resolve Broken Link Problem in WSN. International Journal of Computer Applications. 48, 25 ( June 2012), 18-24. DOI=10.5120/7545-0194

@article{ 10.5120/7545-0194,
author = { Neelam Chauhan, Amit Nain, Durgesh Srivastava },
title = { A Bio Inspired Energy Efficient Routing Approach to Resolve Broken Link Problem in WSN },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 48 },
number = { 25 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 18-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume48/number25/7545-0194/ },
doi = { 10.5120/7545-0194 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:45:08.396038+05:30
%A Neelam Chauhan
%A Amit Nain
%A Durgesh Srivastava
%T A Bio Inspired Energy Efficient Routing Approach to Resolve Broken Link Problem in WSN
%J International Journal of Computer Applications
%@ 0975-8887
%V 48
%N 25
%P 18-24
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Energy and efficiency are always the main concern in wireless sensor network. In a sensor network the nodes are present with limited energy and with each transmission they loss some energy. Because of this it is required to minimize the rerouting to save the energy loss. Our work is defined in same area. We proposed an algorithm to get the efficiency as well as the reliability. In this work an energy efficient maximally covered sensor network algorithm is presented such that addresses the requirements of power efficient infrastructure issues for WSN. In this work we proposed a bio inspired dynamic route identification approach in case of any broken link or intrusion in the path. The system will look for the compromising path to optimize the throughput

References
  1. João Pedro," Distributed Routing Path Optimization for OBS Networks based on Ant Colony Optimization", IEEE "GLOBECOM" 2009 978-1-4244-4148-8/09©2009
  2. Maumita Bandyopadhyay," Zone Based Ant Colony Routing In Mobile Ad-hoc Network", 978-1-4244-5489-1/10© 2010 IEEE
  3. Ahmed A. A. Zakzouk," An Ant Colony Optimization Approach for Solving Shortest Path Problem with Fuzzy Constraints".
  4. Afshin Ghanizadeh," A Fuzzy-Particle Swarm Optimization Based Algorithm for Solving Shortest Path Problem", 978-1-4244-6349-7/10@ 2010 IEEE
  5. Michael Rinehart," A Graph Reduction for Bounding the Value of Side Information in Shortest Path Optimization", 2010 American Control Conference Marriott Waterfront, Baltimore 978-1-4244-7427-1/10©2010 AACC
  6. Michael Rinehart," The Value of Sequential Information in Shortest Path Optimization", 2010 American Control Conference Marriott Waterfront, Baltimore 978-1-4244-7427-1/10©2010 AACC
  7. Yanfang Deng," Dynamic Shortest Path in Stochastic Traffic Networks Based on Fluid Neural Network and Particle Swarm Optimization", 2010 Sixth International Conference on Natural Computation (ICNC 2010) 978-1-4244-5961-2/10©2010 IEEE
  8. Michael Rinehart," The Value of Side Information in Shortest Path Optimization", IEEE TRANSACTIONS ON AUTOMATIC CONTROL 0018-9286© 2011 IEEE
  9. Marina Yusoff," A Discrete Particle Swarm Optimization with Random Selection Solution for the Shortest Path Problem", 978-1-4244-7896-5/10@ 2010 IEEE
  10. Zhang Huidang," The Particle Swarm Optimization with decaying ICMIC for Shortest Path Computation in Computer Networks", 2010 International Conference on Computational Intelligence and Security 978-0-7695-4297-3/10© 2010 IEEE
  11. Je´ roˆme Barclay," Multiple Object Tracking Using K-Shortest Paths Optimization", IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 0162-8828/11@ 2011 IEEE
  12. Kavitha Bhaskaran," Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)", IEEE ICC 2011 978-1-61284-233-2/11©2011 IEEE
  13. H. Kusetogullari," K- Shortest Path Network Problem Solution with a Hybrid Genetic Algorithm: Particle Swarm Optimization Algorithm", ICTON 2011 978-1-4577-0882-4/11©2011 IEEE [14 W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, "An Application-Specific Protocol Architecture for Wireless Microsensor Networks," IEEE Transactions on Wireless Communications, Vol. 1, No. 4, pp. 660-670, Oct. 2002.
  14. N. Gupta and S. R. Das, "Energy Aware On-Demand Routing for Mobile Ad Hoc Networks," Proc. 4th International Workshop on Distributed Computing, pp. 164-173, Dec. 2002.
  15. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A Survey on Sensor Networks," IEEE Communications Magazine, Vol. 40, No. 8, pp. 102-114, August 2002.
  16. C. Perkins, E. Belding-Royer, and S. Das, "Ad Hoc On-Demand Distance Vector (AODV) Routing," IETF RFC 3561, July 2003.
Index Terms

Computer Science
Information Sciences

Keywords

Wsn Energy Optimization Bio Inspired Ant Optimization Approach Lifetime Research Methodology

Powered by PhDFocusTM