作者: Randy Cogill , Brooke Shrader
关键词:
摘要: In this work we analyze the average queue backlog for transmission of a single multicast flow consisting M destination nodes in wireless network. model consider, channel between every pair is an independent identically distributed packet erasure channel. We first develop lower bound on achievable by any strategy; single-hop transmission, our indicates that size must scale as at least Ω(ln(M)). Next, generalize result to multihop network and obtain it relates minimum-cut capacity then strategy which random linear coding performed over groups packets source node multicast. upper packet-coding show scales O(ln(M)). Our results demonstrate terms multicast, order-optimal with respect number receivers.