Abstract
The problem of finding the route with maximum end-to-end spectral efficiency in a multihop wireless network has been subject to considerable interest in the recent literature. It has been established that the problem is polynomially solvable in networks that employ time division multiple access (TDMA) or frequency division multiple access (FDMA). The main characteristic of TDMA and FDMA is being interference-free. Motivated by the advances in full-duplex (FD) communications and self-interference (SI) cancelation, this paper considers the problem for interference-limited wireless networks, in which nodes can send and receive at the same time and using the same frequency, but all links may interfere with each other. The contribution of this paper is three-fold. We formulate the problem as a mixed integer non-linear programming problem, and provide two equivalent re-formulations that provide more insight into the problem structure. Moreover, to the best of our knowledge for the first time, we provide a formal proof that the problem is NP-complete in the interference-limited case. Our proof uses reduction from a more general link scheduling problem subject to signal-to-interference-plus-noise-ratio (SINR) constraints. Finally, using an algorithm based on searching over paths while pruning the allowed number of hops, we provide a detailed numerical study that illustrates the tradeoffs between interference-limited FD relaying and TDMA half-duplex (HD) relaying. Our results indicate that sub-optimal interference-limited FD relaying leads to up to 2.69 times higher spectral efficiencies as compared to optimal TDMA HD relaying. Moreover, the lower the signal-to-noise ratio (SNR) regime, the larger the network size and/or the higher the SI capabilities, the higher the spectral efficiency gain due to FD (over HD) relaying.
Highlights
Multihop wireless networks consist of a set of wireless devices that communicate with each other over multiple wireless hops, with participating nodes collaboratively relaying ongoing traffic
Using an algorithm based on searching over paths while pruning the allowed number of hops, we provide a detailed numerical study that illustrates the tradeoffs between interference-limited FD relaying and time division multiple access (TDMA) HD relaying
When the network signal-to-noise ratio (SNR) is 40 dB, the spectral efficiency achieved with interference-limited FD relaying was 2.69 times that achieved with HD TDMA relaying, and 29 times that achieved with direct link routing
Summary
Multihop wireless networks consist of a set of wireless devices that communicate with each other over multiple wireless hops, with participating nodes collaboratively relaying ongoing traffic. Since the channel bandwidth is a limited resource, this paper addresses the problem of finding the communication route with maximum end-to-end spectral efficiency. The problem of finding the source-destination routing path with maximum end-end-spectral efficiency in wireless networks that employ time division multiple access (TDMA) has been subject to considerable interest in the literature [8]–[11]. The study in [20] addresses the problem of joint routing and power allocation in FD wireless network under a full interference model, in which all links interfere with each other. Given an interference-limited multihop wireless network with FD capabilities, we formulate the problem of finding the source-destination routing path with maximum spectral efficiency as a mixed integer non-linear programming problem.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
