Entity

Time filter

Source Type

Jabalpur, India

Gupta B.,IIIT DM Jabalpur | Pandey J.,IIIT DM Jabalpur
Wireless Personal Communications | Year: 2015

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$$C⊂R2. 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$$cnlogn and key ring of size $$c\log \,n$$clogn (of an arbitrary node) and $$c>2$$c>2 there will be no isolated nodes in the network almost surely. © 2015, Springer Science+Business Media New York. Source


Gupta B.,IIIT DM Jabalpur | Lamba S.S.,IIIT DM Jabalpur
IEEE TENSYMP 2014 - 2014 IEEE Region 10 Symposium | Year: 2014

The internodal distance is an important characteristic of ad-hoc wireless networks and sensor networks. Some important properties like propagation delay, like capacity etc. are depending on the internodal distance. In this paper we consider a d-dimensional binomial point process (BPP) having N points distributed uniformly over a compact space S ⊂ Rd. Here we prove that the kth nearest neighbor distance in binomial point process converges weakly to the nth nearest neighbor distance in Poisson point process, which follows a generalize gamma density. © 2014 IEEE. Source


Pandey J.,IIIT DM Jabalpur | Gupta B.,IIIT DM Jabalpur | Lamba S.S.,IIIT DM Jabalpur
IFIP International Conference on Wireless and Optical Communications Networks, WOCN | Year: 2014

In this paper, our work is to focus on the almost sure connectivity properties of secure wireless sensor networks. We consider a wireless sensor network which is generated randomly using random key pre distribution scheme given by Eschenauer and Gligor under non-full visibilitys. Here, we consider a sensor network in 2-dimensional space, and a sequence Xn = {X1, X2,...Xn}, with n sensor nodes distributed uniformly over a compact space C ⊂ ℝ2 We focus on network cut to deal with connectivity issues in WSNs. We have given a strong relationship and derived a threshold for the proportion of key ring and key pool size, above which graph will have no cut in the network almost surely. We prove that if key pool size is n log n and key ring size of an arbitrary node is c log n and if c > 1/s(1-s/n) then there will be no cut in the network. © 2014 IEEE. Source

Discover hidden collaborations