Decentralized and dynamic route selection in cooperative relay networks
First Claim
Patent Images
1. A method for selecting an optimal route in a cooperative relay network including a set of nodes, comprising the steps of:
- determining, at each node in a set of nodes of a cooperative relay network, dynamically varying channel state information; and
selecting dynamically a transmission policy based on the dynamically varying channel state information, in which the transmission policy includes selected nodes forming an optimal route, a transmission mode for each selected node, and a transmission power for each selected node.
1 Assignment
0 Petitions
Accused Products
Abstract
A method selects an optimal route in a cooperative relay network including a set of nodes. For each node in a set of nodes of a cooperative relay network, dynamically varying channel state information is determined. A transmission policy based on the dynamically-varying channel state information is selected, in which the transmission policy includes selected nodes forming an optimal route, a transmission mode for each selected node, and a transmission power for each selected node.
-
Citations
19 Claims
-
1. A method for selecting an optimal route in a cooperative relay network including a set of nodes, comprising the steps of:
-
determining, at each node in a set of nodes of a cooperative relay network, dynamically varying channel state information; and selecting dynamically a transmission policy based on the dynamically varying channel state information, in which the transmission policy includes selected nodes forming an optimal route, a transmission mode for each selected node, and a transmission power for each selected node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A method for selecting an optimal route in a cooperative relay network including a set of nodes, comprising the steps of:
-
representing a set of nodes of a cooperative relay network by a graph, in which an edge in the graph represents a channel between two adjacent nodes; constructing a super-graph from the graph, in which an edge in the super-graph represents a virtual channel between two nodes are separated by at most h hops in the graph; constructing, for each node in the super-graph, a sub-graph of a subset of the nodes that are separated by at most h hops from the node and the edges that connect the nodes; determining for every unique pair of nodes in the sub-graph an optimal sub-route; and selecting the optimal route based on the optimal sub-routes. - View Dependent Claims (18, 19)
-
Specification