Trust-Based Fast Authentication for Multiowner Wireless Networks
Trust-Based Fast Authentication for Multiowner Wireless Networks
复制标题
DOI：
10.1109/tmc.2007.70720
复制
发表时间：
2008-02
影响因子：
7.9
通讯作者：
J. Hassan;H. Sirisena;B. Landfeldt
中科院分区：
文献类型：
--
作者：
J. Hassan;H. Sirisena;B. Landfeldt
在多所有者无线网络中，接入点（ap）由不同的管理机构拥有和操作，导致在接入点之间切换期间出现严重的身份验证延迟。我们建议利用相邻ap所有者之间的信任来减少身份验证延迟。在该认证方案中，相互信任的相邻ap共享访问节点的安全密钥，避免了每次访问节点切换ap时冗长的认证程序。利用马尔可夫模型对所提出的基于信任的认证方案的性能进行了评估。通过数值实验，我们首先研究了移动节点不知道给定邻域中存在信任网络的基本场景。随后，我们考虑了一种高级场景，其中增强了移动节点功能以发现信任网络，从而最大限度地减少可信ap之外的漫游。我们发现，即使使用基本实现，漫游移动设备所需的完整身份验证的平均次数也会随着两个相邻ap相互信任的可能性增加而线性减少。实验结果表明，该算法实现了二次约简。利用离散事件仿真对马尔可夫模型进行了验证。
In multiowner wireless networks, access points (APs) are owned and operated by different administrations, leading to significant authentication delays during handoff between APs. We propose to exploit the trust between the owners of neighboring APs for reducing the authentication delay. In the proposed authentication scheme, neighboring APs that trust each other share the security key for the visiting node to avoid lengthy authentication routines each time the visiting node switches APs. The performance of the proposed trust-based authentication scheme is evaluated using a Markov model. Using numerical experiments, we first study a basic scenario where mobile nodes are not aware of the trust networks that exist in a given neighborhood. Subsequently, we consider an advanced scenario where a mobile node functionality is augmented to discover the trust network so as to minimize roaming beyond the trusted APs. We find that, even with the basic implementation, the average number of full authentications needed for a roaming mobile reduces linearly as the likelihood of two neighboring APs trusting each other increases. With the advanced implementation, our experiments show that quadratic reduction is achieved. The Markov model is validated using discrete event simulation.