Optimal routing and power allocation for wireless networks with imperfect full-duplex nodes

We study a wireless full-duplex network with imperfect interference cancellation and we solve the routing and power allocation problem for a single source to destination pair. Our interference model includes residual self-interference due to operating in full-duplex. We present a procedure to solve for the optimal power allocation of a given route with individual maximum power constraints for each node. The solution to the problem given a route involves finding polynomial roots of equations associated to the achieved rate at each hop. We then propose a modification to Dijkstra´s algorithm with a priority metric that cannot be decoupled, but is efficiently solved by our procedure for a given route. The algorithm finds the joint route and power allocation that achieve the maximum throughput among all possible routes and power allocations. Through simulations we show that, even with imperfect interference cancellation, operating in full-duplex achieves a higher throughput than half-duplex or direct transmission for moderate maximum transmission power.