Sciweavers

1783 search results - page 168 / 357
» Low-Complexity Distributed Scheduling Algorithms for Wireles...
Sort
View
ASPLOS
2006
ACM
15 years 9 months ago
A spatial path scheduling algorithm for EDGE architectures
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...
Katherine E. Coons, Xia Chen, Doug Burger, Kathryn...
EUROPAR
2006
Springer
15 years 6 months ago
Multicost Routing over an Infinite Time Horizon in Energy and Capacity Constrained Wireless Ad-Hoc Networks
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...
ICPADS
2007
IEEE
15 years 9 months ago
Access point selection algorithms for maximizing throughputs in wireless LAN environment
In wireless LAN technology, access point selection at each station is a critical problem in order to obtain satisfactory throughputs. The current protocol for access point selecti...
Akihiro Fujiwara, Yasuhiro Sagara, Masahiko Nakamu...
PDPTA
2007
15 years 4 months ago
Scheduling Divisible Workloads from Multiple Sources in Linear Daisy Chain Networks
— This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy (TPSS) to minimize the ov...
Xinxin Liu, Han Zhao, Xiaolin Li
TMC
2010
155views more  TMC 2010»
15 years 1 months ago
Maximizing the Lifetime of a Barrier of Wireless Sensors
—To make a network last beyond the lifetime of an individual sensor, redundant sensors must be deployed. What sleep-wakeup schedule can then be used for individual sensors so tha...
Santosh Kumar, Ten-Hwang Lai, Marc E. Posner, Pras...