Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(6)
Empirical Study
High Efficiency
Optimal Scheduling
Performance Characterization
Wireless Network
Longest Queue First
Related Publications
(1)
Performance limits of greedy maximal matching in multihop wireless networks
Subscribe
Academic
Publications
A refined performance characterization of longestqueuefirst policy in wireless networks
A refined performance characterization of longestqueuefirst policy in wireless networks,10.1145/1530748.1530758,Bo Li,Cem Boyaci,Ye Xia
Edit
A refined performance characterization of longestqueuefirst policy in wireless networks
(
Citations: 10
)
BibTex

RIS

RefWorks
Download
Bo Li
,
Cem Boyaci
,
Ye Xia
One of the major challenges in wireless networking is how to optimize the link scheduling decisions under interference constraints. Recently, a few algorithms have been introduced to address the problem. However, solving the problem to optimality for general wireless interference models is known to be NPhard. The research community is currently focusing on finding simpler, suboptimal scheduling algorithms and on characterizing the algorithm performance. In this paper, we address the performance of a specific scheduling policy called
Longest Queue First
(LQF), which has gained significant recognition lately due to its simplicity and
high efficiency
in empirical studies. There has been a sequence of studies characterizing the guaranteed performance of the LQF schedule, culminating at the construction of the σlocal pooling concept by Joo et al. [10]. In this paper, we refine the notion of σlocal pooling and use the refinement to capture a larger region of guaranteed performance.
Conference:
Mobile Ad Hoc Networking and Computing  MobiHoc
, pp. 6574, 2009
DOI:
10.1145/1530748.1530758
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
portal.acm.org
)
(
portal.acm.org
)
(
doi.acm.org
)
(
www.informatik.unitrier.de
)
More »
Citation Context
(8)
...In [
17
], the authors extended local pooling to link local pooling, which provides a refined throughput characterization of GMS...
Mathieu Leconte
,
et al.
Improved Bounds on the Throughput Efficiency of Greedy Maximal Schedul...
...Sparked by the works in [5], Leconte el al. [6] and Li el al. [
7
] presented some properties of LPF...
...Li el al. [
7
] gave an alternative definition of LPF and also introduced a refined notion of LPF...
...As the result, the bounding techniques developed in the early works [5] [6] [
7
] can hardly be employed to derive any tight lower bounds on LPFs under these general interference models...
...This second lower bound has a very short purely graphtheoretic proof, and yet it can imply the lower bound on LPF provided in [5] which has a queuingtheoretic proof in [5] or an alternate proof based on the duality theory of linear programming in [
7
]...
PengJun Wan
,
et al.
Local pooling factor of multihop wireless networks
...The LoP conditions were recently generalized to provide the σLocal Pooling (σLoP) conditions under which GMS achieves σ% throughput [16], [17] (the conditions were reformulated in [
20
])...
...Definition 2.4 (σSLoP  Xi et. al. [
20
]): A network graph G satisfies σSLoP, if and only if there exists a vector α ∈ [0, 1]E such that...
...This definition can also be expressed as a Linear Program [
20
]...
Berk Birand
,
et al.
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooli...
...There are several recent works that investigate the performance of LQF scheduling under different binary interference models [5,7,
12
]...
...� We use the �local pooling notion developed in [7,
12
] to show that LQF scheduling achieves zero throughput in the worst case...
...We investigate the performance of LQF scheduling under the SINR interference model using the �local pooling technique [7,
12
]...
...A set local pooling factor can be calculated by a primal or dual formulation of a special optimization problem [
12
]...
...It can be observed that the set local pooling factor represents the scaling factor between the most compact timesharing and the least compact timesharing of maximal schedules [
12
]...
...Then, we have the following lower bound for a local pooling factor of set L [
12
]...
Long Bao Le
,
et al.
Longestqueuefirst scheduling under SINR interference model
...Using Lemma 5 and Lemma 11 in [
3
], one can rewrite it as a solution to the following dual problem...
...Lemma 14 in [
3
] applied to the linear program in (9) gives the following relation for σLMW :...
Arun Sridharan
,
et al.
A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple A...
References
(18)
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
(
Citations: 81
)
Andrew Brzezinski
,
Gil Zussman
,
Eytan Modiano
Conference:
Mobile Computing and Networking  MOBICOM
, pp. 2637, 2006
Local pooling conditions for joint routing and scheduling
(
Citations: 5
)
Andrew Brzezinski
,
Gil Zussman
,
Eytan Modiano
Conference:
Information Theory and Applications
, 2008
Throughput Guarantees Through Maximal Scheduling in Wireless Networks
(
Citations: 111
)
Prasanna Chaporkar
,
Koushik Kar
,
Saswati Sarkar
Published in 2005.
On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models
(
Citations: 384
)
J. G. Dai
Journal:
Annals of Applied Probability  ANN APPL PROBAB
, vol. 5, no. 1995, pp. 4977, 1995
Sufficient conditions for stability of longestqueuefirst scheduling: secondorder properties using fluid limits
(
Citations: 72
)
Antonis Dimakis
,
Jean Walrand
Journal:
Advances in Applied Probability  ADVAN APPL PROBAB
, vol. 38, no. 2006, pp. 505521, 2006
Sort by:
Citations
(10)
Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks
Mathieu Leconte
,
Jian Ni
,
R. Srikant
Journal:
IEEE/ACM Transactions on Networking  TON
, vol. 19, no. 3, pp. 709720, 2011
Local pooling factor of multihop wireless networks
PengJun Wan
,
Minming Li
,
Lixin Wang
,
Zhu Wang
,
Ophir Frieder
Conference:
IEEE INFOCOM  INFOCOM
, pp. 511515, 2011
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
(
Citations: 7
)
Berk Birand
,
Maria Chudnovsky
,
Bernard Ries
,
Paul D. Seymour
,
Gil Zussman
,
Yori Zwols
Conference:
IEEE INFOCOM  INFOCOM
, pp. 22132221, 2010
Longestqueuefirst scheduling under SINR interference model
(
Citations: 3
)
Long Bao Le
,
Eytan Modiano
,
Changhee Joo
,
Ness B. Shroff
Published in 2010.
Backpressurebased PacketbyPacket Adaptive Routing in Communication Networks
(
Citations: 2
)
Eleftheria Athanasopoulou
,
Loc Bui
,
Tianxiong Ji
,
R. Srikant
,
Alexander Stoylar
Journal:
Computing Research Repository  CORR
, vol. abs/1005.4, 2010