Performance, Computing, and Communications Conference, 2002. 21st IEEE International (2006)
Phoenix, AZ, USA
Apr. 10, 2006 to Apr. 12, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/.2006.1629409
J.A. Bolla , University of Texas at Dallas
D.T. Huynh , University of Texas at Dallas
In wireless ad hoc networks, a clustering structure can be a backbone for efficient communications. Simplicity in communications can be achieved when the clusters can more simply communicate with each other. One way to achieve this is to require that the clusterheads be connected. We would also like to be able to adapt quickly to small changes in the network. In graph-theoretic terminology, a minimum set of such clusterheads is a minimum connected d-hop dominating set. In this paper, we show that the problem of adapting minimum connected d-hop dominating sets to local topology changes in wireless ad hoc networks is NP-complete. We then propose a heuristic to adapt a given minimal connected d-hop dominating set to a topology change in the networks. A distributed implementation of the heuristic is also presented.
NP-complete problem, adapting minimum connected d-hop dominating sets, topology changes, wireless ad hoc network, clustering structure, clusterheads, graph-theoretic terminology, topology
J. Bolla and D. Huynh, "Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks," Performance, Computing, and Communications Conference, 2002. 21st IEEE International(PCC), Phoenix, AZ, USA, 2006, pp. 31.