Cost-Efficient and Trust-Aware Virtual Network Embedding for Dense Industrial IoT Systems Using Multiagent Systems
Bibliographic record
Abstract
Network virtualization in wireless sensor networks (WSNs) enables the utilization of shared sensing capabilities in many industrial Internet of Things (IIoT) applications. Efficient assignment of WSN resources can be achieved through virtual network embedding (VNE) while considering the quality of information (QoI) (as the accuracy of sensing), the quality of service (QoS) (as the reliability), and wireless interference handling constraints. The more the virtual networks can be mapped onto the substrate network, the more revenue the infrastructure provider will acquire. Therefore improving the acceptance rate of VNE is essential. However, this may lead to occupying more network resources and links and increase the cost, especially in dense networks. On the other hand, the shared and complex nature of VNE exposes WSNs to security risks. In this paper, we develop a novel offline distributed trust-aware virtual wireless sensor networks (DTA-VWSN) algorithm to maximize the virtual networks acceptance rate while minimizing the cost. Our proposed algorithm considers the QoI, QoS, and security, by adding required trust level constraints to virtual nodes and links and trust level constraints to the substrate counterparts. Since centralized algorithms suffer from scalability issues, this paper presents our new approach to the virtual network embedding problem in a distributed manner. In this paper, we use the techniques of multiagent systems as a well-known approach for distributed systems to scale these algorithms to network size. Our DTA-VWSN algorithm achieves a high-quality sub-optimal solution in a short duration, enabling us to investigate the tradeoff between solution quality and search time. Our algorithm is also evaluated in large-scale network scenarios to verify all enforced limitations by the WSN substrate. Simulation results show that DTA-VWSN improves the virtual network acceptance ratio, cost, and execution time in large-scale substrate networks. For instance, in a scenario with 150 substrate nodes and 6 VNRs, the accuracy of DTA-VWSN compared with the optimal value in terms of the VNR acceptance rate and the cost is 91.6% and 94.5%, respectively, while the execution time is 68.35% faster.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".