Sensor Network Self-Organization Using Random Graphs

Richard R. Brooks

International Journal of Distributed Sensor Networks, 2009, vol. 5, issue 3, 201-208

Abstract: Sensor networks are deployed in, and react with, chaotic environments. Self-organizing peer-to-peer networks have admirable survivability characteristics. This chapter discusses random network formalisms for designing, modeling, and analyzing survivable sensor networks. Techniques are given for determining critical values. Applications in system security and surveillance networks are given.

Keywords: Self-organization; Percolation; Random Graphs; Linear Algebra; Security; Surveillance (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1080/15501320802498307 (text/html)

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:sae:intdis:v:5:y:2009:i:3:p:201-208

DOI: 10.1080/15501320802498307

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().