The throughput order of ad hoc networks employing network coding and broadcasting

Abstract — Gupta and Kumar established that the per node throughput of ad hoc networks with multi-pair unicast traffic scales ¤¦¥¨§�©� � ��¥����� � §�������§� © as, thus indicating that network performance does not scale well with an increasing number of nodes. However, the model of Gupta and Kumar did not allow for the possibility of network coding and broadcasting, and recent work has suggested that such techniques have the potential to greatly improve network throughput. Here, for multiple unicast flows in a random topology under the protocol communication model of Gupta and Kumar [1], we show that for arbitrary network coding and broadcasting in a two-dimensional random topology that the throughput scales ¤¦¥¨§�©�����¥�����§���¥¨§�©� © as § where is the total number of nodes ��¥¨§� © and is the transmission radius. ��¥¨§� © When i