Improved Group Key Management with Host Mobility Protocol in Wireless Mobile Environment
Title | Improved Group Key Management with Host Mobility Protocol in Wireless Mobile Environment |
Publication Type | Conference Paper |
Year of Publication | 2019 |
Authors | Eya, Nnabuike, Alhassan, Haru, AlAbdullah, Ali, Hameed, Khalid, Bin-Melha, Mohammed, Abd-Alhameed, Raed A. |
Conference Name | Proceedings of the International Conference on Information and Communication Technology |
Date Published | apr |
Publisher | Association for Computing Machinery |
Conference Location | Baghdad, Iraq |
ISBN Number | 978-1-4503-6643-4 |
Keywords | Group communication, Group key management, Human Behavior, human factors, Metrics, mobile wireless environment, pubcrawl, resilience, Resiliency, Scalability, security, wireless network |
Abstract | Group communication as an efficient communication mechanism, in recent years has become popular. This is due to the increase in group applications and services. Group communication ensures efficient delivery of packets from one source to multiple recipients or many sources to multiple recipients. Group key management in a wireless environment has been an interesting challenge with group communication because of insecure communication channel. The security and integrity of group communication in a wireless environment is a challenge. One of the challenges with group communication is the mobility of group members. Member mobility is a challenge when designing a group key management scheme. There have been several attempts that have been made to design a secure group key management for wireless environment. Not so many successful attempts have towards wireless mobile environments to explicitly address the various challenges with dynamic mobility issue between multiple networks. This research proposes a GKM scheme that tackles mobility in group communication. The protocol is analyzed to assess security and performance requirements. The size of the group variation, the mobility rate variation are carefully observed to determine the impact on the average of rekeying messages generated at every event and also 1-affects-n phenomenon. The results achieved, shows that the proposed protocol outperforms other popular solutions with less number of rekeying messages per event and also less number of affected members per event. Backward and Forward security are preserved for moving members. |
URL | https://dl.acm.org/doi/10.1145/3321289.3321301 |
DOI | 10.1145/3321289.3321301 |
Citation Key | eya_improved_2019 |