Proactive key distribution using neighbor graphs
Proactive key distribution using neighbor graphs
复制标题
DOI：
10.1109/mwc.2004.1269714
复制
发表时间：
2004-02
影响因子：
12.9
通讯作者：
Arunesh Mishra;Minho Shin;N. L. Petroni;T. Clancy;W. Arbaugh
中科院分区：
文献类型：
--
作者：
Arunesh Mishra;Minho Shin;N. L. Petroni;T. Clancy;W. Arbaugh
由于技术进步以及对语音和多媒体应用的需求，无线数据网络中的用户移动性正在增加。然而，这些应用要求基站(或接入点)之间的切换速度很快，以保持连接质量。在本文中，我们介绍了一种新的数据结构--邻居图，它动态地捕获无线网络的移动性拓扑。我们展示了如何利用邻居图通过比移动用户提前一跳主动分发必要的密钥材料来将IEEE 802.11切换的认证时间缩短99%。我们还提供了一种反应式快速身份验证方法，该方法只需更改接入点的固件，因此可以轻松地在现有无线网络上部署。
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.