Abstract
The key covering problem (KCP) in the group rekeying for secure multicast communication is NP-Hard. We try to introduce the ant colony optimization (ACO) idea to solve the KCP, but the KCP can’t be solved directly by the existing ant algorithms. So we design a new kind of heuristic algorithm, called clever ant colony system (CACS), for the KCP. Firstly, we establish a map from a secure multicast group to an auxiliary key graph (AKG). Secondly, according to the idea of the ant colony system (ACS), we design the CACS over AKG. Finally, using simulation, we verify that the CACS is feasible and keeps high performance with a very short time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
