Secured fast link-layer handover protocols for 3G-WLAN interworking architecture
Bibliographic record
Abstract
Interworking 3rd generation (3G) mobile systems and IEEE 802.11 wireless local area networks (WLANs) introduces new challenges including the design of secured fast handover protocols. Handover operations must not compromise the security of the network. In addition, handovers must be instantaneous to sustain the quality of service (QoS) of the applications running on the WLAN-User Equipment (WLAN-UE). Existing handover protocols are not suitable for 3G-WLAN interworking because they are limited to Intra Extended Service Set (ESS) roaming and lack the support of mutual authentication between the WLAN-UE and the authentication server. This paper proposes novel secured fast handover protocols for 3G-WLAN interworking architectures, which overcome the limitations of existing handover protocols. The functionality of Extensible Authentication Protocol with Authentication and Key Agreement (EAP-AKA) is extended to support Intra and Inter ESS secured handover messaging. Modifications to the standard EAP-AKA authentication and the standard EAP-AKA key hierarchy are proposed to achieve the security goals of the proposed protocols. The proposed protocols are more suitable for 3G-WLAN interworking handovers than existing handover protocols because they support Inter ESS handover, achieve mutual authentication service and adopts an efficient key management scheme.
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.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| 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".