Modified Aggregation Tree based Algorithm for Load Balancing in MANET
M. Hemalatha1, S. Mohanapriya2

1M. Hemalatha, Assistant Professor, Department of Computer Application, Hindusthan College of Arts & Science, Coimbatore (Tamil Nadu), India.
2Dr. S. Mohanapriya, Head, Department of Computer Science, K.S.R College of Arts & Science for Women, Tiruchengode (Tamil Nadu), India.
Manuscript received on 11 October 2019 | Revised Manuscript received on 20 October 2019 | Manuscript Published on 02 November 2019 | PP: 406-411 | Volume-8 Issue-2S11 September 2019 | Retrieval Number: B10620982S1119/2019©BEIESP | DOI: 10.35940/ijrte.B1062.0982S1119
Open Access | Editorial and Publishing 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 (

Abstract: Proposed a Load Balancing in Data Aggregation Tree (DAT), to diminish the transmission cost by diminishing the bounce remove a bundle will travel and by combining information into reasonable transitional hubs. For sending information from a hub at level l, DAT calculation wisely chooses a hub at level l-1 by utilizing the aggregation proportion related with each sensor hub. We have led broad reproductions for breaking down the exhibition of DAT and contrast the outcome and existing Tree-Adapting calculation. Our tests demonstrate that DAT shows better execution when contrasted with Tree-Adapting calculation in diminishing the absolute vitality cost because of bundle transmissions.
Keywords: Load Balancing, Aggregation, MANET, Traffic, Overload.
Scope of the Article: Algorithm Engineering