Sciweavers

914 search results - page 83 / 183
» Branch and Bound on the Network Model
Sort
View
TON
2010
127views more  TON 2010»
14 years 4 months ago
Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
Douglas M. Blough, Giovanni Resta, Paolo Santi
DMSN
2007
ACM
15 years 1 months ago
Declarative temporal data models for sensor-driven query processing
Many sensor network applications monitor continuous phenomena by sampling, and fit time-varying models that capture the phenomena's behaviors. We introduce Pulse, a framework...
Yanif Ahmad, Ugur Çetintemel
LCN
2006
IEEE
15 years 3 months ago
On Cache Prefetching Strategies For Integrated Infostation-Cellular Network
Infostations provide an inexpensive and high speed wireless disseminator that features discontinuous coverage by bounding many low cost, limited transmission range and high-bandwi...
Jerry Chun-Ping Wang, Hossam ElGindy, Justin Lipma...
INFOCOM
2011
IEEE
14 years 1 months ago
Transport throughput of secondary networks in spectrum sharing systems
—Spectrum sharing systems such as cognitive radio networks have drawn much attention recently due to their potential to resolve the conflict between increasing demand for spectr...
Chengzhi Li, Huaiyu Dai
INFOCOM
2010
IEEE
14 years 8 months ago
Throughput, Delay, and Mobility in Wireless Ad Hoc Networks
—Throughput capacity in wireless ad hoc networks has been studied extensively under many different mobility models such as i.i.d. mobility model, Brownian mobility model, random ...
Pan Li, Yuguang Fang, Jie Li