TY - GEN

T1 - Broadcast throughput in radio networks

T2 - 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014

AU - Alon, Noga

AU - Ghaffari, Mohsen

AU - Haeupler, Bernhard

AU - Khabbazian, Majid

PY - 2014/1/1

Y1 - 2014/1/1

N2 - The broadcast throughput in a network is defined as the average number of messages that can be transmitted per unit time from a given source to all other nodes when time goes to infinity. Classical broadcast algorithms treat messages as atomic tokens and route them from the source to the receivers by making intermediate nodes store and forward messages. The more recent network coding approach, in contrast, prompts intermediate nodes to mix and code together messages. It has been shown that certain wired networks have an asymptotic network coding gap, that is, they have asymptotically higher broadcast throughput when using network coding compared to routing. Whether such a gap exists for wireless networks has been an open question of great interest. We approach this question by studying the broadcast throughput of the radio network model which has been a standard mathematical model to study wireless communication. We show that there is a family of radio networks with a tight Θ(log log n) network coding gap, that is, networks in which the asymptotic throughput achievable via routing messages is a Θ (log log n) factor smaller than that of the optimal network coding algorithm. We also provide new tight upper and lower bounds showing that the asymptotic worst-case broadcast throughput over all networks with n nodes is Θ(1/log n)messages-per- round for both routing and network coding.

AB - The broadcast throughput in a network is defined as the average number of messages that can be transmitted per unit time from a given source to all other nodes when time goes to infinity. Classical broadcast algorithms treat messages as atomic tokens and route them from the source to the receivers by making intermediate nodes store and forward messages. The more recent network coding approach, in contrast, prompts intermediate nodes to mix and code together messages. It has been shown that certain wired networks have an asymptotic network coding gap, that is, they have asymptotically higher broadcast throughput when using network coding compared to routing. Whether such a gap exists for wireless networks has been an open question of great interest. We approach this question by studying the broadcast throughput of the radio network model which has been a standard mathematical model to study wireless communication. We show that there is a family of radio networks with a tight Θ(log log n) network coding gap, that is, networks in which the asymptotic throughput achievable via routing messages is a Θ (log log n) factor smaller than that of the optimal network coding algorithm. We also provide new tight upper and lower bounds showing that the asymptotic worst-case broadcast throughput over all networks with n nodes is Θ(1/log n)messages-per- round for both routing and network coding.

UR - http://www.scopus.com/inward/record.url?scp=84902106695&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902106695&partnerID=8YFLogxK

U2 - 10.1137/1.9781611973402.132

DO - 10.1137/1.9781611973402.132

M3 - Conference contribution

AN - SCOPUS:84902106695

SN - 9781611973389

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 1831

EP - 1843

BT - Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014

PB - Association for Computing Machinery

Y2 - 5 January 2014 through 7 January 2014

ER -