A minimal weight and routing cost connected dominating set algorithm for wireles sensor networks

Abstract

The connected dominating sets are used as a backbone for unicast and multicast to decrease overall communication traffic and increase the lifetime of wireless sensor networks. When this communication backbone is formed, it is generally desired that the sensors having high energy levels are located on the backbone. However, in this case, the shortest path between two nodes in the bacbone can be much more costly than it is in the original graph. In this work, a new algorithm is proposed for constructing connected dominating sets according to the shortest paths costs and the weight of the nodes. © 2018 IEEE.