Sciweavers

1687 search results - page 211 / 338
» On the complexity of scheduling in wireless networks
Sort
View
CN
1999
107views more  CN 1999»
15 years 6 months ago
Programmable mobile networks
We present the design, implementation and evaluation of an open programmable mobile network based on distributed object technology called mobiware that dynamically exploits the in...
Andrew T. Campbell, Michael E. Kounavis, Raymond R...
PERCOM
2008
ACM
16 years 25 days ago
TIGRA: Timely Sensor Data Collection Using Distributed Graph Coloring
In this paper we present a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the probl...
Lilia Paradis, Qi Han
ICN
2005
Springer
15 years 12 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
ICC
2009
IEEE
135views Communications» more  ICC 2009»
15 years 4 months ago
Load Aware Broadcast in Mobile Ad Hoc Networks
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
Md. Tanvir Al Amin, Sukarna Barua, Sudip Vhaduri, ...
ICASSP
2009
IEEE
15 years 4 months ago
Distributed sampling and reconstruction of non-bandlimited fields in sensor networks based on shift-invariant spaces
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
Gunter Reise, Gerald Matz