Sustainable Edge Node Computing Deployments in Distributed Manufacturing Systems
Bibliographic record
Abstract
The advancement of mobile internet technology has created opportunities for integrating the Industrial Internet of Things (IIoT) and edge computing in smart manufacturing. These sustainable technologies enable intelligent devices to achieve high-performance computing with minimal latency. This paper introduces a novel approach to deploy edge computing nodes in smart manufacturing environments at a low cost. However, the intricate interactions among network sensors, equipment, service levels, and network topologies in smart manufacturing systems pose challenges to node deployment. To address this, the proposed sustainable game theory method identifies the optimal edge computing node for deployment to attain the desired outcome. Additionally, the standard design of Software Defined Network (SDN) in conjunction with edge computing serves as forwarding switches to enhance overall computing services. Simulations demonstrate the effectiveness of this approach in reducing network delay and deployment costs associated with computing resources. Given the significance of sustainability, cost efficiency plays a critical role in establishing resilient edge networks. Our numerical and simulation results validate that the proposed scheme surpasses existing techniques like shortest estimated latency first (SELF), shortest estimated buffer first (SEBF), and random deployment (RD) in minimizing the total cost of deploying edge nodes, network delay, packet loss, and energy consumption.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| 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".