{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T08:14:18Z","timestamp":1767168858629,"version":"build-2238731810"},"reference-count":27,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"vor","delay-in-days":129,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Department of Education of Guangxi Zhuang","award":["2019KY0863"],"award-info":[{"award-number":["2019KY0863"]}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>This article proposes an Analytic Hierarchy Process Dempster\u2010Shafer (AHP\u2010DS) and similarity\u2010based network selection algorithm for the scenario of dynamic changes in user requirements and network environment; combines machine learning with network selection and proposes a decision tree\u2010based network selection algorithm; combines multiattribute decision\u2010making and genetic algorithm to propose a weighted Gray Relation Analysis (GRA) and genetic algorithm\u2010based network access decision algorithm. Firstly, the training data is obtained from the collaborative algorithm, and it is used as the training set, and the network attributes are used as the attribute set, and the continuous attributes are discretized by dichotomization, and the attribute that can make the greatest information gain is selected as the division feature, and a decision tree with strong generalization ability is finally obtained, which is used as the decision basis for network access selection. The simulation results show that the algorithm proposed in this thesis can effectively improve user service quality under three services, and the algorithm is simple and effective with low complexity. It first uses AHP\u2010DS hierarchical analysis to establish a recursive hierarchy for the network selection problem and obtains the subjective weights of network attributes through the judgment matrix. Then, it uses a genetic algorithm to adjust the subjective weight, defines the fitness function in the genetic algorithm\u2010based on gray correlation analysis, adjusts the weights of the selection operator, crossover operator, and variation operator in the genetic algorithm, and gets the network with the largest fitness as the target network, which can effectively improve the user service quality.<\/jats:p>","DOI":"10.1155\/2021\/4239750","type":"journal-article","created":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T20:07:33Z","timestamp":1620677253000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["[Retracted] Load Balancing Selection Method and Simulation in Network Communication Based on AHP\u2010DS Heterogeneous Network Selection Algorithm"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3748-3195","authenticated-orcid":false,"given":"Weiwei","family":"Xiao","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,5,10]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2018.2822873"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-018-0473-x"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2020.102286"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2940988"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/twc.2017.2718526"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2874692"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.21136\/AM.2021.0069-20"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2881314"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/int.22026"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00542-018-4116-7"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/twc.2017.2705039"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2020.03.025"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1080\/08985626.2018.1537149"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2018.2805190"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/mwc.2017.1600255"},{"key":"e_1_2_9_16_2","volume-title":"Theory and Method of Intuitionistic Fuzzy Preference Relation Group Decision Making","author":"Wan S. P.","year":"2019"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/tgcn.2018.2839593"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-018-1676-5"},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2018.2870872"},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2842738"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-018-5649-x"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/mwc.2018.1700074"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2962115"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1002\/stc.1585"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.buildenv.2019.106284"},{"key":"e_1_2_9_26_2","first-page":"1","article-title":"Venue topic model\u2013enhanced joint graph modelling for citation recommendation in scholarly big data","volume":"20","author":"Wang W.","year":"2020","journal-title":"ACM Transactions on Asian and Low-Resource Language Information Processing (TALLIP)"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2020.107275"}],"updated-by":[{"DOI":"10.1155\/2023\/9842735","type":"retraction","label":"Retraction","source":"retraction-watch","updated":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T00:00:00Z","timestamp":1692144000000},"record-id":"50760"},{"DOI":"10.1155\/2023\/9842735","type":"retraction","label":"Retraction","source":"publisher","updated":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T00:00:00Z","timestamp":1692144000000}}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/4239750.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/4239750.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/4239750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T18:19:51Z","timestamp":1723227591000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/4239750"}},"subtitle":[],"editor":[{"given":"Zhihan","family":"Lv","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/4239750"],"URL":"https:\/\/doi.org\/10.1155\/2021\/4239750","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-04-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-05","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"4239750"}}