Constructing Minimum Spanning Trees in MANETs by using Prim's Algorithm to Conserve Energy
Dasaka VSS Subrahmanyam
, Dr.T.Ch.Malleswara Rao
Minimum Spanning Tree, MANETs, Prim’s algorithm, energy consumption levels, routes, link failures, nodes
Abstract—Constructing routes with nodes of minimum energy is one of the fundamental functionalities of MANETs. Ensuring routes with no link failures has been a herculean task of MANETs. Utilizing the available battery levels in an effective way has been an in-built feature of MANETs. The route construction is based on the assumption that no link failure occurs. Because of the high dynamic nature of MANETs, it is very difficult to ensuring no route failures. With a view to minimize energy utilization in MANETs, a Minimum Spanning Tree construction by using Prim’s algorithm can be considered.
"Constructing Minimum Spanning Trees in MANETs by using Prim's Algorithm to Conserve Energy", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.4, Issue 3, page no.75 - 77, March-2019, Available :https://ijsdr.org/papers/IJSDR1902013.pdf
Volume 4
Issue 3,
March-2019
Pages : 75 - 77
Paper Reg. ID: IJSDR_190083
Published Paper Id: IJSDR1902013
Downloads: 000347229
Research Area: Engineering
Country: Hyderabad, Telangana, india
ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator
Publisher: IJSDR(IJ Publication) Janvi Wave