An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Assimilation of smaller networks into larger networks and dissolution of bigger networks into multiple smaller networks in a selective fashion is an important problem in ad hoc networks.; This thesis work involves developing “DAlMeSiAN,” a scheme containing seamless and efficient distributed algorithms for merging and splitting ad hoc networks using a novel graph centric approach coupled with a message passing paradigm. A theoretical analysis of DAlMeSiAN 's time and message complexity has been done, the results of which establish the linear running time of the merging and splitting algorithms in DAlMeSiAN. Further, a simulation of DAlMeSiAN has been performed using the popular network simulator— ns2, and the results clearly substantiate the results of the theoretical analysis. |