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.
Ad Hoc Networks – Elsevier
Published: Aug 1, 2018
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
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
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.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera