Topology control for balanced energy consumption in emergency wireless deployments
Bibliographic record
Abstract
Wireless networks became an integral component of nowadays communication infrastructure and, due to their mobility and limited battery life, energy efficiency needs an important design consideration. Such networks are usually modeled by so called mobile ad-hoc networks (MANETs) models, further represented as simple graphs where the vertices have precise geometric locations and edges are straight lines.Topology control is concerned with the assignment of different transmission power to wireless devices antenna such that the obtained ad-hoc networks satisfy some specific properties (connectivity, planarity, minimum energy, bounded degree, etc.). In this paper, we study the energy-balanced topology control problem, which is defined as follows: given a set of hosts in an ad hoc network, adjust the transmission power of each host so that the resultant network topology is connected and the maximum energy consumption among all the hosts is minimized. This problem has been solved by Ramanathan et. all [12] for static ad-hoc networks in a 2D environment.We extend the algorithm from [12] for a dynamic environment in both 2D and 3D environment. We describe a communication protocol on top of this algorithm in order to ensure the connectivity and the energy balanced properties.During the movement of nodes, the topology has to be changed. Since, in our protocol, each reconfiguration implies that all the nodes will transmit at maximum power, we study the influence of increasing the transmission radius of each node, by a fixed percent, over the number of reconfiguration needed, in order to maintain the network connectivity. Using an original network simulator, we show that the decreasing in the number of reconfigurations is exponential in terms of percentage of transmission radius increasing, which leads to a trade-off between the energy consumptions due to reconfigurations and due to the increased transmission radius. We also study the implication of other factors over the number of reconfigurations, such as node density, maximum transmission range, and different movement parameters (speed, changing of direction time).
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.002 |
| 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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".