Bounds on the Network Coding Capacity for Wireless Random Networks

Aly, Salah A.; Kapoor, Vishal; Meng, Jie; Klappenecker, Andreas

doi:10.1109/ita.2007.4357585

Cited by 22 publications

(51 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the case of a single multicast session, such an improvement is bounded by a factor of two. Meanwhile, the authors of [12], [13], and [14] studied the throughput capacity of NC in wireless ad hoc networks. However, the authors of [12], [13], and [14] employ network models that are fundamentally inconsistent with the more commonly accepted assumptions of ad-hoc networks [1].…”

Section: Literature Reviewsmentioning

confidence: 99%

“…Meanwhile, the authors of [12], [13], and [14] studied the throughput capacity of NC in wireless ad hoc networks. However, the authors of [12], [13], and [14] employ network models that are fundamentally inconsistent with the more commonly accepted assumptions of ad-hoc networks [1]. Specifically, the model constraints of [12]- [14], [19], and [20] differ as follows: All the prior works assume a single source for unicast, multicast, or even broadcast.…”

Section: Literature Reviewsmentioning

confidence: 99%

“…Specifically, the model constraints of [12]- [14], [19], and [20] differ as follows: All the prior works assume a single source for unicast, multicast, or even broadcast. Aly et al [13] and Kong et al [14] differentiate the total nodes into source set, relay set and destination set. They do not allow all of the nodes to concurrently serve as sources, relays or destinations, as allowed in the work by Gupta and Kumar [1].…”

Section: Literature Reviewsmentioning

confidence: 99%

“…Specifically, If sources, relays and destinations are strictly different, the authors of [13] use max-flow min-cut of network coding. But if they are not, it will make the problem much harder to solve.…”

Section: Literature Reviewsmentioning

confidence: 99%

“…Is NC necessary or does the combination of MPT and MPR suffice? It is important to note that combination of NC with MPT and MPR has been considered in literature [12], [13], and [14] without explicitly using these terms and it is therefore important to investigate the above questions.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

On the multicast capacity of wireless ad hoc networks with network coding

et al. 2011

View full text Add to dashboard Cite

Abstract:In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multi-packet transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity of Θ(nT 3 (n)) can be achieved as a tight bound when each session contains a constant number of sinks where n is the total number of nodes and T (n) is the transmission range 1 . Surprisingly, an identical order capacity can be achieved when nodes have only MPR and MPT capabilities. This result proves that NC does not contribute to the order capacity of multicast traffic in wireless ad hoc networks when MPR and MPT are used in the network. The result is in sharp contrast to the general belief (conjecture) that NC improves the order capacity of multicast. Furthermore, if the communication range is selected to guarantee the connectivity in the network, i.e., Ω( log n/n) = T (n) = O(log log n/ log n), then the combination of MPR and MPT achieves a throughput capacity of Θ(log 3 2 n/ √ n) which provides an order capacity gain of Θ(log 2 n) compared to the pointto-point multicast capacity with the same number of destinations.

show abstract

Section: Literature Reviewsmentioning

confidence: 99%

Section: Literature Reviewsmentioning

confidence: 99%

Section: Literature Reviewsmentioning

confidence: 99%

Section: Literature Reviewsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On the multicast capacity of wireless ad hoc networks with network coding

et al. 2011

View full text Add to dashboard Cite

show abstract

Network protection codes: Providing self-healing in autonomic networks using network coding

Aly¹,

Kamal²,

Al-Kofahi³

2012

Computer Networks

Self Cite

View full text Add to dashboard Cite

Agile recovery from link failures in autonomic communication networks is essential to increase robustness, accessibility, and reliability of data transmission. However, this must be done with the least amount of protection resources, while using simple management plane functionality. Recently, network coding has been proposed as a solution to provide agile and cost efficient network self-healing against link failures, in a manner that does not require data rerouting, packet retransmission, or failure localization, hence leading to simple control and management planes. To achieve this, separate paths have to be provisioned to carry encoded packets, hence requiring either the addition of extra links, or reserving some of the resources for this purpose.In this paper we introduce autonomic self-healing strategies for autonomic networks in order to protect against link failures. The strategies are based on network coding and reduced capacity, which is a technique that we call network protection codes (NPC). In these strategies, an autonomic network is able to provide self-healing from various network failures affecting network operation. The techniques improve service and enhance reliability of autonomic communication.Network protection codes are extended to provide self-healing from multiple link failures in autonomic networks. Although this leads to reducing the network capacity, the network capacity reduction is asymptotically small in most cases of practical interest. We provide implementation aspects of the proposed strategies. We present bounds and network protection code constructions. Furthermore tables of the best known self-healing codes are presented. Finally, we study the construction of such codes over the binary field. The paper also develops an Integer Linear Program formulation to evaluate the cost of provisioning connections using the proposed strategies, and uses results from this formulation to show that it is more resource efficient from 1+1 protection.

show abstract

Capacity scaling laws of information dissemination modalities in wireless ad hoc networks

Wang

Sadjadpour

Garcia-Luna-Aceves

2008

2008 46th Annual Allerton Conference on Communication, Control, and Computing

View full text Add to dashboard Cite

Abstract-We present capacity scaling laws for random wireless ad hoc networks under all information dissemination modalities (unicast, multicast, broadcast, anycast) when nodes are endowed with multi-packet transmission (MPT) or multi-packet reception (MPR) capabilities. Information dissemination modalities are modeled with an (n, m, k)-cast formulation, where n, m, and k denote the number of nodes in the network, the number of destinations for each communication group, and the actual number of communication group members that receive information (i. e., k ≤ m ≤ n), respectively. We show that Θ (T (n) √ m/k), Θ (1/k), and Θ T 2 (n) bits per second constitute a tight bound for the throughput capacity of random wireless ad hoc networks under the protocol modelrespectively. This result applies to both MPR and MPT, where T (n) denotes the transceiver range, which depends on the encoding or decoding complexity of the nodes. For the minimum transceiver range of Θ log n/n to guarantee network connectivity, a gain of Θ(log n) for (n, m, k)-casting is attained with either MPT or MPR compared to the capacity attained when transmitters and receivers can encode and decode at most one transmission at a time (i.e., point-topoint communication).

show abstract

Bounds on the Network Coding Capacity for Wireless Random Networks

Cited by 22 publications

References 15 publications

On the multicast capacity of wireless ad hoc networks with network coding

On the multicast capacity of wireless ad hoc networks with network coding

Network protection codes: Providing self-healing in autonomic networks using network coding

Capacity scaling laws of information dissemination modalities in wireless ad hoc networks

Contact Info

Product

Resources

About