710 search results - page 33 / 142 » On Minimum Power Connectivity Problems |
195
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
130
Voted
GLOBECOM
2006
IEEE
16 years 15 days ago
2006
IEEE
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
185
click to vote
HASE
2008
IEEE
16 years 27 days ago
2008
IEEE
—In this paper, we investigate the transmission-power assignment problem for k-connected mobile ad hoc networks (MANETs), the problem of optimizing the lifetime of a MANET at a g...
175
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper addresses the problem of beamforming (BF) design for orthogonal frequency division multiplexing (OFDM) based relay networks over frequency-selective channels. Both freq...
163
click to vote
INFOCOM
2005
IEEE
16 years 1 days ago
2005
IEEE
— The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the tot...