Cross-layer integrated collision free path routing

A method for determining a new connection in a wireless communication network, said method comprising the step of jointly determining, for the purpose of configuring said connection, the values of a set of connection parameters including i) a path defined by a set of links, ii) at least one channel for each link, and iii) at least one physical link parameter, for optimization of the value of a single objective function with respect to said set of connection parameters, wherein said objective function depends on said set of connection parameters,

• wherein said optimization includes a search procedure for finding a least cost Ki to each node i, in a given set, from the source node according to the following optimization algorithm:
• K
• i
• =
• min
• j
• ∈
• N
• ⁡
• (
• i
• )
• ⁢
• {
• min
• m
• ∈
• {
• 1
• ,
• …
• ⁢
• ,
• M
• )
• }
• ⁢
• {
• min
• ψ
• ⁢
• {
• κ
• i
• ⁡
• (
• j
• ,
• m
• ,
• ψ
• )
• +
• K
• ⁡
• (
• j
• )
• }
• }
• }
• KSource ID=constant;
• where i≠Source ID, N(i) is a set of current neighbors of node i that in turn is a set of all nodes Ω in the network, j is a neighbor node belonging to N(i), m is a set of at least one channel in a set of M orthogonal channels in total, ψ is one or a multitude of physical layer parameters, κi (j, m, ψ), also denoted κij (m, ψ), is the cost from node j to node i, and the term K(j), also denoted Kj, is the accumulated cost from the source node to node j, and KSource ID is the initial cost at the source node.

A method for connection admission control in a wireless communication network, said method comprising the steps of:

• performing, for a pending connection, optimization of the value of a single objective function with respect to a set of connection parameters including i) a path having a set of links, ii) at least one channel for each link, and iii) at least one physical link parameter, wherein said objective function depends on said set of connection parameters, and said optimization being subjected to at least one constraint designed to ensure substantially non-colliding communication with respect to the pending connection as well as existing connections,
• wherein said optimization includes a search procedure for finding a least cost Ki to each node i, in a given set, from the source node according to the following optimization algorithm:
• K
• i
• =
• min
• j
• ∈
• N
• ⁡
• (
• i
• )
• ⁢
• {
• min
• m
• ∈
• {
• 1
• ,
• …
• ⁢
• ,
• M
• )
• }
• ⁢
• {
• min
• ψ
• ⁢
• {
• κ
• i
• ⁡
• (
• j
• ,
• m
• ,
• ψ
• )
• +
• K
• ⁡
• (
• j
• )
• }
• }
• }
• KSource ID=constant,
• where i≠Source ID, N(i) is a set of current neighbors of node i that in turn is a set of all nodes Ω in the network, j is a neighbor node belonging to N(i), m is a set of at least one channel in a set of M orthogonal channels in total, ψ is one or a multitude of physical layer parameters, κi (j, m, ψ), also denoted κij (m, ψ), is the cost from node j to node i, and the term K(j), also denoted Kj, is the accumulated cost from the source node to node j, and KSource ID is the initial cost at the source node;
• rejecting said pending connection if no set of connection parameters can be determined without violating said constraint;
• accepting said pending connection if a set of connection parameters can be determined without violating said constraint.

A control system for determining a connection in a wireless communication network, said control system comprising means for jointly determining, for the purpose of configuring said connection, values of a set of connection parameters including i) a path assembled by a set of links, ii) at least one channel for each link, and iii) at least one physical link parameter, for optimization of a single objective function with respect to said set of connection parameters, wherein said objective function depends on said set of connection parameters,

