Special Issue Paper
Efficient rekeying algorithms for WiMAX networks
Version of Record online: 30 JUL 2009
Copyright © 2009 John Wiley & Sons, Ltd.
Security and Communication Networks
Special Issue: Special Issue on: WiMAX Security and Applications
Volume 2, Issue 5, pages 392–400, September/October 2009
How to Cite
Brown, J., Du, X. and Guizani, M. (2009), Efficient rekeying algorithms for WiMAX networks. Security Comm. Networks, 2: 392–400. doi: 10.1002/sec.124
- Issue online: 2 OCT 2009
- Version of Record online: 30 JUL 2009
- US National Science Foundation (NSF). Grant Numbers: CNS-0721907, CNS-0709268
- US Army Research Office. Grant Numbers: W911NF-07-1-0250, W911NF-08-1-0334
- IEEE 802.16e;
- key management
In this paper, we study the rekeying issue in IEEE 802.16e WiMAX networks. The existing rekeying scheme—the Multicast and Broadcast Rekeying Algorithm (MBRA) unicasts new keys to each subscriber station (SS). This scheme does not scale well since it incurs large communication overheads when the number of SSs increase. In our work, first we propose a general tree-based rekeying scheme, which is more efficient than the MBRA. We also formulate an optimization problem to determine the optimal tree structure for given number of SSs. Furthermore, we present a novel and efficient rekeying scheme for WiMAX networks. Our new rekeying scheme utilizes efficient security schemes and the WiMAX network application feature. Both analysis and performance evaluation show that our rekeying scheme can significantly reduce the communication overheads. Copyright © 2009 John Wiley & Sons, Ltd.