Efficient scheduling of video camera sensor networks for IoT systems in smart cities
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
Abstract Video camera sensor networks (VCSN) has numerous applications in smart cities, including vehicular networks, environmental monitoring, and smart houses. Scheduling of video camera sensor networks (VCSN) can reduce the computational complexity, increase energy efficiency, and enhance throughput for the Internet of things (IoT) systems. In this paper, we apply the iterative low‐complexity probabilistic evolutionary method for scheduling video cameras to maximize throughput in VCSNs for IoT systems. Scheduling of video cameras in VCSNs to maximize throughput is a combinatorial optimization problem whose computational complexity increases exponentially with the increase in the number of video cameras. We propose an iterative probabilistic method named as cross‐entropy optimization (CEO), which is an evolutionary algorithm. The combinatorial optimization problems can be solved using the CEO which is a generalized Monte Carlo technique. The proposed method updates its selected population (video cameras) at each iteration based on the Kullback Leibler (KL) distance/divergence. The KL distance/divergence is minimized using the probability distribution obtained from the learned from the group of selected samples of better solutions found in the previous iterations. The effectiveness of the CEO is verified in terms of optimality and simplicity through simulations. In addition, the results of the CEO are better than the suboptimal algorithms (ie, best norm‐based algorithm, genetic algorithm, and capacity upper‐bound–based greedy algorithm) and maximum of 2%‐3% deviation from the exhaustive search (optimal) with less complexity. The trade‐off between CEO and optimal is the computational complexity.
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.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 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