— In wireless sensor networks, minimizing power consumption and at the same time maintaining desired properties in the network topology is of prime importance. In this work, we present a distributed algorithm for assigning minimum possible power to all the nodes in the wireless sensor network, such that the network is K-connected. In this algorithm, a node collects the location and maximum power information from all the nodes in its vicinity, and then it adjusts the powers of the nodes in its vicinity in such a way that it can reach all the nodes in the vicinity through K optimal vertex-disjoint paths. We prove that, if each node maintains K optimal vertex-disjoint paths to all the nodes in its vicinity then the resulting topology is globally K-connected, provided the topology obtained when all nodes transmit with their maximum power Gmax is K-connected. This topology control algorithm has been extended to mobile scenario and the proof of connectivity in the mobile scenario has been ...