A New SDN-Based Routing Protocol for Improving Delay in Smart City Environments
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The smart city is an ecosystem that interconnects various devices like sensors, actuators, mobiles, and vehicles. The intelligent and connected transportation system (ICTS) is an essential part of this ecosystem that provides new real-time applications. The emerging applications are based on Internet-of-Things (IoT) technologies, which bring out new challenges, such as heterogeneity and scalability, and they require innovative communication solutions. The existing routing protocols cannot achieve these requirements due to the surrounding knowledge supported by individual nodes and their neighbors, displaying partial visibility of the network. However, the issue grew ever more arduous to conceive routing protocols to satisfy the ever-changing network requirements due to its dynamic topology and its heterogeneity. Software-Defined Networking (SDN) offers the latest view of the entire network and the control of the network based on the application’s specifications. Nonetheless, one of the main problems that arise when using SDN is minimizing the transmission delay between ubiquitous nodes. In order to meet this constraint, a well-attended and realistic alternative is to adopt the Machine Learning (ML) algorithms as prediction solutions. In this paper, we propose a new routing protocol based on SDN and Naive Bayes solution to improve the delay. Simulation results show that our routing scheme outperforms the comparative ones in terms of end-to-end delay and packet delivery ratio.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it