1783 search results - page 96 / 357 » Low-Complexity Distributed Scheduling Algorithms for Wireles... |
126
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
All-to-all broadcast scheduling problems are considered in WDM optical passive star networks where k wavelengths are available in the network. It is assumed that each node has exac...
119
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Optical Multistage Interconnection Networks (MINs) suffer from optical-loss during switching and crosstalk problem in the switches. The crosstalk problem is solved by routing mess...
140
click to vote
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
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...
128
click to vote
INFOCOM
2010
IEEE
15 years 12 days ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
92
Voted
SPDP
1991
IEEE
15 years 5 months ago
1991
IEEE
A dynamic taskschedulingalgorithm,that isstable,decentralized,and adaptivetonetwork topology,ispresented. Theproposedalgorithmisanextensionofnearestneighbor loadbalancingstrategyw...