Non-existence of Isolated Nodes in Secure Wireless Sensor Network.

Saved in:
Bibliographic Details
Title: Non-existence of Isolated Nodes in Secure Wireless Sensor Network.
Authors: Gupta, Bhupendra1 bhupen@iiitdmj.ac.in, Pandey, Jyoti1 jyoti.pandey@iiitdmj.ac.in
Source: Wireless Personal Communications. Dec2015, Vol. 85 Issue 3, p1367-1380. 14p.
Subjects: Wireless sensor network access control, Telecommunication security, Compact spaces (Topology), Wireless sensor nodes, Distributed computing
Abstract: In this paper, we focus on the non-existence of isolated nodes in secure wireless sensor networks under full visibility condition. Here, we consider a sensor network with n sensor nodes distributed uniformly over a compact space $$C \subset {\mathbb {R}}^2$$ . We establish a threshold for the proportion of key ring and key pool size; above this threshold isolated nodes disappear from the network almost surely. We derive that for key pool of size $$cn\log \,n$$ and key ring of size $$c\log \,n$$ (of an arbitrary node) and $$c>2$$ there will be no isolated nodes in the network almost surely. [ABSTRACT FROM AUTHOR]
Copyright of Wireless Personal Communications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:In this paper, we focus on the non-existence of isolated nodes in secure wireless sensor networks under full visibility condition. Here, we consider a sensor network with n sensor nodes distributed uniformly over a compact space $$C \subset {\mathbb {R}}^2$$ . We establish a threshold for the proportion of key ring and key pool size; above this threshold isolated nodes disappear from the network almost surely. We derive that for key pool of size $$cn\log \,n$$ and key ring of size $$c\log \,n$$ (of an arbitrary node) and $$c>2$$ there will be no isolated nodes in the network almost surely. [ABSTRACT FROM AUTHOR]
ISSN:09296212
DOI:10.1007/s11277-015-2845-9