Sciweavers

316 search results - page 14 / 64
» Oblivious interference scheduling
Sort
View
INFOCOM
2006
IEEE
15 years 3 months ago
Effective Packet Scheduling with Fairness Adaptation in Ultra Wideband Wireless Networks
Abstract— The inherent spread spectrum nature in ultrawideband (UWB) communications can support simultaneous transmissions. Two nearby transmissions do not collide, but rather ge...
Hai Jiang, Weihua Zhuang
WDAG
2010
Springer
191views Algorithms» more  WDAG 2010»
14 years 7 months ago
Exclusive Perpetual Ring Exploration without Chirality
In this paper, we study the exclusive perpetual exploration problem with mobile anonymous and oblivious robots in a discrete space. Our results hold for the most generic settings:...
Lélia Blin, Alessia Milani, Maria Potop-But...
JSSPP
1997
Springer
15 years 1 months ago
Implications of I/O for Gang Scheduled Workloads
This paper examinestheimplicationsofgang schedulingfor generalpurpose multiprocessors. The workloads in these environments include both compute-bound parallel jobs, which often re...
Walter Lee, Matthew Frank, Victor Lee, Kenneth Mac...
INFOCOM
2009
IEEE
15 years 4 months ago
Delay Analysis for Multi-Hop Wireless Networks
Abstract—We analyze the delay performance of a multihop wireless network with a fixed route between each sourcedestination pair. There are arbitrary interference constraints on ...
Gagan Rajesh Gupta, Ness B. Shroff
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
14 years 11 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...