Sciweavers

817 search results - page 72 / 164
» Mobility-Driven Scheduling in Wireless Networks
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
ICDCS
2007
IEEE
14 years 25 days ago
uSense: A Unified Asymmetric Sensing Coverage Architecture for Wireless Sensor Networks
As a key approach to achieve energy efficiency in sensor networks, sensing coverage has been studied extensively. Researchers have designed many coverage protocols to provide vario...
Yu Gu, Joengmin Hwang, Tian He, David Hung-Chang D...
ICC
2008
IEEE
109views Communications» more  ICC 2008»
14 years 3 months ago
Wireless Scheduling Algorithms with O(1) Overhead for M-Hop Interference Model
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
Yung Yi, Mung Chiang
INFOCOM
2003
IEEE
14 years 2 months ago
Opportunistic Fair Scheduling over Multiple Wireless Channels
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Yonghe Liu, Edward W. Knightly
INFOCOM
2009
IEEE
14 years 3 months ago
On the Exploitation of CDF Based Wireless Scheduling
—Channel-aware scheduling strategies - such as the CDF Scheduler (CS) algorithm for the CDMA/HDR systems provide an effective mechanism for utilizing the channel data rate for im...
Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy