An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks

摘要: In wireless sensor networks (WSNs), virtual backbone has been proposed as the routing infra-structure and connected dominating set widely adopted backbone. However, since sensors in WSNs are prone to failures, recent studies suggest that it is also important maintain a certain degree of redundancy To construct robust backbone, so called k-connected m-dominating proposed. this research, we propose an integer programming formulation optimal algorithm for minimum problem. best our knowledge, first problem, extensive computational results show capable finding solution within reasonable amount time.