• wherein said optimization includes a search procedure for finding a least cost Ki to each node i, in a given set, from the source node according to the following optimization algorithm:
• K
• i
• =
• min
• j
• ∈
• N
• ⁡
• (
• i
• )
• ⁢
• {
• min
• m
• ∈
• {
• 1
• ,
• …
• ⁢
• ,
• M
• )
• }
• ⁢
• {
• min
• ψ
• ⁢
• {
• κ
• i
• ⁡
• (
• j
• ,
• m
• ,
• ψ
• )
• +
• K
• ⁡
• (
• j
• )
• }
• }
• }
• KSource ID=constant;
• where i≠Source ID, N(i) is a set of current neighbors of node i that in turn is a set of all nodes Ω in the network, j is a neighbor node belonging to N(i), m is a set of at least one channel in a set of M orthogonal channels in total, ψ is one or a multitude of physical layer parameters, κi (j, m, ψ), also denoted κij (m, ψ), is the cost from node j to node i, and the term K(j), also denoted Kj, is the accumulated cost from the source node to node j, and KSource ID is the initial cost at the source node.

A control system for connection set-up in a wireless communication network, said control system comprising:

• means for jointly determining, for the purpose of configuring a connection, values of a set of connection parameters including i) a path assembled by a set of links, ii) at least one channel for each link, and iii) at least one physical link parameter, for optimization of a single objective function with respect to said set of connection parameters, wherein said objective function depends on said set of connection parameters;
• and
• means for establishing said connection based on the determined set of connection parameters, using the determined path for routing, the determined channel(s) for channel allocation and the determined physical link parameter value(s) for physical link adaptation,
• wherein said optimization includes a search procedure for finding a least cost Ki to each node i, in a given set, from the source node according to the following optimization algorithm:
• K
• i
• =
• min
• j
• ∈
• N
• ⁡
• (
• i
• )
• ⁢
• {
• min
• m
• ∈
• {
• 1
• ,
• …
• ⁢
• ,
• M
• )
• }
• ⁢
• {
• min
• ψ
• ⁢
• {
• κ
• i
• ⁡
• (
• j
• ,
• m
• ,
• ψ
• )
• +
• K
• ⁡
• (
• j
• )
• }
• }
• }
• KSource ID=constant;
• where i≠Source ID, N(i) is a set of current neighbors of node i that in turn is a set of all nodes Ω in the network, j is a neighbor node belonging to N(i), m is a set of at least one channel in a set of M orthogonal channels in total, ψ is one or a multitude of physical layer parameters, κi (j, m, ψ), also denoted κij (m, ψ), is the cost from node j to node i, and the term K(j), also denoted Kj, is the accumulated cost from the source node to node j, and KSource ID is the initial cost at the source node.

A control system for connection admission control in a wireless communication network, said control system comprising:

• means for performing, for a pending connection, optimization of the value of a single objective function with respect to a set of variable connection parameters including i) a path assembled by a set of links, ii) at least one channel for each link, and iii) at least one physical link parameter, wherein said objective function depends on said set of connection parameters, and said optimization being subjected to at least one constraint designed to ensure substantially non-colliding communication with respect to said pending connection as well as existing connections,
• wherein said optimization includes a search procedure for finding a least cost Ki to each node i, in a given set, from the source node according to the following optimization algorithm:
• K
• i
• =
• min
• j
• ∈
• N
• ⁡
• (
• i
• )
• ⁢
• {
• min
• m
• ∈
• {
• 1
• ,
• …
• ⁢
• ,
• M
• )
• }
• ⁢
• {
• min
• ψ
• ⁢
• {
• κ
• i
• ⁡
• (
• j
• ,
• m
• ,
• ψ
• )
• +
• K
• ⁡
• (
• j
• )
• }
• }
• }
• KSource ID=constant;
• where i≠Source ID, N(i) is a set of current neighbors of node i that in turn is a set of all nodes Ω in the network, j is a neighbor node belonging to N(i), m is a set of at least one channel in a set of M orthogonal channels in total, ψ is one or a multitude of physical layer parameters, κi (j, m, ψ), also denoted κij (m, ψ), is the cost from node j to node i, and the term K(j), also denoted Kj, is the accumulated cost from the source node to node j, and KSource ID is the initial cost at the source node.
• means for rejecting the pending connection if no set of connection parameters can be determined without violating said constraint;
• means for accepting the pending connection if a set of connection parameters can be determined without violating said constraint.