Abstract
This thesis focuses on the problem of maintaining graphics. connectivity in a mobile ad hoc network. Mobile ad hoc networks are without a fixed topology and are dynamically changing. This makes the problem of maintaining connectivity among all nodes a difficult one. Issues such as whether or not a node should be denied a particular move or forced to move against its will present us with different environments to work in. In this thesis we look at an optimal technique to maintain connectivity, which does not move nodes against their will, but forces them to maintain their current position should this result in maximum connectivity. A cluster based scheme which is practically implementable, unlike the exponential optimal scheme, is also proposed. This scheme, however, is allowed to move nodes against their will. The scheme reserves few nodes as buffers, which are then moved around to maintain connectivity. A comparison of the cluster based scheme to the optimal scheme gives us a good indication of the achievable performance. Several optimizations are presented which improve on the base performance achieved. Finally, extensions and other ideas which may be applied to the problem are highlighted.
Reuben, Ron S. (1998). Maintaining connectivity in a mobile ad hoc network. Master's thesis, Texas A&M University. Available electronically from
https : / /hdl .handle .net /1969 .1 /ETD -TAMU -1998 -THESIS -R473.