Paper Details

Virtual backbone is employed to facilitate routing in ad hoc networks, which lack the physical infrastructure.In these networks, node and link failure are a common phenomenon, which makes the virtual backbone vulnerable. Evenif any one of the backbone nodes fail, the virtual backbone is prone to break which ultimately breaks the network. Hence,the virtual backbone needs to have some sort of fault-tolerance capability which will help it to function even during nodeand link failures.k-Connected m-Dominating Set (kmCDS) has been used in the literature to construct fault-tolerantvirtual backbones. kmCDS based virtual backbone structures can withstand upto k – 1 path failures and m – 1 dominatorfailures, and thereby the fault-tolerance capability of the network is enhanced. This paper focuses on the various kmCDSconstruction algorithms that have been put forth in the literature. A comparison of the major works is provided,emphasizing the technique used, k-factor and m-factor combination, performance metric used, algorithms proposed andtheir outcome.

P. S. Vinayagam, “k-Connected m-Dominating Set Based Fault-Tolerant Virtual Backbone: A Survey”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 9, pp. 452-458, September 2017.