« Previous Article

Original Research
Online Published: 12 Mar 2020

Published online: 12 Mar 2020
 


Heuristics for a Scheduling Problem in a Wireless Network

Hani Alquhayz.


Abstract
This study considers a network problem, for which we propose a new component in a network architecture called a scheduler. For each set of packets requested by a user, the scheduler solves a scheduling problem in assigning packets to routers. The related problem is NP-hard. We search to find some approximate solutions to solve the problem. This is because the optimal solution is based on the branch and bound method, which is generally characterized by a very high run time. In this study, we propose several heuristics, based essentially on multi-fit, a subset-sum problem, and dispatching rules. The efficiency of the heuristics is measured by using several indicators,including a comparison with a lower bound. The performance of the algorithms is represented in experimental results. As shown herein, in 100% of cases, the best heuristic value represents the optimal solution.

Key words: wireless network, routers; dispatching; scheduling; big data


 
ARTICLE TOOLS
Abstract
PDF Fulltext
How to cite this articleHow to cite this article
Citation Tools
Related Records
 Articles by Hani Alquhayz
on Google
on Google Scholar


How to Cite this Article
Pubmed Style

Hani Alquhayz. Heuristics for a Scheduling Problem in a Wireless Network. Journal of Engineering and Applied Sciences. 2019; 6(1): 19-27. doi:10.5455/jeas.2019050103

Web Style

Hani Alquhayz. Heuristics for a Scheduling Problem in a Wireless Network. https://jecasmu.org/?mno=92034 [Access: January 28, 2025]. doi:10.5455/jeas.2019050103

AMA (American Medical Association) Style

Hani Alquhayz. Heuristics for a Scheduling Problem in a Wireless Network. Journal of Engineering and Applied Sciences. 2019; 6(1): 19-27. doi:10.5455/jeas.2019050103


Vancouver/ICMJE Style

Hani Alquhayz. Heuristics for a Scheduling Problem in a Wireless Network. Journal of Engineering and Applied Sciences. (2019), [cited January 28, 2025]; 6(1): 19-27. doi:10.5455/jeas.2019050103


Harvard Style

Hani Alquhayz (2019) Heuristics for a Scheduling Problem in a Wireless Network. Journal of Engineering and Applied Sciences, 6 (1), 19-27. doi:10.5455/jeas.2019050103


Turabian Style

Hani Alquhayz. 2019. Heuristics for a Scheduling Problem in a Wireless Network. Journal of Engineering and Applied Sciences, 6 (1), 19-27. doi:10.5455/jeas.2019050103


Chicago Style

Hani Alquhayz. "Heuristics for a Scheduling Problem in a Wireless Network." Journal of Engineering and Applied Sciences 6 (2019), 19-27. doi:10.5455/jeas.2019050103


MLA (The Modern Language Association) Style

Hani Alquhayz. "Heuristics for a Scheduling Problem in a Wireless Network." Journal of Engineering and Applied Sciences 6.1 (2019), 19-27. Print. doi:10.5455/jeas.2019050103


APA (American Psychological Association) Style

Hani Alquhayz (2019) Heuristics for a Scheduling Problem in a Wireless Network. Journal of Engineering and Applied Sciences, 6 (1), 19-27. doi:10.5455/jeas.2019050103


Journal of Engineering and Applied Sciences Submit Article Track your Article
  • ISSN: 1658-6638 (print)
  • ISSN: 1658-7073 (electronic)