2013/03/28 by Soung Chang Liew, Feng, Shen, Liew, Soung C.
Computer Science · Engineering · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Full-Duplex Wireless Communications #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI)
paper · pdf · doi:10.48550/arxiv.1303.7054
openalex publication_date 2013/03/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This work investigates the maximum broadcast throughput and its achievability in multi-hop wireless networks with half-duplex node constraint. We allow the use of physical-layer network coding (PNC). Although the use of PNC for unicast has been extensively studied, there has been little prior work on PNC for broadcast. Our specific results are as follows: 1) For single-source broadcast, the theoretical throughput upper bound is n/(n+1), where n is the "min vertex-cut" size of the network. 2) In general, the throughput upper bound is not always achievable. 3) For grid and many other networks, the throughput upper bound n/(n+1) is achievable. Our work can be considered as an attempt to understand the relationship between max-flow and min-cut in half-duplex broadcast networks with cycles (there has been prior work on networks with cycles, but not half-duplex broadcast networks).