Sciweavers

1687 search results - page 302 / 338
» On the complexity of scheduling in wireless networks
Sort
View
JUCS
2007
93views more  JUCS 2007»
15 years 6 months ago
Quality of Service Routing in a MANET with OLSR
: Ad hoc wireless networks have enormous commercial and military potential because of their self-organizing capacity and mobility support. However, some specificities of these net...
Dang-Quan Nguyen, Pascale Minet
IPSN
2007
Springer
16 years 8 days ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
GIS
2007
ACM
16 years 7 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
HICSS
2003
IEEE
99views Biometrics» more  HICSS 2003»
15 years 11 months ago
Towards Feasible Topology Formation Algorithms for Bluetooth-based WPANs
In this paper, we tackle the problem of topology formation in Bluetooth Wireless Personal Area Networks (BTWPANs). We first overview and extend a previously proposed centralized ...
Carla-Fabiana Chiasserini, Marco Ajmone Marsan, El...
TIT
2010
105views Education» more  TIT 2010»
15 years 25 days ago
Multigroup ML decodable collocated and distributed space-time block codes
In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multigroup maximum-likelihood (ML) decoding are studied. First, the collocated case is conside...
G. Susinder Rajan, B. Sundar Rajan