% Encoding: UTF-8
@COMMENT{BibTeX export based on data in FAU CRIS: https://cris.fau.de/}
@COMMENT{For any questions please write to cris-support@fau.de}
@inproceedings{faucris.121926244,
abstract = {We address the problem of maximizing the transport capacity of a wireless network, defined as the sum, over all transmitters, of the products of the transmission rate with a reward r(x), which is a function of the distance x separating the transmitter and its receiver. When r(x) = x, this product is measured in bps × meters, and is the natural measure of the usefulness of a transmission in a multihop wireless ad hoc network. We first consider a single transmitter-receiver pair, and determine the optimal distance between the two that maximizes the rate-reward product, for reward functions of the form r(x) = x and when the signal power decays with distance according to a power law. We then calculate the scheme that maximizes the transport capacity in a multiple access network consisting of a single receiver and a number of transmitters, each placed at a fixed distance from the receiver, and each with a fixed power constraint. We conclude by showing that when the per-transmitter power constraints are substituted with a single constraint on the sum of the powers, the maximum transport capacity and the power allocation scheme that achieves it can be found by solving a convex optimization problem. © 2004 IEEE.},
author = {Müller, Ralf and et al.},
author_hint = {Toumpis S., Müller R., Sayir J.},
booktitle = {2004 International Workshop on Wireless Ad-Hoc Networks},
faupublication = {no},
isbn = {0780382757},
pages = {191-195},
peerreviewed = {unknown},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{On} the transport capacity of a multiple access {Gaussian} channel},
url = {https://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=28244459664&origin=inward},
venue = {Oulu},
year = {2005}
}