Energy efficient target set selection and buffer management for D2D mobile data offloading
Bibliographic record
Abstract
Data offloading offers a significant solution to the problem of explosive rise in mobile data traffic. A naive approach would be to utilize the infrastructure (cellular tower, WiFi, femtocell) or other mobile devices to offload data. However, increasing the number of a cellular towers, WiFi, or femtocells is costlier deal for data delivery. Recently, device-to-device (D2D) paradigm of data communication has emerged out as one of the most promising solutions to deal with cost effective cellular traffic offloading. D2D communication provides a direct communication link between closely located mobile users. Another significant feature of D2D is its content centric nature, which makes it useful in data offloading. In this paper, we have addressed the issue of data offloading in mobile devices and proposed a hybrid model of D2D communication with ad-hoc nature. The paper also considers the issues like memory constraints of the devices, pruning of replicated messages and energy efficiency to increase the lifetime of the battery. Considering all the constraints and trade off, we have modeled our problem into optimal target selection problem and distributed community detection problem, both of which are NP-hard. We propose a clustering algorithm to optimize the cooperative mobile nodes. The proposed algorithm uses the betweenness centrality and k-means for optimizing target set section. Our proposed algorithm requires less time in terms of computational complexity with limited space. We compare it with the community-based approach in terms of load transferred for varying target set sizes for validation. The simulation results of the suggested algorithm may reduce the energy requirements up to 16.7% and is able to accommodate 80% more traffic as compared to the community-based algorithm.
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 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.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".