Abstract

Given a multihop cellular network with fixed relays, this paper considers the problem of jointly selecting (possibly multiple) routing paths for each communication session and allocating transmit powers and bandwidth across all network links, such that the total network utility (i.e., social welfare) is maximized. This paper focuses on quality of service (QoS-) sensitive applications that are captured by sigmoidal-like utility functions. The non-concavity of the user utility functions, the complex relation between routing decisions and network resource allocation, and the dependence of link capacities on all interfering powers render the problem non-convex, and extremely difficult to solve. However, we present a meta-heuristic based on particle swarm optimization that solves the problem successfully, efficiently and globally.

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.