A Survey on Binary Tree-Based Approaches for Data Transmission in Mobile Ad Hoc Networks

Abstract

A thorough analysis of the current binary tree-based data distribution techniques in MANETs is the goal of this paper. MANET communication is highly dynamic, necessitating effective data transmission methods to improve network stability while also saving energy. Binary tree topologies work in tandem with routing and data aggregation to improve scalability, reduce latency, and increase energy economy. The paper investigates several binary tree algorithms that are appropriate for data and security structures, as well as routing techniques. Similar to previous MANETs, the network has three main issues: security threats, energy constraints, and mobility issues. Key features of modern algorithms are briefly discussed in the study, along with the benefits and drawbacks of tree-based systems. The study itself outlines the goals and directions for further investigation just to find the best network throughputs while staying within the constraints of dynamism's limited computing and energy resources.