Abstract

We consider a wireless sensor network where a relay helps multiple source-destination pairs. The relay helps communication pairs in a probabilistic manner during several relaying slots. We formulate an optimization problem to find slot-sharing ratio maximizing an upper bound of the expected sum rate while the upper bound of each user's rate satisfying a predetermined target for the given number of relaying slots. An exact optimal value of slot-sharing ratio is provided by using Karush-Kuhn-Tucker (KKT) conditions. And we propose an algorithm to search the optimal number of relaying slots. Numerical results are presented to illustrate the optimal slotsharing ratio and the optimal number of relaying slots.

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.