Sciweavers

1687 search results - page 288 / 338
» On the complexity of scheduling in wireless networks
Sort
View
IPSN
2009
Springer
16 years 28 days ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
VTC
2006
IEEE
117views Communications» more  VTC 2006»
16 years 5 days ago
Simulation of Throughput in UMTS Networks with Different Spreading Factors
— We design and implement a local session1 admission control (SAC) algorithm for third-generation wireless networks which allows for the simulation of network throughput for diff...
Robert Akl, Anurag Arepally
DCOSS
2008
Springer
15 years 8 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
TWC
2011
291views more  TWC 2011»
15 years 1 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...
TMC
2012
13 years 8 months ago
A Statistical Mechanics-Based Framework to Analyze Ad Hoc Networks with Random Access
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
Sunil Srinivasa, Martin Haenggi