Semi-asynchronous and distributed weighted connected dominating set algorithms for wireless sensor networks

摘要: Energy-efficient backbone construction is one of the most important objective in a wireless sensor network (WSN) and to construct more robust backbone, weighted connected dominating sets can be used where energy nodes are directly related their weights. In this study, we propose algorithms for purpose classify our as set Steiner tree these together (WCDS). We provide fully distributed with semi-asynchronous versions. show design algorithms, analyze proof correctness, time, message space complexities simulation results ns2 environment. that approximation ratio 3ln(S) S total weight optimum solution. To best knowledge, first WCDS ratio. compare proposed work select lower cost less number nodes. networks.Proposed semi-asynchronous.Algorithms have (S solution).We theoretical analysis message, time complexities.Algorithms compared previous through extensive simulations.