Topology Discovering Algorithm for Mobile Wireless Networks

In mobile computing systems, the network configuration changes due to node mobility. In this paper we propose a topology discovering algorithm (TDA) for mobile ad-hoc networks, that constructs a tree rooted in a given node and is leveled by the transmission range. Our goal is the design of a topology in which the routing of a message requires as less as possible number of hops and the route computing is based only on local informations. The number of hops traveled by a message is at most h, where h is the height of the resultant tree and h = max(D, log5n), where n is the number of nodes in the network and under the assumption that each node can maintain at most 5 children. D is the maximum distance between two nodes in the network (Diameter)