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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Patent |
| Published: |
2012
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/33273/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Putra Malaysia |
| id |
my.upm.eprints.33273 |
|---|---|
| record_format |
eprints |
| spelling |
my.upm.eprints.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. |
| institution |
Universiti Putra Malaysia |
| building |
UPM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Putra Malaysia |
| content_source |
UPM Institutional Repository |
| url_provider |
http://psasir.upm.edu.my/ |
| 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). |
| format |
Patent |
| author |
Mohd Ali, Borhanuddin Gilanian Sadeghi, Mohammad Mehdi |
| spellingShingle |
Mohd Ali, Borhanuddin Gilanian Sadeghi, Mohammad Mehdi A dynamic method for establishing efficient and scalable rekeying algorithm in mobile WiMAX |
| author_facet |
Mohd Ali, Borhanuddin Gilanian Sadeghi, Mohammad Mehdi |
| author_sort |
Mohd Ali, Borhanuddin |
| title |
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_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_sort |
dynamic method for establishing efficient and scalable rekeying algorithm in mobile wimax |
| publishDate |
2012 |
| url |
http://psasir.upm.edu.my/id/eprint/33273/ |
| _version_ |
1643830826777968640 |