Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
—We present a distributed algorithm for allocating power among multiple interfering transmitters in a wireless network using Orthogonal Frequency Division Multiplexing (OFDM). Th...
— In this paper, we propose a distributed stochastic algorithm for power and rate allocation in ad hoc wireless sensor networks. The problem we deal with is formulated as a trans...
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...