Description
TL;DR: A pre-Bitcoin distributed-systems study that treats unreliable network links, limited resources, and consensus convergence as one topology-design problem.
About This Document
Soummya Kar and José M. F. Moura model a sensor network as a random graph whose communication links can fail. They establish convergence conditions for average consensus, including a requirement that the mean graph have positive algebraic connectivity. The authors then formulate topology design under communication-cost and budget constraints as a convex optimization problem and use numerical experiments to compare convergence speed and cost.
Why Bitcoin People May Care
This is not a Bitcoin or blockchain paper. It supplies older mathematical context for a problem decentralized ledgers also face: participants must coordinate while links fail and communication is not free. Bitcoin uses different consensus goals and an adversarial economic model, so the value here is comparison, not a claim that sensor averaging explains proof of work.
What You Receive
Purchase reveals the verified preserved PDF location for this document.
Document Details
- Title: Sensor Networks with Random Links: Topology Design for Distributed Consensus
- Author / organization: Soummya Kar and José M. F. Moura
- Year: 2007 preprint
- Language: English
- Document type: Research paper
- Pages: 30
CacheRat provides researched source-location and document-identification information. CacheRat does not claim ownership of the underlying third-party documentation.
