{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:44:04Z","timestamp":1740149044955,"version":"3.37.3"},"reference-count":32,"publisher":"Wiley","license":[{"start":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T00:00:00Z","timestamp":1641859200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2018YFB1402800","RF-A2020007"],"award-info":[{"award-number":["2018YFB1402800","RF-A2020007"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Funds for the Provincial Universities of Zhejiang","award":["2018YFB1402800","RF-A2020007"],"award-info":[{"award-number":["2018YFB1402800","RF-A2020007"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2022,1,11]]},"abstract":"<jats:p>With the development of the smart Internet of Things (IoT), an increasing number of tasks are deployed on the edge of the network. Considering the substantially limited processing capability of IoT devices, task scheduling as an effective solution offers low latency and flexible computation to improve the system performance and increase the quality of services. However, limited computing resources make it challenging to assign the right tasks to the right devices at the edge of the network. To this end, we propose a polynomial-time solution, which consists of three steps, i.e., identifying available devices, estimating device quantity, and searching for feasible schedules. In order to shrink the number of potential schedules, we present a pairwise-allocated strategy (PA). Based on these, a capability average matrix (CAM)-based index is designed to further boost efficiency. In addition, we evaluate the schedules by the technique for order preference by similarity to an ideal solution (TOPSIS). Extensive experimental evaluation using both real and synthetic datasets demonstrates the efficiency and effectiveness of our proposed approach.<\/jats:p>","DOI":"10.1155\/2022\/6430612","type":"journal-article","created":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T15:05:09Z","timestamp":1641913509000},"page":"1-14","source":"Crossref","is-referenced-by-count":1,"title":["PACAM: A Pairwise-Allocated Strategy and Capability Average Matrix-Based Task Scheduling Approach for Edge Computing"],"prefix":"10.1155","volume":"2022","author":[{"given":"Feng","family":"Hong","sequence":"first","affiliation":[{"name":"College of Computer and Science College of Software, Zhejiang University of Technology, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3334-1701","authenticated-orcid":true,"given":"Tianming","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer and Science College of Software, Zhejiang University of Technology, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Cao","sequence":"additional","affiliation":[{"name":"College of Computer and Science College of Software, Zhejiang University of Technology, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Fan","sequence":"additional","affiliation":[{"name":"College of Computer and Science College of Software, Zhejiang University of Technology, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.2997832"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2020.3028497"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/NAS.2017.8026861"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.3390\/s20226545"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/tetci.2020.3023155"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/tcss.2021.3102591"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/tccn.2020.3027681"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/EDGE.2018.00016"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS47876.2019.00075"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/SEC.2018.00043"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3100253"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/infocom.2019.8737449"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2019.2907605"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/percom.2019.8767386"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.03.004"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2019.10.001"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2955311"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/jas.2019.1911540"},{"key":"19","doi-asserted-by":"crossref","DOI":"10.1201\/b11032","volume-title":"Multiple Attribute Decision Making: Methods and Applications","author":"G.-H. Tzeng","year":"2011"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.3390\/proceedings2110637"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104945"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2018.10.009"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2019.2935056"},{"first-page":"112","article-title":"A moead-based approach to solving the staff scheduling problem","author":"F. Hong","key":"24"},{"volume-title":"Gurobi Optimizer Reference Manual","year":"2018","author":"I. Gurobi Optimization","key":"25"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2950937"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2685"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS47876.2019.00067"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-019-01246-2"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2018.2850311"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1186\/s13638-019-1526-x"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5674"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2022\/6430612.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2022\/6430612.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2022\/6430612.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T15:05:21Z","timestamp":1641913521000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2022\/6430612\/"}},"subtitle":[],"editor":[{"given":"Yuyu","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,1,11]]},"references-count":32,"alternative-id":["6430612","6430612"],"URL":"https:\/\/doi.org\/10.1155\/2022\/6430612","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"type":"electronic","value":"1939-0122"},{"type":"print","value":"1939-0114"}],"subject":[],"published":{"date-parts":[[2022,1,11]]}}}