Title :
On the random graph induced by a random key predistribution scheme under full visibility
Author :
Yagan, Osman ; Makowski, Armand M.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Maryland at Coll. Park, College Park, MD
Abstract :
We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We show the existence of a zero-one law for the absence of isolated nodes, and complement it by a Poisson convergence for the number of isolated nodes. Leveraging earlier results and analogies with Erdos-Renyi graphs, we explore similar results for the property of graph connectivity.
Keywords :
graph theory; wireless sensor networks; Erdos-Renyi graph; Poisson convergence; graph connectivity; isolated nodes; random graph; random key predistribution scheme; wireless sensor network; zero-one law; Communication system security; Computer networks; Convergence; Cryptography; Distributed computing; Educational institutions; Monitoring; Protection; Wireless communication; Wireless sensor networks; Absence of isolated nodes; Key predistribution; Poisson convergence; Secure connectivity; Wireless sensor networks; Zero-one laws;
Conference_Titel :
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location :
Toronto, ON
Print_ISBN :
978-1-4244-2256-2
Electronic_ISBN :
978-1-4244-2257-9
DOI :
10.1109/ISIT.2008.4595045
