Network information flow

Ahlswede, Rudolf; Cai, Ning; Li, S.-Y.R.; Yeung, Raymond W.

doi:10.1109/18.850663

Cited by 7,125 publications

(5,926 citation statements)

References 10 publications

Supporting

Mentioning

5,837

Contrasting

Unclassified

Order By: Relevance

“…The example in Fig. 2, a simplification of a network coding example from [4], illustrates this point. Let È be uniformly distributed on´¼ ¼µ and´½ ¼µ, giving À È´ ½ µ ½ and À È´ ¾ µ ¼ .…”

Section: Type a Networkmentioning

confidence: 87%

On the Concavity of Rate Regions for Lossless Source Coding in Networks

Effros

2006

2006 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-For a family of network source coding problems, we prove that the lossless rate region is concave in the distribution of sources. While the proof of concavity is straightforward for the few examples where a single-letter characterization of the lossless source coding region is known, it is more difficult for the vast majority of networks where the lossless source coding region remains unsolved. The class of networks that we investigate includes both solved and unsolved examples. We further conjecture that the same property applies more widely and sketch an avenue for investigating that conjecture.

show abstract

Section: Type a Networkmentioning

confidence: 87%

On the Concavity of Rate Regions for Lossless Source Coding in Networks

Effros

2006

2006 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

“…Let D 0 and D 2 denote the packets to be communicated by the two source nodes, and their packet length in information bits be denoted as |D 0 | and |D 2 |. In the first two steps, it is obvious that so that |D (1) 2 | = |D 0 | and…”

Section: (A)mentioning

confidence: 99%

“…Recently, the concept of network coding [1] has been applied in cooperative networks to further improve the system spectral efficiency. An exemplary scenario is the two-way relaying, proposed by [2]- [8].…”

Section: Introductionmentioning

confidence: 99%

Rate regions of a two-way Gaussian relay channel

Liu

Tao

2009

2009 Fourth International Conference on Communications and Networking in China

View full text Add to dashboard Cite

Abstract-We study two-way communications over a threenode Gaussian relay channel. Several practical relaying strategies are considered, including bitwise XOR-based decode-andforward (DF), superposition-based DF, and amplify-and-forward (AF). For each considered two-way relay scheme, we show that its achievable rate pair is governed by a set of linear inequalities. As a result, we obtain explicit, analytical expressions as well as geometrical shapes of the rate regions for each scheme. Our analytical results provide a convenient and efficient way to evaluate the performance of two-way relaying at any channel conditions. Numerical examples are also presented to demonstrate and compare the rate regions and maximum sumrates of the considered schemes at different relay locations.

show abstract

“…One of the most important challenges in VANET is considerable rates of packet loss and insufficient throughput. Network coding (NC) [1] was introduced with the main aim of increasing the network throughput. Fig.…”

Section: Introductionmentioning

confidence: 99%

Opportunistic XOR-Coding Content Propagation in VANET

Malakooti¹,

Jalooli²,

Jabbarpour³

et al. 2014

IJCEE

View full text Add to dashboard Cite

Abstract-The main difference between typical wireless networks and Vehicular Ad-hoc Networks is mostly about the way traffic is propagated in these types of networks. Unlike conventional wireless networks in VANET connections are established quick and short. Because of these two factors connections in VANET are not as reliable and robust as typical wireless networks. Hence Due to these limitations in VANET and also in order to achieve higher throughput, we are aimed at investigating the adoption of network coding with the existing data propagation and routing methods in Vehicular networks. In order to address the disadvantages, we present an approach called Opportunistic Network Coding-aware Data Dissemination in Wireless Networks (NCODWN). This approach is an enhanced version of COAR. We have managed to improve network throughput and decrease end-to-end delay of the network by implementing a more efficient and reliable mechanism. The simulation results indicate that our approach outperforms COAR in terms of end-to-end delay, percentage of encoded packets, packet delivery and network throughput.Index Terms-Data propagation, network coding, vehicular ad hoc network, wireless. I. INTRODUCTIONThe emergence of wireless networks has made a crucial impact on network communications. Over the last four decades of research were conducted on the different aspects of communication between mobile networks and especially vehicular networks. One of the most important challenges in VANET is considerable rates of packet loss and insufficient throughput. Network coding (NC) [1] was introduced with the main aim of increasing the network throughput. Fig. 1 represents basic concepts of NC. In a wider overview due to nature of wireless networks, they suffer from low throughput and do not scale well in heavy implementations [2] which this problem is inherited by VANET. A. Network Coding and Routing ProtocolsIn order to utilize NC in wireless network in a practical way, one of the most well-known applications is in routing protocols. In other words, NC is applied in routing In order to create a coding-aware routing scheme. Existing NC-aware routing mechanisms in VANET evaluate links only based on possibility and impossibility of coding in nodes.Being aware of Applicable NC scenarios and opportunistic coding among different flows at certain amount of time provides the opportunity to improve the throughput of networks. Thus in order to Improve performance of existing Manuscript received January 9, 2013; revised March 27, 2014 network coding is applied. B. Opportunistic RoutingIn fact opportunistic routing is considerably different from normal routing mechanisms. In conventional routing approaches, the next hop is fixed and is responsible for sending data flows and therefore this kind of routing is not suitable for networks like VANET that their topology is dynamically changing and consequently packet drop probability is high. In contrast in opportunistic routing instead of selection of a fixed next hop, under certain circumstances a se...

show abstract

Network information flow

Cited by 7,125 publications

References 10 publications

On the Concavity of Rate Regions for Lossless Source Coding in Networks

On the Concavity of Rate Regions for Lossless Source Coding in Networks

Rate regions of a two-way Gaussian relay channel

Opportunistic XOR-Coding Content Propagation in VANET

Contact Info

Product

Resources

About