On secure communication in a sensor network

DOI10.1080/03610926.2012.735330MaRDI QIDQ5172825zbMATH OpenOpenAlexFDO

Authors Bhupendra Gupta

Publication date 5 February 2015

Published in Communications in Statistics: Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610926.2012.735330

zbMATH Keywords

random intersection graphsvertex degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Component evolution in a secure wireless sensor network
• Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks
• How many wireless sensors are needed to guarantee connectivity of a one-dimensional network with random inter-node spacing?
• scientific article; zbMATH DE number 1303134
• A research on connectivity in communication networks

Cites work

• On Random Intersection Graphs: The Subgraph Problem
• Random Geometric Graphs
• The degree of a typical vertex in generalized random intersection graph models
• The vertex degree distribution of random intersection graphs

Cited in

(4)

• Secure sensor networks for perimeter protection.
• Probabilistic analysis on connectivity for sensor grids with unreliable nodes
• Component evolution in a secure wireless sensor network
• How many wireless sensors are needed to guarantee connectivity of a one-dimensional network with random inter-node spacing?

This page was built for publication: On secure communication in a sensor network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5172825)