Multiple-Terminal Aggregation Algorithm for IoT Service
Author(s) -
Anzhi Wang,
Yongan Guo
Publication year - 2019
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2019.01.249
Subject(s) - computer science , terminal (telecommunication) , service (business) , internet of things , algorithm , computer network , computer security , economy , economics
In IoT, the execution of ubiquitous service often requires the cooperation between multiple terminals at the perception layer. In order to reasonably configure the best device set for each user’s business at the service layer, the multiple-terminal aggregation problem (MTAP), was studied based on the representation model of the service model (SM) and resource model (RM). Considering the complexity of the solution, MTAP is then transformed into a multi-choice, multi-dimensional backpack problem (MMKP) by dimensional reduction. Finally, the ant colony optimization-multi-terminal aggregation (ACO-MTA) algorithm for IoT ubiquitous service was proposed. The simulation proved that the ACO-MTA outperforms random selection (RS) or Greedy Algorithm (GA) in terms of comprehensive benefits, utilization of resources and business success rate.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom