Honey bee algorithm–based efficient cluster formation and optimization scheme in mobile ad hoc networks
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 mobile ad hoc networks, topology changes very frequently due to node’s mobility. Frequent change in topology increases traffic signaling that may arise energy and scalability issue. Cluster-based routing is the energy-efficient technique in mobile ad hoc networks to address the scalability issue and to minimize control messages. In this article, honey bee algorithm is used for dividing the mobile ad hoc network nodes into different clusters. The bees work to gather in groups to perform their activities. The proposed honey bee algorithm–based clustering forms clusters in an efficient manner with fewer resources such as energy and bandwidth utilization. A node is selected as cluster head based on node degree, neighbor’s behavior, mobility direction, mobility speed, and remaining energy. Due to the efficient nature of bees and maximum parameter’s consideration, the proposed technique inspired from the foraging behavior of honey bees gives efficient and stable cluster formation. The control message overhead is also avoided. The work is validated mathematically, and simulation has been performed for different scenarios. Simulation results are compared with existing clustering schemes. The simulation results show that the honey bee algorithm–based clustering technique used for clustering outperforms the existing schemes under consideration.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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