Abstract
For many wireless ad-hoc network (WANET) applications, including wireless sensor, robotic, and flying ad-hoc networks, area coverage is a major challenge. This challenge, which may include the number of required nodes, cumulative energy consumption, or total distance travelled, involves covering the largest possible area with the least cost. Whatever the scenario and cost functions, efficiently deploying the nodes throughout their entire missions is an important factor. For larger networks, this can best be performed using proper topology formations that are essentially designated geometric graph patterns. As a network topology formation and node deployment strategy, this study presents a unique tree-formed geometric graph pattern. With any given number of nodes, it guarantees the maximum possible combined area coverage. Considering its graph theory and Euclidean characteristics, the pattern is then described as both algebraic and algorithmic relations. The formation is remarkably scalable because it may include an unlimited number of nodes while ensuring connectivity in a tree topology. In addition to presenting a breakdown of multiple features and attributes, including symmetry and fractality, we will make a comparative analysis with six known regular lattices and a line formation. Our analyses then show that MAX-Tree covers up to twice as much area compared to all other regular lattices of the same node cardinalities while being more robust and reliable than a line formation. MAX-Tree can be extremely beneficial for drone networks, smart industry and agriculture applications, ocean-bed monitoring systems, and many other WANET scenarios.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.