Psched: A Priority-Based Service Scheduling Scheme for the Internet of Drones

被引:27
|
作者
Pu, Cong [1 ]
Carpenter, Logan [1 ]
机构
[1] Marshall Univ, Dept Comp Sci & Elect Engn, Huntington, WV 25755 USA
来源
IEEE SYSTEMS JOURNAL | 2021年 / 15卷 / 03期
关键词
Unmanned aerial vehicles (UAVs); drones; Internet of Drones (IoD); zone service providers (ZSPs); download; upload service scheduling; PROTOCOLS;
D O I
10.1109/JSYST.2020.2998010
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the continuous miniaturization of sensors and processors and ubiquitous wireless connectivity, unmanned aerial vehicles (UAVs), also referred to as drones, are finding many new uses in enhancing our life and paving the way to the realization of Internet of Drones (IoD). In the IoD, a myriad of multisized and heterogeneous drones seamlessly interact with Zone Service Providers (ZSPs) to achieve the goal of assisting drones in accessing controlled airspace and providing navigation services. However, due to the high mobility of drones and the limited communication bandwidth between drones and ZSP, service scheduling becomes a critical issue when a set of drones wants to upload/download data to/from ZSP. In this article, we propose a priority-based service scheduling scheme, also named Psched, to provide efficient data upload/download service at ZSP in the IoD. The basic idea is that the Psched objectively and equitably assigns a weight to multiple service scheduling parameters based on multiattribute decision making theory, calculates the serving priority of each service request group, and then serves the service request groups based on the calculated serving priority accordingly. In addition, the Pschedtakes into account of bandwidth competition between upload and download service requests, and provides a service request balancing to achieve the maximum benefits of service scheduling scheme. In the experimental study, we choose request deadline, data size, and data popularity as service scheduling parameters, and conduct extensive simulation experiments using OMNeT++ for performance evaluation and comparison. The simulation results show that the proposed priority-based service scheduling scheme can not only increase service ratio but also can improve fresh data service ratio and average request serving latency, indicating a viable and efficient approach for satisfying service requests at ZSP in the IoD.
引用
收藏
页码:4230 / 4239
页数:10
相关论文
共 50 条
  • [41] Priority-based scheduling algorithm for real-time databases
    Son, S.H.
    Park, S.
    Journal of Information Science and Engineering, 1995, 11 (02):
  • [42] Priority-based operator scheduling strategy in data stream system
    Li Maozeng
    Wang Dan
    Du Dongming
    Advanced Computer Technology, New Education, Proceedings, 2007, : 332 - 337
  • [43] A new Class of Priority-based Weighted Fair Scheduling Algorithm
    Yang, Li
    Pan, ChengSheng
    Zhang, ErHan
    Liu, HaiYan
    2012 INTERNATIONAL CONFERENCE ON MEDICAL PHYSICS AND BIOMEDICAL ENGINEERING (ICMPBE2012), 2012, 33 : 942 - 948
  • [44] Priority-based task scheduling on heterogeneous resources in the Expert Cloud
    Ashouraie, Mehran
    Navimipour, Nima Jafari
    KYBERNETES, 2015, 44 (10) : 1455 - 1471
  • [45] A priority-based packet scheduling architecture for integrated services networks
    Zou, JN
    Xiong, HK
    Lin, RJ
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2006, E89B (03) : 704 - 708
  • [46] Task Scheduling in Cloud Computing: A Priority-Based Heuristic Approach
    Lipsa, Swati
    Dash, Ranjan Kumar
    Ivkovic, Nikola
    Cengiz, Korhan
    IEEE ACCESS, 2023, 11 : 27111 - 27126
  • [47] A Priority-based Polling Scheduling Algorithm in Web Cluster Servers
    Bao Li-yong
    Zhao Dong-feng
    Zhao Yi-fan
    PROCEEDINGS OF 2010 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (ICCSIT 2010), VOL 8, 2010, : 501 - 505
  • [48] A priority-based packet scheduling method in wireless sensor networks
    Yin, Xianglan
    Chen, Hua
    Shen, Yang
    Qi, Wangdong
    2006 IEEE INTERNATIONAL CONFERENCE ON INFORMATION ACQUISITION, VOLS 1 AND 2, CONFERENCE PROCEEDINGS, 2006, : 627 - 631
  • [49] Priority-based event message scheduling in distributed virtual environment
    Yu, Seokjong
    HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, PROCEEDINGS, 2006, 4208 : 884 - 893
  • [50] A priority-based ADMM approach for flexible train scheduling problems
    Gao, Ruhu
    Niu, Huimin
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2021, 123