Abstract
Secret key generation by extracting the shared randomness in wireless fading channel is a promising way to ensure wireless communication security. Previous works only consider key generation in static networks, but real-world key establishments are usually dynamic. In this work, for the first time we investigate the pairwise key generation in dynamic wireless networks with a center node (eg. access point (AP)) and random arrival users. We establish the key generation model for this kind of networks. We propose a method based on discrete Markov chain to calculate the average time a user will spend on waiting and completing the key generation (average key generation delay, AKGD). Our method can tackle both serial and parallel key generation scheduling under various conditions. We conduct extensive simulations to show the effectiveness of our model and method. The analytical and simulation results match to each other.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.