This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Minimizing the excess computations in Mobile ad-hoc networks using Neighbor Coverage
Authors
  Iram Makhdoomi,  Heena Gupta,  Kantesh Kumar Gaurav
Abstract
Neighbor Coverage based data routing is a widely researched problem in recent years. Many researchers have
proposed techniques for data routing and compared their results with the existing techniques on the basis of various performance parameters. The important parameters for the comparison are considered as packet delivery delay, packet delivery ratio, residual energy, throughput etc. In the proposed approach a novel trust
based social impact theory optimization technique is implemented for data routing. In future other bio inspired and nature inspired algorithm must be implemented and used for the same problem description and their results
are compared with the existing techniques.
Keywords- MANET, NCPR
Publication Details
Unique Identification Number - IJEDR1703017Page Number(s) - 119-122Pubished in - Volume 5 | Issue 3 | July 2017DOI (Digital Object Identifier) -    Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
  Iram Makhdoomi,  Heena Gupta,  Kantesh Kumar Gaurav,   "Minimizing the excess computations in Mobile ad-hoc networks using Neighbor Coverage", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.5, Issue 3, pp.119-122, July 2017, Available at :http://www.ijedr.org/papers/IJEDR1703017.pdf
Article Preview
|
|
||||||
|