Sciweavers

720 search results - page 26 / 144
» Broadcast scheduling: algorithms and complexity
Sort
View
ICTAI
2003
IEEE
15 years 3 months ago
Task Allocation via Multi-Agent Coalition Formation: Taxonomy, Algorithms and Complexity
Coalition formation has become a key topic in multiagent research. In this paper, we propose a preliminary classification for the coalition formation problem based on three drivin...
Hoong Chuin Lau, Lei Zhang
CORR
2006
Springer
112views Education» more  CORR 2006»
14 years 10 months ago
Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items
Broadcasting is known to be an efficient means of disseminating data in wireless communication environments (such as Satellite, mobile phone networks,...). It has been recently ob...
Julien Robert, Nicolas Schabanel
TWC
2008
133views more  TWC 2008»
14 years 10 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...
93
Voted
INFOCOM
2007
IEEE
15 years 4 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
Chuanxiong Guo
67
Voted
INFOCOM
2007
IEEE
15 years 4 months 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...