2012/10/11 by Vasuki Narasimha Swamy, Swamy, Vasuki Narasimha, Srikrishna Bhashyam +5
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Security in Wireless Sensor Networks #Wireless Communication Security Techniques #cs.IT #cs.NI #math.IT
paper · pdf · doi:10.48550/arxiv.1210.3187
13 pages, extended version of paper presented at the IEEE International Symposium on Information Theory (ISIT) 2012, minor revision to text to address review comments, to appear in IEEE Transactions in information theory
openalex publication_date 2012/10/11 · arxiv created 2013/02/08 · arxiv updated 2013/02/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider allcast and multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes are connected by undirected links whose capacities are independent and identically distributed random variables. We study the asymptotics of the capacity region (with network coding) in the limit of a large number of nodes, and show that the normalized sum rate converges to a constant almost surely. We then provide a decentralized push-pull algorithm that asymptotically achieves this normalized sum rate without network coding.