Show simple item record

dc.contributor.authorThakur, Mohit
dc.contributor.authorFawaz, Nadia
dc.contributor.authorMedard, Muriel
dc.date.accessioned2012-10-09T14:50:21Z
dc.date.available2012-10-09T14:50:21Z
dc.date.issued2011-06
dc.date.submitted2011-04
dc.identifier.isbn978-1-4244-9919-9
dc.identifier.issn0743-166X
dc.identifier.urihttp://hdl.handle.net/1721.1/73675
dc.description14 Jan 2011en_US
dc.description.abstractWe consider the broadcast relay channel (BRC), where a single source transmits to multiple destinations with the help of a relay, in the limit of a large bandwidth. We address the problem of optimal relay positioning and power allocations at source and relay, to maximize the multicast rate from source to all destinations. To solve such a network planning problem, we develop a three-faceted approach based on an underlying information theoretic model, computational geometric aspects, and network optimization tools. Firstly, assuming superposition coding and frequency division between the source and the relay, the information theoretic framework yields a hypergraph model of the wideband BRC, which captures the dependency of achievable rate-tuples on the network topology. As the relay position varies, so does the set of hyperarcs constituting the hypergraph, rendering the combinatorial nature of optimization problem. We show that the convex hull C of all nodes in the 2-D plane can be divided into disjoint regions corresponding to distinct hyperarcs sets. These sets are obtained by superimposing all k-th order Voronoi tessellation of C. We propose an easy and efficient algorithm to compute all hyperarc sets, and prove they are polynomially bounded. Then, we circumvent the combinatorial nature of the problem by introducing continuous switch functions, that allows adapting the network hypergraph in a continuous manner. Using this switched hypergraph approach, we model the original problem as a continuous yet non-convex network optimization program. Ultimately, availing on the techniques of geometric programming and p-norm surrogate approximation, we derive a good convex approximation. We provide a detailed characterization of the problem for collinearly located destinations, and then give a generalization for arbitrarily located destinations. Finally, we show strong gains for the optimal relay positioning compared to seemingly interesting positions.en_US
dc.description.sponsorshipUnited States. Defense Advanced Research Projects Agency. Information Theory for Mobile Ad-Hoc Networks Program (6915101)en_US
dc.description.sponsorshipStanford University (Subcontract 18870740-37362-C)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/INFCOM.2011.5935119en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourcearXiven_US
dc.titleOptimal relay location and power allocation for low SNR broadcast relay channelsen_US
dc.typeArticleen_US
dc.identifier.citationThakur, Mohit, Nadia Fawaz, and Muriel Medard. “Optimal Relay Location and Power Allocation for Low SNR Broadcast Relay Channels.” 2011 Proceedings IEEE, INFOCOM. 2822–2830.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Research Laboratory of Electronicsen_US
dc.contributor.mitauthorFawaz, Nadia
dc.contributor.mitauthorMedard, Muriel
dc.relation.journalProceedings of the IEEE INFOCOM, 2011en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsThakur, Mohit; Fawaz, Nadia; Medard, Murielen
dc.identifier.orcidhttps://orcid.org/0000-0003-4059-407X
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record