Achieving Throughput by Minimum Path Cost in Multi-hop Wireless Networks
Author(s):
Betcy Mathew , Mar baselious Christian college of engineering peermade ; Leni Reji Abraham, Mar baselious Christian college of engineering peermade ; Sijimol A. S, Mar baselious Christian college of engineering peermade
Keywords:
Minimum Path Cost, Multi-Hop Remote Systems, Routing, SASR, throughput
Abstract:
In the issue of directing in multi-hop remote systems, to accomplish top of the line end-to-end throughput, it is essential to find the "best" way from the source hub to the goal hub. Despite the fact that a substantial number of protocols have been proposed to find the way with least aggregate transmission tally/time for conveying a solitary parcel, such transmission check/time limiting conventions can't be ensured to accomplish most extreme end-to-end throughput. To help our contention, we propose minimum path cost utilizing spatial reusability-aware single-path routing (SASR) and contrast them with existing single-path routing separately. Our assessment comes about demonstrate that our protocols significantly enhance the conclusion of end-to-end throughput contrasted and existing conventions.
Other Details:
Manuscript Id | : | IJSTEV4I9056
|
Published in | : | Volume : 4, Issue : 9
|
Publication Date | : | 01/04/2018
|
Page(s) | : | 188-190
|
Download Article