KM-based efficient algorithms for optimal packet scheduling problem in celluar/infostation integrated networks

KM-based efficient algorithms for optimal packet scheduling problem in celluar/infostation... Request models in previous works on the Packet Scheduling (PS) problem in cellular/infostation integrated networks usually have some restrictions which make them less practical in some situations. In this paper, we investigate the packet scheduling problem with our new request model, which is general enough to include previous request models as special cases. We first propose a Greedy algorithm for the PS problem and analyze its approximation ratio. We then transform our PS problem to the mini-slot mini-request version PS problem (MSMR-PS problem) by using the concept of mini-slot and mini-request. Next, by embedding problem information into bipartite graphs, we investigate the relationships between the MSMR-PS problem and the corresponding maximum matching (MM) problem on these graphs. Based on these relations, we propose efficient algorithms to obtain quasi-optimal solutions to the original PS problem by using the Kuhn–Munkres (KM) algorithm to solve the MM problems on the bipartite graphs. These algorithms include two offline algorithms (named as KMUpper and KMLower) and one online algorithm named KMOnline. KMUpper and KMLower return upper and lower bounds for optimal profit of the PS problem, respectively. Simulation results show that our algorithms are more preferable than the other existing algorithms like FIFO, exponential capacity algorithm. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Ad Hoc Networks Elsevier

KM-based efficient algorithms for optimal packet scheduling problem in celluar/infostation integrated networks

Loading next page...
 
/lp/elsevier/km-based-efficient-algorithms-for-optimal-packet-scheduling-problem-in-bPJwHj0Yta
Publisher
Elsevier
Copyright
Copyright © 2018 Elsevier B.V.
ISSN
1570-8705
D.O.I.
10.1016/j.adhoc.2018.05.001
Publisher site
See Article on Publisher Site

Abstract

Request models in previous works on the Packet Scheduling (PS) problem in cellular/infostation integrated networks usually have some restrictions which make them less practical in some situations. In this paper, we investigate the packet scheduling problem with our new request model, which is general enough to include previous request models as special cases. We first propose a Greedy algorithm for the PS problem and analyze its approximation ratio. We then transform our PS problem to the mini-slot mini-request version PS problem (MSMR-PS problem) by using the concept of mini-slot and mini-request. Next, by embedding problem information into bipartite graphs, we investigate the relationships between the MSMR-PS problem and the corresponding maximum matching (MM) problem on these graphs. Based on these relations, we propose efficient algorithms to obtain quasi-optimal solutions to the original PS problem by using the Kuhn–Munkres (KM) algorithm to solve the MM problems on the bipartite graphs. These algorithms include two offline algorithms (named as KMUpper and KMLower) and one online algorithm named KMOnline. KMUpper and KMLower return upper and lower bounds for optimal profit of the PS problem, respectively. Simulation results show that our algorithms are more preferable than the other existing algorithms like FIFO, exponential capacity algorithm.

Journal

Ad Hoc NetworksElsevier

Published: Aug 1, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off