PROJECT TITLE :
On Practical Construction of Quality Fault-Tolerant Virtual Backbone in Homogeneous Wireless Networks - 2018
Over years, many efforts are made for the problem of constructing quality fault-tolerant virtual backbones in wireless network. In case that a wireless network consists of physically equivalent nodes, e.g., with the same communication vary, unit disk graph (UDG) is widely used to abstract the wireless network and the problem is formulated because the minimum k-connected m-dominating set drawback on the UDG. So so much, most results are targeted on coming up with a continuing issue approximation algorithm for this NP-hard problem below 2 positive integers k and m satisfying m = k = one and k = 3. This Project introduces an approximation algorithm for the matter with m = k = 1. This algorithm is easy to implement; it connects the elements by adding a bounded variety of methods, that first computes a one-connected m-dominating set D and repeats the following steps: (a) search the separators arbitrarily in (i - 1, m)-CDS with i = a pair of, three, ? , k, (b) add a bounded variety of paths connecting the components separated by separators in (i-one, m)-CDS to improve the connectivity of (i-1, m)-CDS, till it becomes k-connected, and (c) take away redundant ways if there exist at every iteration. We provide a rigorous theoretical analysis to prove that the proposed algorithm is correct and its approximation ratio is a constant, for any mounted k.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here