On Secure Communication in a Sensor Network

Bhupendra Gupta

Communications in Statistics - Theory and Methods, 2014, vol. 43, issue 21, 4642-4649

Abstract: In this article, we determine a strong threshold for the connectivity between any two arbitrary sensors of a sensor network with secure communication. Also, we derive the almost sure probability bounds for the vertex degree of a typical sensor of a sensor network, with secure communication environment.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2012.735330 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:lstaxx:v:43:y:2014:i:21:p:4642-4649

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20

DOI: 10.1080/03610926.2012.735330

Access Statistics for this article

Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe

More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().