ArticleSensors (Basel, Switzerland)2024
Dynamic Coalition Formation among IoT Service Providers: A Systematic Exploration of IoT Dynamics Using an Agent-Based Model.
Article in Sensors (Basel, Switzerland), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed.
- Satellite Observation Mission Resource Scheduling Based on Dynamic Coalition Algorithm.Sensors (Basel, Switzerland) · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
This paper introduces an Agent-Based Model (ABM) designed to investigate the dynamics of the Internet of Things (IoT) ecosystem, focusing on dynamic coalition formation among IoT Service Providers (SPs). Drawing on insights from our previous research in 5G network modeling, the ABM captures intricate interactions among devices, Mobile Network Operators (MNOs), SPs, and customers, offering a comprehensive framework for analyzing the IoT ecosystem's complexities. In particular, to address the emerging challenge of dynamic coalition formation among SPs, we propose a distributed Multi-Agent Dynamic Coalition Formation (MA-DCF) algorithm aimed at enhancing service provision and fostering collaboration. This algorithm optimizes SP coalitions, dynamically adjusting to changing demands over time. Through extensive experimentation, we evaluate the algorithm's performance, demonstrating its superiority in terms of both payoff and stability compared to three classical coalition formation algorithms: static coalition, non-overlapping coalition, and random coalition. This study significantly contributes to a deeper understanding of the IoT ecosystem's dynamics and highlights the potential benefits of dynamic coalition formation among SPs, providing valuable insights and opening future avenues for exploration.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.