Abstract
In this paper, we identify a novel problem Trajectory-Based Relay Deployment (TBRD) which aims at maximizing user connection time as the users roam through the target area while complying with relay resource constraints. To solve the TBRD, we first propose the concept Demand Nodes (DNs). Next, we design a Demand Node Generation (DNG) algorithm that transforms the continuous historical user trajectory into a number of discrete DNs. By generating DNs, we convert the TBRD problem into a Demand Node Coverage (DNC) problem, which is NP-complete. After that, we design an approximation algorithm, named Submodular Iterative Deployment Algorithm (SIDA), to solve the DNC problem with the approximation factor \(1-\frac{1}{\sqrt{e\cdot (1-1/k)}}\). The simulation on five real datasets shows that our algorithm can obtain high coverage for users in motion, leading to better user experience.
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.
