Sciweavers

876 search results - page 1 / 176
» Complexity in geometric SINR
Sort
View
MOBIHOC
2007
ACM
14 years 4 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
MOBIHOC
2008
ACM
14 years 4 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer
MOBIHOC
2006
ACM
14 years 4 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
ICASSP
2011
IEEE
12 years 8 months ago
Probabilistic SINR constrained robust transmit beamforming: A Bernstein-type inequality based conservative approach
Recently, robust transmit beamforming has drawn considerable attention because it can provide guaranteed receiver performance in the presence of channel state information (CSI) er...
Kun-Yu Wang, Tsung-Hui Chang, Wing-Kin Ma, Anthony...
GLOBECOM
2009
IEEE
13 years 8 months ago
Optimum Allocation of Energy and Spectrum in Power-Controlled Wireless Networks with QoS Constraints
An important performance measure in wireless networks is the manner in which the network can distributively manage its limited energy and spectrum resources, while assuring certain...
Stepán Kucera, Ludek Kucera, Bing Zhang