Abstract
Connectivity, resilient and unsplittability are the essential requirements of any wireless sensor network (WSN). Connectivity ensures that the complete network is a single component and there exists at least one path between any two nodes, while resilient and unsplittability ensures that the network remains connected even if a linear proportion of the nodes were compromised by the adversary. In this work we consider a wireless sensor network induced by kryptograph with non-full visibility condition. We derive a threshold for transmission range above which the WSN becomes connected almost surely. We also derive threshold conditions to show resilience and unsplittability of connected sensor networks in an almost sure sense and provided simulated experiments in support of our claims.
Similar content being viewed by others
References
Appel, M.J.B., Russo, R.P.: The maximum vertex degree of a graph on the uniform points in \([0, 1]^d\). Adv. Appl. Prob. 29, 567–581 (1997a)
Appel, M.J.B., Russo, R.P.: The minimum vertex degree of a graph on the uniform points in \([0, 1]^d\). Adv. Appl. Prob. 29, 582–594 (1997b)
Appel, M.J.B., Russo, R.P.: The connectivity of a graph on uniform points in \([0, 1]^d\). Stat. Prob. Lett. 60, 351–357 (2002)
Ashouri, M., Zali, Z., Mousavi, S.R., Hashemi, M.R.: New optimal solution to disjoint set K-coverage for lifetime extension in wireless sensor networks. IET Wireless Sens. Syst. 2(1), 31–39 (2012)
Blackburn, S.R., Gerke, S.: Connectivity of the uniform random intersection graph. Discr. Math. 309, 5130–5140 (2009)
Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: IEEE Symposium on Security and Privacy (2003)
Dette, H., Henze, N.: The limit distribution of the largest nearest neighbor link in the unit D-cube. J. Appl. Prob. 26, 67–80 (1989)
Di Pietro, R., Mancini, L.V., Mei, A., Panconesi, A., Radhakrishnan, J.: Connectivity properties of secure wireless sensor networks, SASN 04, USA (2004)
Di Pietro, R., Mancini, L.V., Mei, A., Panconesi, A., Radhakrishnan, J.: Redoubtable sensor networks. ACM Transaction on Information System Security, TISSEC11, pp. 1–22 (2008)
Erdos, P., Renyi, A.: On the evalution of random graph. Publ. Math. Inst. Hunger. Acad. Sci. 5, 17–61 (1960)
Eschenauer, L., Gligor, Virgil D.: A key-management scheme for distributed sensor networks. In: 9th ACM conference on computer and communication security (2002)
Gilbert, E.N.: Random plane networks. J. Soc. Ind. Appl. Math. 9, 533–553 (1961)
Gupta, B.: Vertex degree of random geometric graph on exponentially distributed points. Stat. Probab. Lett. 79(19), 2020–2027 (2009)
Gupta, B., Iyer, S.K.: Criticality of the exponential rate of decay for the largest nearest neighbor link in random geometric graphs. Adv. Appl. Prob. 42(3), 631–658 (2010)
Gupta, B., Pandey, J.: Non-existence of Isolated nodes in secure wireless sensor network. Wireless Pers. Commun. 85(3), 1367–1380 (2015)
Gupta, B., Iyer, S.K., Manjunath, D.: On the topological properties of one dimensional exponential random geometric graph. Random Struct. Algorithm 32(2), 181–204 (2008)
Internet Engineering Task Force. Diffie-hellman Key Agreement Method. http://tools.ietf.org/html/rfc2631
Jokhio, S.H., Jokhio, I.A., Kemp, A.H.: Node capture attack detection and defence in wireless sensor networks. IET Wireless Sens. Syst. 2(3), 161–169 (2012)
Neuman, B.C., Ts’o, T.: Kerberos: an authentication service for computer networks. IEEE Commun. Mag. 32(9), 33–38 (1994)
Penrose, M.D.: Extremes for the minimal spanning tree on the normally distributed points. Adv. Appl. Prob. 30, 628–639 (1998)
Penrose, M.D.: On \(k\)-connectivity for a random geometric graph. Random Struct. Algorithms 15, 145–164 (1999)
Penrose, M.D.: A strong law for the largest nearest neighbor link between random points. J. Lond. Math. Soc. 60, 951–960 (1999)
Penrose, M.D.: Random Geometric Graphs, 2nd edn. Oxford University Press, Oxford (2003)
Yagan, O., Makowski, A.M.: Connectivity in random graphs induced by a key predistribution scheme: small key pools. In: 44th Annual Conference on Information Science System, pp. 1–6 (2010)
Yagan, O., Makowski, A.M.: Connectivity results for random key graphs. In: IEEE international symposium information theory, pp. 2403–2407 (2009)
Yagan, O., Makowski, A.M.: Key ring sizes in the random pairwise key distribution scheme. In: 23rd IEEE international symposium on personal, indoor and mobile radio communications (PIMRC 2011) (2011)
Yagan, O., Makowski, A.M.: On the random graph induced by a random key predistribution scheme under full visibility (extended version). In: Proceeding of IEEE International Symposium on Information Theory (ISIT 2008), pp. 544–548 (2008)
Acknowledgements
Authors would like to thank anonymous referees for their valuable suggestions leading to significant improvement. Moreover, we are grateful to the editor for their patience and cooperation.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gupta, B., Pandey, J. Resilient and secure wireless sensor network under non-full visibility. CCF Trans. Netw. 3, 81–92 (2020). https://doi.org/10.1007/s42045-019-00027-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s42045-019-00027-5