Sciweavers

1687 search results - page 111 / 338
» On the complexity of scheduling in wireless networks
Sort
View
MOBICOM
2009
ACM
16 years 25 days ago
Capacity of large-scale CSMA wireless networks
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...
Chi-Kin Chau, Minghua Chen, Soung Chang Liew
IJHPCA
2006
75views more  IJHPCA 2006»
15 years 6 months ago
Scheduling Multiple Divisible Loads
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...
Maciej Drozdowski, Marcin Lawenda, Fréd&eac...
HUMAN
2003
Springer
15 years 11 months ago
TCP Performance Improvement with ACK Pacing in Wireless Data Networks
Abstract. Wireless data services are fundamental in ubiquitous networks. In wireless data networks, the TCP congestion mechanism can mistake a wireless channel error or blackout fo...
Seongho Cho, Heekyoung Woo
SIGMOD
2007
ACM
150views Database» more  SIGMOD 2007»
16 years 6 months ago
System design issues in sensor databases
In-network sensor query processing systems (ISQPs), or sensor databases, have been developed to acquire, process and aggregate data from wireless sensor networks (WSNs). Because W...
Qiong Luo, Hejun Wu
WICON
2008
15 years 7 months ago
Efficient XML usage within wireless sensor networks
Integrating wireless sensor networks in heterogeneous networks is a complex task. A reason is the absence of a standardized data exchange format that is supported in all participa...
Nils Hoeller, Christoph Reinke, Jana Neumann, Sven...