Optimal key generation policies for MANET security

Hussein Al-Zubaidy*, Ioannis Lambadaris, Yannis Viniotis, Changcheng Huang, Ren Hung Hwang


研究成果: Conference contribution同行評審

4 引文 斯高帕斯(Scopus)


In this work, we investigate the optimal key generation problem for a threshold security scheme in mobile ad hoc networks. The nodes in these networks are assumed to have limited power and critical security states. We model this problem using a closed discrete-time queuing system with L queues (one per node) randomly connected to Κ servers (where Κ nodes need to be contacted to construct a key). In this model, each queue length represents the available security-related credits of the corresponding node. We treat this problem as a resource allocation problem where the resources to be allocated are the limited power and security credits. We introduce the class of Most Balancing Credit Conserving (MBCC) policies and provide their mathematical characterization. We prove, using dynamic coupling arguments, that MBCC policies are optimal among all key generation policies; we define optimality as maximization, in a stochastic ordering sense, of a random variable representing the number of keys generated for a given initial system state.

主出版物標題2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
出版狀態Published - 2010
事件53rd IEEE Global Communications Conference, GLOBECOM 2010 - Miami, FL, United States
持續時間: 6 12月 201010 12月 2010


名字GLOBECOM - IEEE Global Telecommunications Conference


Conference53rd IEEE Global Communications Conference, GLOBECOM 2010
國家/地區United States
城市Miami, FL


深入研究「Optimal key generation policies for MANET security」主題。共同形成了獨特的指紋。