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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Routing Efficiency Evaluation in Wireless Sensor Networks

by Mina Malekzadeh, Amirhamzeh Nazari, M.H. Shahrokh Abadi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 125 - Number 5
Year of Publication: 2015
Authors: Mina Malekzadeh, Amirhamzeh Nazari, M.H. Shahrokh Abadi
10.5120/ijca2015905911

Mina Malekzadeh, Amirhamzeh Nazari, M.H. Shahrokh Abadi . Routing Efficiency Evaluation in Wireless Sensor Networks. International Journal of Computer Applications. 125, 5 ( September 2015), 21-24. DOI=10.5120/ijca2015905911

@article{ 10.5120/ijca2015905911,
author = { Mina Malekzadeh, Amirhamzeh Nazari, M.H. Shahrokh Abadi },
title = { Routing Efficiency Evaluation in Wireless Sensor Networks },
journal = { International Journal of Computer Applications },
issue_date = { September 2015 },
volume = { 125 },
number = { 5 },
month = { September },
year = { 2015 },
issn = { 0975-8887 },
pages = { 21-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume125/number5/22429-2015905911/ },
doi = { 10.5120/ijca2015905911 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:15:14.756066+05:30
%A Mina Malekzadeh
%A Amirhamzeh Nazari
%A M.H. Shahrokh Abadi
%T Routing Efficiency Evaluation in Wireless Sensor Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 125
%N 5
%P 21-24
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Today wireless sensor networks (WSNs) have gained grate popularity and are widely used in variety of areas due to their unique features. WSNs are deployed in an ad-hoc manner and consist of a large number of tiny sensor nodes. The sensor nodes communicate with each other through the routes established by the routing algorithms. Routing is considered as a challenging task in WSNs because it can highly affect the overall performance of these networks. This paper focuses on performance evaluation of two popular routing algorithms: Ad-Hoc on Demand Distance Vector (AODV) and Dynamic Source Routing (DSR). Simulations are performed using NS2 to evaluate and compare the efficiency of these routing algorithms under different network conditions.

References
  1. P.Singh, A.K. Sharma, and T. S. Kamal. Performance analysis of a routed ad hoc networks using different routing algorithms. International Journal of Computer Networking Wireless and Mobile Communications (IJCNWMC), Vol. 3, No. 1, pp. 117-122, 2013.
  2. E.Chatzistavros and G.Stamatellos. Comparative Performance Evaluation of Routing Algorithms in IEEE 802.11 Ad Hoc Networks. International Journal of Computer Science (IJCSI), Vol. 7, No. 4, pp. 1-10, 2010.
  3. N.Qadri and A.Liotta. A comparative analysis of routing protocols for manets. International Conference Wireless Applications and Computing (IADIS), pp.149-154, 2008.
  4. M.Kumar, R.Rishi, and D.K. Madan. Comparative Analysis of CBRP, DSR, AODV Routing Protocol in MANET. International Journal on Computer Science and Engineering (IJCSE), Vol. 02, No. 09, pp. 2853-2858, 2010.
  5. P.K.Bhardwaj, S.Sharma, and V.Dubey. Comparative Analysis of Reactive and Proactive Protocol of Mobile Ad-Hoc Network. International Journal on Computer Science and Engineering (IJCSE), Vol. 4, No. 07, pp.1281-1288, 2012.
  6. S.Lally and L.Trajković. Performance Analysis of Routing Protocols for Wireless Ad-HocNetworks. Simon Fraser University, Canada, pp. 1-8, 2011.
  7. D.Dembla and Y.Chaba. Performance analysis of on demand routing protocols of mobile ad hoc networks - A comparative study. The Journal of Computer Science and Information Technology, Vol. 3, No.1, pp. 30-34, 2006.
  8. P. Vijayalakshmi, V.Saravanan, and P. Ranjit Jeba. Mobile Ad Hoc Routing Protocols - A Comparative Performance Analysis by Diversifying the Nodes. International Journal of Computer Applications, Vol. 21, No. 5, pp. 42 – 47, 2011.
  9. K.Karthikeyan, S.Appalabatla, M.Nirmala, and T.Tesfazghi. Comparative Analysis of Non-Uniform Unicast Routing Protocols for Mobile Adhoc Networks. International Journal of Advanced Research in Computer Science and Software Engineering, Vol. 2, No. 12, pp. 227-232, 2012.
  10. S.Kant and K.Kumar. Performance Analysis Of Dynamic Source Routing Protocol In Wireless Mobile Ad Hoc Network. International Journal of Engineering Research & Technology (IJERT), Vol. 1, No. 10, pp. 1-7, 2012.
  11. F.Yu. A Survey of Wireless Sensor Network Simulation Tool.http://www1.cse.wustl.edu/~jain/cse567-11/ftp/sensor/index.html
  12. M.Korkalainen, M.Sallinen, N.Kärkkäinen, and P.Tukeva. Survey of Wireless Sensor Networks Simulation Tools for Demanding Applications. IEEE International Conference on Networking and Services (ICNC), pp. 102-106, 2009.
  13. Chuanyi Ji. Measurement-Based Network Monitoring and Inference: Scalability and Missing Information IEEE journal on selected areas in communications, Vol. 20, No. 4, pp.714-725, 2002.
Index Terms

Computer Science
Information Sciences

Keywords

Scalability Routing efficiency Nodes density

Powered by PhDFocusTM