Wireless ad hoc networks with independent node failures of probability q have capacity and delay scaling as Θ(√[n(1-q)/log n]), lower than a failure-free network with the same number of working nodes, requiring at least ε(n,q) n q extra redundant nodes with ε>1, while the capacity-delay tradeoff isO
Toward an internet of battlefield things: A resilience perspective
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
On Capacity and Delay of Wireless Networks with Node Failures
Wireless ad hoc networks with independent node failures of probability q have capacity and delay scaling as Θ(√[n(1-q)/log n]), lower than a failure-free network with the same number of working nodes, requiring at least ε(n,q) n q extra redundant nodes with ε>1, while the capacity-delay tradeoff isO