Journal IJCRT UGC-CARE, UGCCARE( ISSN: 2320-2882 ) | UGC Approved Journal | UGC Journal | UGC CARE Journal | UGC-CARE list, New UGC-CARE Reference List, UGC CARE Journals, International Peer Reviewed Journal and Refereed Journal, ugc approved journal, UGC CARE, UGC CARE list, UGC CARE list of Journal, UGCCARE, care journal list, UGC-CARE list, New UGC-CARE Reference List, New ugc care journal list, Research Journal, Research Journal Publication, Research Paper, Low cost research journal, Free of cost paper publication in Research Journal, High impact factor journal, Journal, Research paper journal, UGC CARE journal, UGC CARE Journals, ugc care list of journal, ugc approved list, ugc approved list of journal, Follow ugc approved journal, UGC CARE Journal, ugc approved list of journal, ugc care journal, UGC CARE list, UGC-CARE, care journal, UGC-CARE list, Journal publication, ISSN approved, Research journal, research paper, research paper publication, research journal publication, high impact factor, free publication, index journal, publish paper, publish Research paper, low cost publication, ugc approved journal, UGC CARE, ugc approved list of journal, ugc care journal, UGC CARE list, UGCCARE, care journal, UGC-CARE list, New UGC-CARE Reference List, UGC CARE Journals, ugc care list of journal, ugc care list 2020, ugc care approved journal, ugc care list 2020, new ugc approved journal in 2020, ugc care list 2021, ugc approved journal in 2021, Scopus, web of Science.
How start New Journal & software Book & Thesis Publications

INTERNATIONAL JOURNAL OF CREATIVE RESEARCH THOUGHTS - IJCRT (IJCRT.ORG)

International Peer Reviewed & Refereed Journals, Open Access Journal

IJCRT Peer-Reviewed (Refereed) Journal as Per New UGC Rules.

ISSN Approved Journal No: 2320-2882 | Impact factor: 7.97 | ESTD Year: 2013

Call For Paper - Volume 14 | Issue 3 | Month- March 2026

Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 7.97 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(CrossRef DOI)

Submit Your Paper
Login to Author Home
Communication Guidelines

WhatsApp Contact
Click Here

  Published Paper Details:

  Paper Title

OPTIMIZED ROUTING IN WIRELESS SENSOR NETWORKS THROUGH PARTICLE SWARM OPTIMIZATION AND BREADTH FIRST SEARCH TECHNIQUES

  Authors

  Dr R Satheeskumar,  Menaga Devi N

  Keywords

Breadth First Search (BFS), NS2 (Network Simulator 2), Particle Swarm Optimization (PSO), PSOR (Particle Swarm Optimization-based Routing), Wireless Sensor Networks (WSNs)

  Abstract


Wireless sensor networks (WSNs) are becoming an increasingly important and challenging research area. Advances in WSN technology enable a wide range of applications, including environmental monitoring and object tracking systems. WSNs consist of small, low-cost sensor nodes with limited transmission ranges, processing power, storage capacity, and energy resources. This study focuses on energy-constrained WSNs deployed over a specific region, where the primary task is to collect data from sensor nodes and transmit it to a base station for further processing. Each bit of data requires a fixed amount of energy to receive and an additional amount to transmit, which varies with the transmission range. If all nodes were to transmit directly to the base station, they would rapidly exhaust their energy reserves. Efficient routing in WSNs, given their constraints on power, energy, and storage, poses a significant challenge. In this work, we propose a Particle Swarm Optimization-based Routing protocol (PSOR) that prioritizes energy efficiency in routing and optimizes data forwarding paths to the base node. The PSOR algorithm generates optimized routing paths by using energy consumption as a fitness value to select the best path. Our novel strategy enhances route optimization by integrating the Breadth First Search algorithm with PSOR to achieve more energy-efficient and shorter paths. Effectiveness of the proposed method was evidenced by experimental results obtained through the NS2 (Network Simulator 2) tool.

  IJCRT's Publication Details

  Unique Identification Number - IJCRT2406560

  Paper ID - 264017

  Page Number(s) - f54-f64

  Pubished in - Volume 12 | Issue 6 | June 2024

  DOI (Digital Object Identifier) -   

  Publisher Name - IJCRT | www.ijcrt.org | ISSN : 2320-2882

  E-ISSN Number - 2320-2882

  Cite this article

  Dr R Satheeskumar,  Menaga Devi N,   "OPTIMIZED ROUTING IN WIRELESS SENSOR NETWORKS THROUGH PARTICLE SWARM OPTIMIZATION AND BREADTH FIRST SEARCH TECHNIQUES", International Journal of Creative Research Thoughts (IJCRT), ISSN:2320-2882, Volume.12, Issue 6, pp.f54-f64, June 2024, Available at :http://www.ijcrt.org/papers/IJCRT2406560.pdf

  Share this article

  Article Preview

  Indexing Partners

indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
Call For Paper March 2026
Indexing Partner
ISSN and 7.97 Impact Factor Details


ISSN
ISSN
ISSN: 2320-2882
Impact Factor: 7.97 and ISSN APPROVED
Journal Starting Year (ESTD) : 2013
ISSN
ISSN and 7.97 Impact Factor Details


ISSN
ISSN
ISSN: 2320-2882
Impact Factor: 7.97 and ISSN APPROVED
Journal Starting Year (ESTD) : 2013
ISSN
DOI Details

Providing A digital object identifier by DOI.org How to get DOI?
For Reviewer /Referral (RMS) Earn 500 per paper
Our Social Link
Open Access
This material is Open Knowledge
This material is Open Data
This material is Open Content
Indexing Partner

Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 7.97 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(DOI)

indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer