scispace - formally typeset
M

Mano Yadav

Researcher at Bareilly College

Publications -  22
Citations -  215

Mano Yadav is an academic researcher from Bareilly College. The author has contributed to research in topics: Routing protocol & Wireless Routing Protocol. The author has an hindex of 6, co-authored 21 publications receiving 175 citations. Previous affiliations of Mano Yadav include Galgotias University & Sharda University.

Papers
More filters
Journal Article

Power Aware Routing in Ad Hoc Wireless Networks

TL;DR: An efficient algorithm is proposed, which maximizes the network lifetime by minimizing the power consumption during the source to destination route establishment and is observed that proposed algorithm s performance is better as compare to AODV and DSR in terms of various energy related parameters.
Journal ArticleDOI

Multi-Objective Optimization in WSN: Opportunities and Challenges

TL;DR: A brief analysis of the solutions addressing recent research problems in WSN comprising conflicting goals, i.e. multi-objective optimization (MOO) technique is delivered.
Proceedings ArticleDOI

Power Aware Routing to Support Real Time Traffic in Mobile Adhoc Networks

TL;DR: An efficient algorithm is proposed, which maximizes the network lifetime by minimizing the power consumption during the source to destination route establishment and by simulation it is observed that proposed algorithmpsilas performance is better as compare to AODV in terms of packet delivery ratio and network lifetime for different network scenarios.
Proceedings ArticleDOI

Energy trends of routing protocols for H-WSN

TL;DR: Three well accepted WSN routing protocols namely LEACH, FAIR and SEP have been benchmarked for their energy pattern in heterogeneous scenario and results shows that there is no clear winner for all situations.
Journal ArticleDOI

Finding Optimal Paths on Terrain Maps using Ant Colony Algorithm

TL;DR: The meta-heuristic method of ant colony optimization (ACO) to find optimal paths on terrain map images to solve the optimal path finding problem by optimizing multiple constraints is presented.