vix.ing · top · new · best · stats · spec

Maximum Multiflow in Wireless Network Coding

2012/02/14 by Jin-Yi Zhou, Jinyi Zhou, Zhou, Jin-Yi +7 · 1 citation
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Full-Duplex Wireless Communications #Information Theory (cs.IT) #Mobile Ad Hoc Networks #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1202.2963

5 pages, 3 figures, submitted to ISIT 2012

arxiv created 2012/02/14 · openalex publication_date 2012/02/14 · arxiv updated 2012/02/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In a multihop wireless network, wireless interference is crucial to the maximum multiflow (MMF) problem, which studies the maximum throughput between multiple pairs of sources and sinks. In this paper, we observe that network coding could help to decrease the impacts of wireless interference, and propose a framework to study the MMF problem for multihop wireless networks with network coding. Firstly, a network model is set up to describe the new conflict relations modified by network coding. Then, we formulate a linear programming problem to compute the maximum throughput and show its superiority over one in networks without coding. Finally, the MMF problem in wireless network coding is shown to be NP-hard and a polynomial approximation algorithm is proposed.

Cited by

Related