IEEE INFOCOM 2008 - The 27th Conference on Computer Communications 2008
DOI: 10.1109/infocom.2008.83
|View full text |Cite
|
Sign up to set email alerts
|

How Many Packets Can We Encode? - An Analysis of Practical Wireless Network Coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
44
0
2

Year Published

2009
2009
2016
2016

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 132 publications
(46 citation statements)
references
References 9 publications
0
44
0
2
Order By: Relevance
“…A formal analysis on the performance of COPE is provided in [17]. The authors use the encoding number as the performance measure.…”
Section: Inter-session Network Codingmentioning
confidence: 99%
“…A formal analysis on the performance of COPE is provided in [17]. The authors use the encoding number as the performance measure.…”
Section: Inter-session Network Codingmentioning
confidence: 99%
“…Researchers have tried to model and analyze COPE [8], [9], [10]. Some others proposed new coded wireless systems, based on the idea of COPE [11], [7].…”
Section: Related Workmentioning
confidence: 99%
“…In [9], it is shown that pairwise intersession network coding can improve the throughput of routingbased solutions, regardless of whether perfect scheduling is used. Le et al [10] derived a tighter upper bound on the throughput gain for a general wireless network based on the encoding number, i.e, the number of packets that can be encoded by a coding node in each transmission. For a single coding structure with n flows, the maximum throughput gain for both the coded and non-coded flows is upper bounded by 2n/(n + 1).…”
Section: Related Workmentioning
confidence: 99%
“…Lemma 3.1 was first proven in [10]. Lemma 3.2: Let m denotes the minimum rate and M the maximum rate.…”
Section: A One Coding Structurementioning
confidence: 99%
See 1 more Smart Citation