Sciweavers

1502 search results - page 105 / 301
» Node weighted scheduling
Sort
View
TIT
2011
109views more  TIT 2011»
15 years 1 months ago
On Achieving Local View Capacity Via Maximal Independent Graph Scheduling
—“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, ...
Vaneet Aggarwal, Amir Salman Avestimehr, Ashutosh ...
ICDCSW
2009
IEEE
16 years 25 days ago
Joint Sleep Scheduling and Mode Assignment in Wireless Cyber-Physical Systems
Designing cyber-physical systems with high efficiency, adaptability, autonomy, reliability and usability is a challenging task. In this paper, we focus on minimizing networkwide ...
Chun Jason Xue, Guoliang Xing, Zhaohui Yuan, Zili ...
INFOCOM
2007
IEEE
16 years 14 days ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
FAST
2007
15 years 7 months ago
Proportional-Share Scheduling for Distributed Storage Systems
Fully distributed storage systems have gained popularity in the past few years because of their ability to use cheap commodity hardware and their high scalability. While there are...
Yin Wang, Arif Merchant
INFOCOM
2010
IEEE
15 years 4 months ago
First-Fit Scheduling for Beaconing in Multihop Wireless Networks
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
Peng-Jun Wan, Zhu Wang, Hongwei Du, Scott C.-H. Hu...