Network coded data communication
AssigneeTelefonaktiebolaget LM Ericsson (publ)
InventorsSlimane Ben Slimane, Jawad Manssour, Afif Osseiran
Life of this patent
Estimating the term…
Abstract
A data communication involves selecting a group (15) of M multiple source nodes (12, 16) among N multiple source nodes (10, 12, 14, 16) present in a communication system (1) and having data destined for a destination node (30), where 2≦M<N. A relay node (20) network codes data from the selected group (15) of M nodes (12, 16) to form combined, network coded data. This resulting data is sent to towards the destination node (30). The purposeful selection of source nodes (10, 12, 14, 16) in connection with network coding substantially increases the throughput of the communication system (1).
Claims15
A data communication method in a communication system comprising N multiple source nodes each having data destined for a destination node, said method comprising:
- defining a node number M where 2≦M<N;
- selecting a group of M multiple source nodes among said N multiple source nodes;
- network coding, at a relay node of said communication system, the data from said group of M multiple source nodes to form network coded data;
- and
- transmitting said network coded data from said relay node to said destination node;
- wherein said defining comprises defining said group number M to be equal to two;
- wherein said selecting comprises:
- calculating, for each pair S(m,n) of source nodes among said N multiple source nodes, a sum capacity C(S(m,n)) of said communication system defined by:
- C(S(m,n))=log(1+max(Γm,Γn))+log(1+ΓR+min(Γm,Γn))
- where Γm is a communication quality parameter associated with a first source node of said pair of source nodes, Γn is a communication quality parameter associated with a second source node of said pair of source nodes and ΓR is a communication quality parameter associated with said relay node;
- and
- selecting the pair S* of source nodes that maximizes said sum capacity:
- S
- *
- =
- arg
-
-
- max
-
-
- C
-
- (
- S
-
- (
- m
- ,
- n
- )
- )
-
- S
-
- (
- m
- ,
- n
- )
- ∈
- S
- where S is a set of all possible pairs of source nodes among said N multiple source nodes.
A network coding control system comprising:
- an identifier provider for providing N identifiers of N multiple source nodes, each having data destined for a destination node in a communication system;
- a source selector for selecting a group of a predefined or determined group number M of multiple source nodes among said N multiple source nodes, where M=2, and N>2;
- an identifier forwarder for forwarding M identifiers of said group of M multiple source nodes to a relay node for coding, using said selected M identifiers, the data from said group of M multiple source nodes to form network coded data to be transmitted to said destination node;
- and
- a calculator for calculating for each pair S(m,n) of source nodes among said N multiple source nodes a sum capacity C(S(m,n)) of said communication system defined by:
- C(S(m,n))=log(1+max(Γm,Γn))+log(1+ΓR+min(Γm,Γn))
- where Γm is a communication quality parameter associated with a first source node of said pair of source nodes, Γn is a communication quality parameter associated with a second source node of said pair of source nodes and ΓR is a communication quality parameter associated with said relay node, wherein said source selector is arranged for selecting the pair S* of source nodes that maximizes said sum capacity:
- S
- *
- =
- arg
-
-
- max
-
-
- C
-
- (
- S
-
- (
- m
- ,
- n
- )
- )
-
- S
-
- (
- m
- ,
- n
- )
- ∈
- S
- where S is a set of all possible pairs of source nodes among said N multiple source nodes.
Dependencies are inferred from the claim text.