Sciweavers

182 search results - page 16 / 37
» Approximation algorithms for time-constrained scheduling on ...
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Locating Sensors in Concave Areas
Abstract— In sensor network localization, multihop based approaches were proposed to approximate the shortest paths to Euclidean distances between pairwise sensors. A good approx...
Chen Wang, Li Xiao
INFOCOM
2008
IEEE
14 years 2 months ago
Embracing Interference in Ad Hoc Networks Using Joint Routing and Scheduling with Multiple Packet Reception
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...
Xin Wang, J. J. Garcia-Luna-Aceves
HPCC
2005
Springer
14 years 1 months ago
A Threshold-Based Matching Algorithm for Photonic Clos Network Switches
This study concerns a threshold-based matching algorithm for Clos (t-MAC) network switches. The studied Clos network uses a central photonic switch fabric for transporting high-spe...
Ding-Jyh Tsaur, Chi-Feng Tang, Chin-Chi Wu, Woei L...
IPPS
2006
IEEE
14 years 1 months ago
Battery-aware router scheduling in wireless mesh networks
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
Chi Ma, Zhenghao Zhang, Yuanyuan Yang
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri