Sciweavers

658 search results - page 44 / 132
» Lower bounds for sorting networks
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 6 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
CCR
2006
92views more  CCR 2006»
13 years 7 months ago
A cooperative uplink power control scheme for elastic data services in wireless CDMA systems
We consider the uplink power control problem in a single cell CDMA wireless data system. Each user specifies upper and lower QoS bounds. We formulate the considered problem as a g...
George Alyfantis, Stathes Hadjiefthymiades, Lazaro...
TMC
2012
11 years 10 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...
CDC
2009
IEEE
13 years 11 months ago
On the queue-overflow probabilities of distributed scheduling algorithms
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...
Can Zhao, Xiaojun Lin
ICDCN
2010
Springer
13 years 11 months ago
On Communication Complexity of Secure Message Transmission in Directed Networks
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan