Abstract

We consider the joint problem of relay-aware TDMA scheduling and optimal placement of relays to improve transmission reliability under deadline constraints. We build on existing algorithms for TDMA scheduling. We propose an iterative placement and scheduling algorithm and compare its performance (in terms of the average number of packets not successfully transmitted before their deadline) against two baseline algorithms, one using random relay placement, and another algorithm giving the truly optimal relay positions and schedule on a grid. Our results show that the iterative placement algorithm is substantially better than random placement. Furthermore, we have applied the truly optimal scheduling and placement algorithm to a simple scenario with one relay and found that the iterative placement algorithm gives almost the same performance.

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

Disclaimer: 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.