1502 search results - page 64 / 301 » Node weighted scheduling |
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
MASS
2010
13 years 7 months ago
2010
Wireless sensor networks typically conserve energy by following a periodic wakeup-sleep schedule: nodes minimize idle time and spend most of their time in a low power sleep state. ...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
VTC
2006
IEEE
14 years 4 months ago
2006
IEEE
—this paper presents an energy-saving Multi-Ring Cyclic Scheduling for Spatial-TDMA (MRSTDMA). We design a cyclic scheduling of STDMA to realize the energy-saving property of STD...