Maximum Lifetime Strategy for Target Monitoring With Controlled Node Mobility in Sensor Networks With Obstacles
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
In this paper, an efficient technique is proposed for a mobile sensor network used to monitor a moving target in a field with obstacles while the network lifetime is maximized. The main sources of energy consumption of the sensors in the network are sensing, communication, and movement. A graph is constructed and its edges are weighted properly based on the remaining energy of each sensor. This graph is subsequently employed to address the lifetime maximization problem by solving a sequence of shortest path problems, which can be solved using existing methods. The proposed technique determines a near-optimal relocation strategy for the sensors as well as an energy-efficient route to transfer information from the target to destination. This near-optimal solution is calculated in every time instant, using the information of the previous time step. It is shown that by choosing appropriate parameters, sensors' locations and the communication route from target to destination obtained by the proposed algorithm can be arbitrarily close to the optimal locations and route at each time instant. Simulation results confirm the effectiveness of the proposed technique.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 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