With the increasing development of the Internet of Things (IoT), there is a growing need for efficient resource allocation to the many devices in the IoT system. This need is particularly acute in the case of time-sensitive applications, where fast resource allocation is essential. However, the resource allocation based on the Nash bargaining solution (NBS) necessitates exponentially increasing computational complexity for user dynamic systems. We propose an approach that makes groups based on the requested services and predicts a disagreement point whenever the group size changes, with the aim of reducing the computational complexity to find the NBS. Through simulation results, we demonstrate that our proposed approach outperforms the existing method in terms of execution time to find the NBS, maintaining the optimality in finding NBS.
|Title of host publication
|ICUFN 2023 - 14th International Conference on Ubiquitous and Future Networks
|IEEE Computer Society
|Number of pages
|Published - 2023
|14th International Conference on Ubiquitous and Future Networks, ICUFN 2023 - Paris, France
Duration: 4 Jul 2023 → 7 Jul 2023
|International Conference on Ubiquitous and Future Networks, ICUFN
|14th International Conference on Ubiquitous and Future Networks, ICUFN 2023
|4/07/23 → 7/07/23
Bibliographical notePublisher Copyright:
© 2023 IEEE.
- Internet of Things
- Nash bargaining solution
- resource management