Sciweavers

4345 search results - page 585 / 869
» Temporal Constraint Networks
Sort
View
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 8 months ago
The effect of fading, channel inversion, and threshold scheduling on ad hoc networks
—This paper addresses three issues in the field of ad hoc network capacity: the impact of i) channel fading, ii) channel inversion power control, and iii) threshold–based sche...
Steven Weber, Jeffrey G. Andrews, Nihar Jindal
SIAMJO
2000
74views more  SIAMJO 2000»
13 years 8 months ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro
JNW
2008
79views more  JNW 2008»
13 years 7 months ago
A Proportional Jitter Scheduling and Buffer Management Algorithm for Differentiated Services Networks
This paper proposes a method for scheduling and buffer management in differentiated services networks which is based on JoBS algorithm. JoBS differentiates traffic classes base on ...
Mohammad Hossien Yaghmaee, Ghazale Khojasteh Tousi
INFOCOM
2010
IEEE
13 years 6 months ago
First-Fit Scheduling for Beaconing in Multihop Wireless Networks
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
Peng-Jun Wan, Zhu Wang, Hongwei Du, Scott C.-H. Hu...
INFOCOM
2010
IEEE
13 years 6 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz