Scalable rekeying algorithm in IEEE 802.16e

• Main Authors: Gilanian Sadeghi, Mohammad Mehdi, Borhanuddin, Mohd Ali, Ma, Maode, Jamalul-lail, Ab Manan, Nor Kamariah, Noordin, Sabira, Khatun
• Format: Conference or Workshop Item
• Language: English
• Published: IEEE 2011
• Subjects: QA76 Computer software
• Online Access: http://umpir.ump.edu.my/id/eprint/25719/1/Scalable%20rekeying%20algorithm%20in%20IEEE%20802.pdf; http://umpir.ump.edu.my/id/eprint/25719/; https://doi.org/10.1109/APCC.2011.6152902

IEEE 802.16e standard provides wide coverage and high bandwidth for subscribers in a metropolitan area network. It introduces Multicast and Broadcast Rekeying Algorithm (MBRA) which is a multicasting scheme to communicate with many users concurrently. Although ELAPSE (for Efficient sub-Linear rekeying Algorithm with Perfect SEcrecy) improves on the deficiencies of MBRA, the algorithm poorly responds to scalability issue. This paper proposes a Scalable Rekeying Algorithm (SRA) based on a complete binary tree structure. SRA is introduced with linear linked list structure in order to make the system more scalable. Evaluation analysis shows that SRA manages to improve the scalability issue in MBRA for Mobile WiMAX.