A Binary Tree Structure for Mobile Ad Hoc Network
Alam, Mohammad Akter Ul
MetadataShow full item record
In a mobile ad hoc (multi-hop) wireless network, the logical structure of a Binary Tree is likely to become volatile or expensive to construct over time due to changeable network topology. Additional adverse effects take place when a process joins or leaves the computation in the presence of mobility. This paper presents a distributed algorithm that construct a Binary Tree among mobile nodes to the network dynamics to reflect overall communication efficiency. This is achieved by modifying the tree structure in a localized, mutual exclusive fashion, thereby allowing for concurrent segment-wise modifications to proceed. Remarkably our proposal operates without global knowledge of the logical structure and can be embodied as an underlying protocol stratum that supports transparent deployments of conventional algorithms in mobile environment.
- February 2009