.png){kind=icon}
返回
Proactive key distribution using neighbor graphs
.png){kind=icon}
OA
AI
DOI：10.1109/MWC.2004.1269714.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
User mobility in wireless data networks is increasing because of technological advances, and the desire for voice and multimedia applications. These applications, however, require that handoffs between base stations (or access points) be fast to maintain the quality of the connections. In this article we introduce a novel data structure, the Neighbor Graph, that dynamically captures the mobility topology of a wireless network. We show how neighbor graphs can be utilized to obtain a 99 percent reduction in the authentication time of an IEEE 802.11 handoff (full EAP-TLS) by proactively distributing necessary key material one hop ahead of the mobile user. We also present a reactive method for fast authentication that requires only firmware changes to access points and hence can easily be deployed on existing wireless networks.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.5
论文数:
2.8K
被引数:
1.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Comparative longitudinal study of 2 methods of scheduling maintenance visits: 4‐year data两种计划维护访问方法的纵向比较研究: 4年数据
PREAI
分享收藏