Sciweavers

1502 search results - page 43 / 301
» Node weighted scheduling
Sort
View
JHSN
2002
68views more  JHSN 2002»
13 years 9 months ago
A theory of multi-channel schedulers for quality of service
A computer network consists of a set of computing nodes interconnected via communication channels. It is commonly assumed that, for each pair of network nodes u and v, there is at...
Jorge Arturo Cobb, Miaohua Lin
HPCC
2005
Springer
14 years 3 months ago
An Energy-Efficient Uni-scheduling Based on S-MAC in Wireless Sensor Network
S-MAC is a MAC (Medium Access Control) protocol as specialized for the wireless sensor network in order to sacrifice transmission delay and extend the working life of the whole sen...
Tae-Seok Lee, Yuan Yang, Ki-Jeong Shin, Myong-Soon...
HICSS
2002
IEEE
212views Biometrics» more  HICSS 2002»
14 years 2 months ago
Connectivity-Based k-Hop Clustering in Wireless Networks
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
Geng Chen, Fabian Garcia Nocetti, Julio Solano-Gon...
VTC
2008
IEEE
160views Communications» more  VTC 2008»
14 years 4 months ago
Reducing Feedback Requirements of the Multiple Weight Opportunistic Beamforming Scheme via Selective Multiuser Diversity
—Opportunistic beamforming (OB) relies on the transmission of Channel State Information (CSI) in the form of instantaneous Signal to Noise Ratio (SNR) from Mobile Stations (MSs) ...
Marios Nicolaou, Angela Doufexi, Simon Armour
SODA
2012
ACM
173views Algorithms» more  SODA 2012»
12 years 10 days ago
Resource augmentation for weighted flow-time explained by dual fitting
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
S. Anand 0002, Naveen Garg, Amit Kumar