On the optimal power allocation for broadcasting in dense cooperative networks

Birsen Sirkeci Mergen; Anna Scaglione

doi:10.1109/ISIT.2006.261668

On the optimal power allocation for broadcasting in dense cooperative networks

Birsen Sirkeci Mergen, Anna Scaglione

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Scopus citations

Abstract

We study the optimal power allocation problem for cooperative broadcast in dense large-scale networks. In our setup, a single source initiates the transmission and the nodes that receive the message with sufficient signal-to-noise ratio (SNR) retransmit. The goal is to design the transmission order (schedule) and the transmission powers of the relays so that the message reaches to the entire network with the minimum possible power expenditure. In general, finding the best scheduling in cooperative broadcast is known to be NP-complete. In this paper, we show that the optimal scheduling is easily resolved for certain network topologies and channel models. Furthermore, we approximate dense large-scale networks with a continuum of nodes and provide optimal power density for the continuum network under pathloss attenuation.

Original language	English (US)
Title of host publication	Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages	2889-2893
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2006.261668
State	Published - Dec 1 2006
Externally published	Yes
Event	2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States Duration: Jul 9 2006 → Jul 14 2006

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8101

Other

Other	2006 IEEE International Symposium on Information Theory, ISIT 2006
Country	United States
City	Seattle, WA
Period	7/9/06 → 7/14/06

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2006.261668

Fingerprint Dive into the research topics of 'On the optimal power allocation for broadcasting in dense cooperative networks'. Together they form a unique fingerprint.

Cite this

Mergen, B. S., & Scaglione, A. (2006). On the optimal power allocation for broadcasting in dense cooperative networks. In Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006 (pp. 2889-2893). [4036501] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2006.261668

On the optimal power allocation for broadcasting in dense cooperative networks. / Mergen, Birsen Sirkeci; Scaglione, Anna.

Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. 2006. p. 2889-2893 4036501 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Mergen, BS & Scaglione, A 2006, On the optimal power allocation for broadcasting in dense cooperative networks. in Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006., 4036501, IEEE International Symposium on Information Theory - Proceedings, pp. 2889-2893, 2006 IEEE International Symposium on Information Theory, ISIT 2006, Seattle, WA, United States, 7/9/06. https://doi.org/10.1109/ISIT.2006.261668

@inproceedings{0b5ef078f520476c8ed641962a1e5232,

title = "On the optimal power allocation for broadcasting in dense cooperative networks",

abstract = "We study the optimal power allocation problem for cooperative broadcast in dense large-scale networks. In our setup, a single source initiates the transmission and the nodes that receive the message with sufficient signal-to-noise ratio (SNR) retransmit. The goal is to design the transmission order (schedule) and the transmission powers of the relays so that the message reaches to the entire network with the minimum possible power expenditure. In general, finding the best scheduling in cooperative broadcast is known to be NP-complete. In this paper, we show that the optimal scheduling is easily resolved for certain network topologies and channel models. Furthermore, we approximate dense large-scale networks with a continuum of nodes and provide optimal power density for the continuum network under pathloss attenuation.",

author = "Mergen, {Birsen Sirkeci} and Anna Scaglione",

year = "2006",

month = dec,

day = "1",

doi = "10.1109/ISIT.2006.261668",

language = "English (US)",

isbn = "1424405041",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2889--2893",

booktitle = "Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006",

note = "2006 IEEE International Symposium on Information Theory, ISIT 2006 ; Conference date: 09-07-2006 Through 14-07-2006",

}

TY - GEN

T1 - On the optimal power allocation for broadcasting in dense cooperative networks

AU - Mergen, Birsen Sirkeci

AU - Scaglione, Anna

PY - 2006/12/1

Y1 - 2006/12/1

N2 - We study the optimal power allocation problem for cooperative broadcast in dense large-scale networks. In our setup, a single source initiates the transmission and the nodes that receive the message with sufficient signal-to-noise ratio (SNR) retransmit. The goal is to design the transmission order (schedule) and the transmission powers of the relays so that the message reaches to the entire network with the minimum possible power expenditure. In general, finding the best scheduling in cooperative broadcast is known to be NP-complete. In this paper, we show that the optimal scheduling is easily resolved for certain network topologies and channel models. Furthermore, we approximate dense large-scale networks with a continuum of nodes and provide optimal power density for the continuum network under pathloss attenuation.

AB - We study the optimal power allocation problem for cooperative broadcast in dense large-scale networks. In our setup, a single source initiates the transmission and the nodes that receive the message with sufficient signal-to-noise ratio (SNR) retransmit. The goal is to design the transmission order (schedule) and the transmission powers of the relays so that the message reaches to the entire network with the minimum possible power expenditure. In general, finding the best scheduling in cooperative broadcast is known to be NP-complete. In this paper, we show that the optimal scheduling is easily resolved for certain network topologies and channel models. Furthermore, we approximate dense large-scale networks with a continuum of nodes and provide optimal power density for the continuum network under pathloss attenuation.

UR - http://www.scopus.com/inward/record.url?scp=33847720658&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847720658&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2006.261668

DO - 10.1109/ISIT.2006.261668

M3 - Conference contribution

AN - SCOPUS:33847720658

SN - 1424405041

SN - 9781424405046

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2889

EP - 2893

BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006

T2 - 2006 IEEE International Symposium on Information Theory, ISIT 2006

Y2 - 9 July 2006 through 14 July 2006

ER -