Skip to Main Content
Mobile ad hoc (multi-hop) wireless network, unlike conventional infrastructured wireless counterparts, operates in the absence of fixed switching stations and thus all networking entities therein can be mobile. In mobile ad hoc network, logical binary tree structure is likely to become volatile or expensive to maintain over time due to changeable network topology. Additional adverse effects take place when a node joins or leaves the computation in the presence of mobility. This paper presents a distributed algorithm that maintains 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 layer that supports transparent deployments of conventional algorithms in mobile environment. Moreover, correctness proofs show that our proposal is promising.