Sciweavers

1687 search results - page 105 / 338
» On the complexity of scheduling in wireless networks
Sort
View
INFOCOM
2010
IEEE
15 years 3 months ago
Optimal Control of Wireless Networks with Finite Buffers
This paper considers network control for wireless networks with finite buffers. We investigate the performance of joint flow control, routing, and scheduling algorithms which achie...
Long Bao Le, Eytan Modiano, Ness B. Shroff
INFOCOM
2003
IEEE
15 years 11 months ago
Exploiting Multiuser Diversity for Medium Access Control in Wireless Networks
— Multiuser diversity refers to a type of diversity present across different users in a fading environment. This diversity can be exploited by scheduling transmissions so that us...
Xiangping Qin, Randall A. Berry
IPL
2008
145views more  IPL 2008»
15 years 6 months ago
Complexity analysis of a decentralised graph colouring algorithm
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
Ken R. Duffy, N. O'Connell, Artëm Sapozhnikov
ICASSP
2008
IEEE
16 years 23 days ago
Layered wireless video multicast using omni-directional relays
— Wireless video multicast enables delivery of popular events to many wireless users in a bandwidth efficient manner. However, providing good and stable video quality to a large...
Ozgu Alay, Thanasis Korakis, Yao Wang, Elza Erkip,...
AICT
2006
IEEE
142views Communications» more  AICT 2006»
16 years 11 days ago
An Inter-Piconet Scheduling Algorithm for Bluetooth Scatternets
Bluetooth is a wireless specification delivering short-range radio communication between electronic devices that are equipped with specialized Bluetooth chips. It lets nearly all ...
Suman Saha, Mitsuji Matsumoto