By Topic

Maintaining a Binary Tree Structure For Mobile Ad Hoc Computing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. M. Masum ; Daffodil International University, Bangladesh ; A. A. Ali

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.

Published in:

11th IEEE Symposium on Computers and Communications (ISCC'06)

Date of Conference:

26-29 June 2006