A key management scheme in distributed sensor networks using attack probabilities

@article{Chan2005AKM,
  title={A key management scheme in distributed sensor networks using attack probabilities},
  author={Siu-Ping Chan and Radha Poovendran and Ming-Ting Sun},
  journal={GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.},
  year={2005},
  volume={2},
  pages={5 pp.-}
}
Clustering approaches have been found useful in providing scalable data aggregation, security and coding for large scale distributed sensor networks (DSNs). Clustering (also known as subgrouping) has also been effective in containing and compartmentalizing node compromise in large scale networks. We consider the problem of designing a clustered DSN when the probability of node compromise in different deployment regions is known a priori. We make use of the a priori probability to design a… CONTINUE READING
Highly Cited
This paper has 44 citations. REVIEW CITATIONS
30 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

The Strange Logic of Random Graphs, Algorithms and Combinatorics 22

  • J. Spencer
  • Springer-Verlag, 2000, ISBN 3-540-41654-4.
  • 2000
Highly Influential
3 Excerpts

Pairwise Keys in Distributed Sensor Networks,

  • D. Liu, P. Ning, “Establishing
  • Proceedings of the 10th ACM Conference on…
  • 2003
1 Excerpt

Matt,“Constraints and Approaches for Distributed Sensor Network Security,

  • D. W. Carman, B.J.P.S. Kruus
  • Sept 1,
  • 2000
3 Excerpts

Similar Papers

Loading similar papers…