info@ijrretas.com
E-ISSN: 2455-4723 | Impact Factor: 7.95
+91 77710 84928 Support
IJRRETAS logo
  • About
    • About The Journal
    • Aim & Scope
    • Privacy Statement
    • Journal Policies
    • Disclaimer
    • Abstracting and Indexing
    • FAQ
  • Current
  • Archive
  • For Author
    • Submit Paper Online
    • Track Paper Status
    • Pay Publication Fee
    • Verify Certificate
    • Article Processing Charges
    • Submission Guidelines
    • Manuscript Types
    • Download Template (Word)
    • Download Copyright Form (Word)
  • Editorial Board
    • Editorial Board
    • Editors Responsibilities
    • Join as Editor / Reviewer
  • More
    • Contact
    • Pay Publication Fee Online
    • Bank / UPI Payment Details
    • Blogs
  • Submit Paper

Recent Papers

Dedicated to advancing knowledge through rigorous research and scholarly publication

  1. Home
  2. Recent Papers

An Enhanced Forecast Weighted Clustering Algorithm for Reducing Overheads in Mobile Ad-hoc Networks

Authors: Akanksha Soni, Nisha Bhati

Published in: IJRRETAS, Volume 4, Issue 4, pp. 1-10 (01 Apr 2018)

Impact Factor: 3.8 (2018)

License: CC BY 4.0 CC BY 4.0 (Open Access)

Certificate: View Certificate

Abstract

In this paper, we propose an enhanced forecast weighted clustering algorithm (EFWCA) which can reduce the computational overhead by electing the right candidate for the cluster head. This novel approach can handle enormous traffic and makes the network more stable. Wireless mobile adhoc networks (MANET) are prone to having routing issues due to their variable nature and resource constraints. Routing is an essential approach in adhoc networks for data transmission because every node serves as a router in the absence of a central router. Several routing schemes have been advised in order to discover route, many of which use the flooding method. The flooding method offers to discover routes through flooding of routing packets in the network. In this method routing packets are traversing throughout the network infinitely and unnecessarily consume resources such as battery power and bandwidth and cause throughput degradation. To solve the noted problem, clustering and efficient flooding methods are some of the alternatives. To form clusters and elect a cluster-head for a homogenous network, several techniques have been suggested by the researchers. Here, the suggested algorithm is simulated in network simulation and its performance is evaluated in the context of various parameters.

Keywords
  • Mobile Ad-hoc Network (MANET)
  • Clustering
  • EFWCA
  • Routing
References
  1. P. Mohapatra, S. V. Krishnamurthy, “Ad hoc Network and Protocols”, 2005, springer Science.
  2. Abdelhak Bentaleb, Abdelhak Boubetra, Saad Harous,“ Survey of Clustering in MANET,2013,Scires.
  3. Sheetal Mehta, Priyanka Sharma, Ketan, “A survey on various cluster head election algorithms for MANET, 2011, IEEE.
  4. Ratish Agarwal, Dr. Mahesh Motwani, “Survey of Clustering algorithms for MANET”, 2007, ISSN.
  5. M. Alinci, E. Spaho, A. Lala and V. Kolici, “Clustering Alogorithms in MANET” ,2015,IEEE.
  6. Abdul Rahman, Sufian and Amer Kai, “Flexible Weighted Clustering Algorithm Based on Battery Power for MANET, 2008 IEEE.
  7. R. Pandi Selvam and V.Palanisamy , “Stable and Flexible Weight based Clustering “ 2011 Department of Computer Science and Engineering Alagappa University Karaikudi, Tamil Nadu, India.
  8. Piyalikar, Pritam Kar, and Mrinal Kanti Deb Barma,” Forecast Weighted Clustering in MANET”, Twelfth International Multi-Conference on Information Processing-2016 (IMCIP-2016), 2016
  9. V. V. Neethu? and Awadhesh Kumar Singh , Mobility Aware Loose Clustering for Mobile Ad hoc Network “Eleventh International Multi-Conference on Information Processing-2015 (IMCIP-2015).
How to Cite
APA: Soni, A., & Bhati, N. (2018). An Enhanced Forecast Weighted Clustering Algorithm for Reducing Overheads in Mobile Ad-hoc Networks. International Journal for Rapid Research in Engineering Technology & Applied Science, 4(4), 1–10. https://ijrretas.com/research-paper/an-enhanced-forecast-weighted-clustering-algorithm-for-reducing-overheads-in-mobile-adhoc-networks-
More from this Issue
  • EECBRP: Energy Efficient Cluster Based Routing Protocol for Effective Data Transmission in Mobile Ad hoc NetworksSarika Sirothiya, Rahul Sharma
  • An Imporve Color Image Stgnography Using ECC AlgorithmRekha yadav, Sumit Nigam
  • A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the CloudAyushi Dashore, Mohit Jain
  • Study on Consumer Satisfaction Level towards Branded and Unbranded Items in Indore CityDr.Lalit Kumar Dubey
More by these Authors
  • Artificial Neural Network Based Brain MRI Using DCT2018 • Vol. 4, Issue 8
  • Performance Analysis of Mobile Wireless Sensor Network Using Modified LEACH2018 • Vol. 4, Issue 8
  • Network Intrusion Detection Using Multiclass SVM2018 • Vol. 4, Issue 6
  • Mobile Wireless Sensor Network Using Different Techniques2018 • Vol. 4, Issue 3

Download Paper

Paper Id: IJRRETAS107

Publish Date: 2018-04-01

ISSN: 2455-4723

Publisher Name: ijrretas

About IJRRETAS

ijrretas is a leading open-access, peer-reviewed journal dedicated to advancing research in applied sciences and engineering. We provide a global platform for researchers to disseminate innovative findings and technological breakthroughs.

ISSN
2455-4723
Established
2015

Quick Links

Home Submit Paper Track Paper Status Author Guidelines Editorial Board Past Issues Topics
Fees Structure Scope & Topics Terms & Conditions Privacy Policy Refund and Cancellation Policy

Contact Us

Tilak Nagar, Indore, Madhya Pradesh, India

info@ijrretas.com

+91 77710 84928

www.ijrretas.com

Indexed In
Google Scholar Crossref ResearchGate CiteFactor
© 2026 ijrretas. All Rights Reserved.
Privacy Policy Terms of Service