Distributed Merging Algorithm for Hypercube based Multi-Hop Mobile Ad-Hoc Networks
Until now the problem of merging large scale wireless networks is not considered indetail. In this work a low cost, selective algorithm for merging Hypercube and derivative architectures based mobile Ad-Hoc networks with preserving active links is developed. It has been shown that in both kind of scenarios proposed selective algorithm performs much better than randomly merging networks. In section II, hypercube network architecture is given and selective merge algorithm explained in detail. Section III gives features of Cube Connected Networks architecture, and explains how selective merge algorithm performs with simulation results. The selective solution proposed is distributed and scalable, it brings only a constant computational cost. In conclusion, the advantages of our novel algorithm summarized, and potential usage scenarios are given.
Keywords - Ad-Hoc Networks, Network Maintenance, Network Merge.