Sciweavers

165 search results - page 14 / 33
» Capacity of Asynchronous Random-Access Scheduling in Wireles...
Sort
View
GLOBECOM
2007
IEEE
14 years 2 months ago
Joint Computation and Communication Scheduling to Enable Rich Mobile Applications
Abstract—Increasing interest in sensor networking and ubiquitous computing has created a trend towards embedding more and more intelligence into our surroundings. This enables th...
Shoubhik Mukhopadhyay, Curt Schurgers, Sujit Dey
OPODIS
2008
13 years 9 months ago
CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks
Due to the heterogenous power-saving requirement in wireless sensor networks, we propose the Cyclic Quorum System Pair (CQS-Pair) which can guarantee that two asynchronous nodes ad...
Shouwen Lai, Bo Zhang, Binoy Ravindran, Hyeonjoong...
INFOCOM
2006
IEEE
14 years 1 months ago
The Complexity of Connectivity in Wireless Networks
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
Thomas Moscibroda, Roger Wattenhofer
WCNC
2008
IEEE
14 years 2 months ago
Proportional Fair Scheduling: Analytical Insight under Rayleigh Fading Environment
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
Erwu Liu, Kin K. Leung
ICCCN
2008
IEEE
14 years 2 months ago
Fair Randomized Antenna Allocation in Asynchronous MIMO Multi-Hop Networks
Abstract—Previous work has shown that CSMA-based protocols such as the IEEE 802.11 can yield flow starvation in multihop wireless networks. While prior protocol designs alleviat...
Ahmed Khattab, Ashutosh Sabharwal, Edward W. Knigh...