<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/cs_0611070/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/cs_0611070/feed.xml" rel="self" type="application/rss+xml" /><item><title>Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks — mentioned by keithwinstein</title><link>https://news.ycombinator.com/item?id=22542003</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0611070:22542003</guid><pubDate>Wed, 11 Mar 2020 01:24:49 GMT</pubDate><description>&lt;p&gt;That&amp;#x27;s true in practice with current radios, but it was a beautiful discovery in 2006 that it&amp;#x27;s not true in theory! In a world where radios are perfect and nodes cooperate to do decentralized beamforming, the capacity-per-node of a random mesh network scales as the number of nodes increases. See Ozgur, Leveque, and Tse, &amp;quot;Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks,&amp;quot; IEEE Trans. Info. Theory (2007) (https://arxiv.org/abs/cs/0611070). (Also worth reading: Tim Shepard&amp;#x27;s Ph.D. dissertation from 1995…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0611070/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IT</category></item></channel></rss>
