A dynamic method for establishing efficient and scalable rekeying algorithm in mobile WiMAX
A method of establishing dynamically key management protocol in Mobile WiMAX network is provided, the method includes the steps of dividing into subgroups based on the number of MSs using two tree data structures, wherein the first tree is a special binary tree structure called Set-pruning Tries, an...
| Main Authors: | , |
|---|---|
| Format: | Patent |
| Published: |
2012
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/33273/ |
| _version_ | 1848847443655917568 |
|---|---|
| author | Mohd Ali, Borhanuddin Gilanian Sadeghi, Mohammad Mehdi |
| author_facet | Mohd Ali, Borhanuddin Gilanian Sadeghi, Mohammad Mehdi |
| author_sort | Mohd Ali, Borhanuddin |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | A method of establishing dynamically key management protocol in Mobile WiMAX network is provided, the method includes the steps of dividing into subgroups based on the number of MSs using two tree data structures, wherein the first tree is a special binary tree structure called Set-pruning Tries, and the second tree structure is a B-tree of order 2, applying merging or splitting subgroups based on the existing number of MSs, The binary tree classifies MSs into subgroups by using Connection Identifier (CID) issued by a Base Station (BS). |
| first_indexed | 2025-11-15T09:18:41Z |
| format | Patent |
| id | upm-33273 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T09:18:41Z |
| publishDate | 2012 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-332732018-03-29T02:37:52Z http://psasir.upm.edu.my/id/eprint/33273/ A dynamic method for establishing efficient and scalable rekeying algorithm in mobile WiMAX Mohd Ali, Borhanuddin Gilanian Sadeghi, Mohammad Mehdi A method of establishing dynamically key management protocol in Mobile WiMAX network is provided, the method includes the steps of dividing into subgroups based on the number of MSs using two tree data structures, wherein the first tree is a special binary tree structure called Set-pruning Tries, and the second tree structure is a B-tree of order 2, applying merging or splitting subgroups based on the existing number of MSs, The binary tree classifies MSs into subgroups by using Connection Identifier (CID) issued by a Base Station (BS). 2012-05-08 Patent NonPeerReviewed Borhanuddin Mohd. Ali (2012) A dynamic method for establishing efficient and scalable rekeying algorithm in mobile WiMAX. PI2012002016. |
| spellingShingle | Mohd Ali, Borhanuddin Gilanian Sadeghi, Mohammad Mehdi A dynamic method for establishing efficient and scalable rekeying algorithm in mobile WiMAX |
| title | A dynamic method for establishing efficient and scalable rekeying algorithm in mobile WiMAX |
| title_full | A dynamic method for establishing efficient and scalable rekeying algorithm in mobile WiMAX |
| title_fullStr | A dynamic method for establishing efficient and scalable rekeying algorithm in mobile WiMAX |
| title_full_unstemmed | A dynamic method for establishing efficient and scalable rekeying algorithm in mobile WiMAX |
| title_short | A dynamic method for establishing efficient and scalable rekeying algorithm in mobile WiMAX |
| title_sort | dynamic method for establishing efficient and scalable rekeying algorithm in mobile wimax |
| url | http://psasir.upm.edu.my/id/eprint/33273/ |