Abstract
The goal of this work is to find appropriate link scheduling schemes to achieve satisfactory end-to-end throughput in wireless multi-hop networks. The algorithm of finding the best path status bitmap is proposed to solve the throughput problem. By analyzing path status, it is found that compressing the path state set can reduce the time complexity. According to this, we describe innovative methods to simplify scheduling of links for long path with large amount of data. Two typical link scheduling schemes with full-duplex radios are proposed, and end-to-end throughput boundary is worked out by analyzing the link capacity and the link active ratio in each scheme. Results illustrate that these schemes may improve end-to-end throughput in wireless multi-hop networks modestly.
Highlights
Topic of wireless network capacity has been extensively explored
One of our main contributions is that we reduce the path statuses by removing replaceable ones on long multi-hop path (LMP) when solving the link scheduling problem of EEToLMP
We regard EEToLMP as an optimization problem, whose objective is to maximize the minimum throughput on LMP subject to above constraints, including (1) and (2) due to scheduling method, (3) and (4) due to inter-link interference, routing constraint (5), link capacity constraints (6) and (7)
Summary
Topic of wireless network capacity has been extensively explored. The investigations [1], [2] provide basic knowledge about the capacity of fixed or mobile nodes distributed in an area. The nodes in relay networks combined with FD radios provide throughput gain [37]–[41]. FD radio improves the capacity on point-to-point link, as well as in relay networks. The radio overlapping of neighboring nodes on LMP brings serious inter-link interferences, which limits data transmission of neighboring nodes. The situation of minimizing inter-link interferences is that only one node sends data in the network. This makes link active ratio (LAR) on LMP lower, which brings lower EET.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
