Maximization of Per Node Throughputfor2HR Manets under Limited Buffer Constraint
B. BasaveswaraRao1, SK. MeeraSharief2, K. GangadharaRao3, K Chandan4
1B. Basaveswara Rao, Department of Computer Science and Engineering, Acharya Nagarjuna University, Guntur (Andhra Pradesh), India.
2SK. Meera Sharief, Department of Computer Science and Engineering, GIET College of Engineering, Rajahmundry, (Andhra Pradesh), India.
3K. Gangadhara Rao, Department of Computer Science and Engineering, Acharya Nagarjuna University, Guntur (Andhra Pradesh), India.
4K Chandan, Department of Statistics, Acharya Nagarjuna University, Guntur (Andhra Pradesh), India.
Manuscript received on 01 May 2019 | Revised Manuscript received on 15 May 2019 | Manuscript published on 30 May 2019 | PP: 2928-2939 | Volume-8 Issue-7, May 2019 | Retrieval Number: G6068058719/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This paper proposes an analytical framework on the lines of Jia Liu et al for maximization of per node throughput under limited buffer constraint of two hop relay (2HR) MANETs. To achieve maximization of per node throughput through partial derivative method with necessary and sufficient conditions (NSC) based search algorithm for finding the optimal values of network control parameter, buffer size at source node and buffer size at relay node. The per node throughput is evaluated through NSC search algorithm for different values of packet generating probability, area of the MANET and node density. The numerical results illustrate the effects of different network parameters on throughput performance.
Keyword: 2HR, Source Buffer, Relay Buffer, Node Density, Throughput.
Scope of the Article: Advanced Computer Networking