Reducibility of joint relay positioning and flow optimization problem

Details Reducibility of joint relay positioning and flow optimization problem Reducibility of joint relay positioning and flow optimization problem

2012-02-03

arxiv.org/abs/1202.0835v1

Computer Science

Information Theory

Scientific paper

This paper shows how to reduce the otherwise hard joint relay positioning and flow optimization problem into a sequence a two simpler decoupled problems. We consider a class of wireless multicast hypergraphs mainly characterized by their hyperarc rate functions, that are increasing and convex in power, and decreasing in distance between the transmit node and the farthest end node of the hyperarc. The set-up consists of a single multicast flow session involving a source, multiple destinations and a relay that can be positioned freely. The first problem formulates the relay positioning problem in a purely geometric sense, and once the optimal relay position is obtained the second problem addresses the flow optimization. Furthermore, we present simple and efficient algorithms to solve these problems.

Affiliated with

Also associated with

No associations

Rating

Reducibility of joint relay positioning and flow optimization problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reducibility of joint relay positioning and flow optimization problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reducibility of joint relay positioning and flow optimization problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-329532