Middleware Vertical Handoff Manager: A Neural Network-Based Solution
Bibliographic record
Abstract
Major research challenges in the next generation of wireless networks include the provisioning of worldwide seamless mobility across heterogeneous wireless networks, the improvement of end-to-end quality of service (QoS), supporting high data rates over wide area and enabling users to specify their personal preferences. The integration and interoperability of this multitude of available networks will lead to the emergence of the fourth generation (4G) of wireless technologies. 4G wireless technologies have the potential to provide these features and many more, which at the end will change the way we use mobile devices and provide a wide variety of new applications. However, such technology does not come without its challenges. One of these challenges is the user's ability to control and manage handoffs across heterogeneous wireless networks. This paper proposes a solution to this problem using artificial neural networks (ANNs). The proposed method is capable of distinguishing the best existing wireless network that matches predefined user preferences set on a mobile device when performing a vertical handoff. The overall performance of the proposed method shows 87.0 % success rate in finding the best available wireless network. To test for the robustness and effectiveness of the neural network algorithm, some of the features were removed from the training set and results showed a significant impact on the overall performance of the system. Hence, managing vertical handoffs through user preferences can be significantly affected with the selection of features used to provide the closest match of the available wireless networks.
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.000 | 0.001 |
| 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.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".