Article thumbnail
Location of Repository

Bounds on the Gain of Network Coding and Broadcasting in Wireless Networks

By Junning Liu, Dennis Goeckel and Don Towsley

Abstract

Gupta and Kumar established that the per node throughput of ad hoc networks with multi-pair unicast traffic scales with an increasing number of nodes ¤ as ¥§¦¨¤�©�����¦����� � ¤�������¤� © , thus indicating that network performance does not scale well. However, Gupta and Kumar did not consider the possibility of network coding and broadcasting in their model, 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 �� � random topology that the throughput scales as ¥§¦¨¤�©�����¦�����¤���¦�¤�©� © where ¤ is the total number of nodes and ��¦¨¤� © is the transmission radius. When is set to ensure connectivity, ¥§¦¨¤�©�����¦��� � � ¤�������¤� © , which is of the same order as the lower bound for the throughput without network coding and broadcasting; in other words, network coding and broadcasting at most provides a constant factor improvement in the throughput. This result is also extended to other dimensional random deployment topologies, where it is shown ¥§¦¨¤�©�����¦�����¤� © that for �� � the ¥§¦¨¤�©����� ¦ � � topology, networks ¥���¦¨¤�©����� ¦ � � ����

Year: 2007
DOI identifier: 10.1109/infcom.2007.90
OAI identifier: oai:CiteSeerX.psu:10.1.1.120.8216
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.umass.edu/~liujn... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.