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 | IEEE International Symposium on Information Theory - Proceedings |
| Pages | 2889-2893 |
| Number of pages | 5 |
| DOIs | |
| State | Published - 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 |
Other
| Other | 2006 IEEE International Symposium on Information Theory, ISIT 2006 |
|---|---|
| Country | United States |
| City | Seattle, WA |
| Period | 7/9/06 → 7/14/06 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
On the optimal power allocation for broadcasting in dense cooperative networks. / Mergen, Birsen Sirkeci; Scaglione, Anna.
IEEE International Symposium on Information Theory - Proceedings. 2006. p. 2889-2893 4036501.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - On the optimal power allocation for broadcasting in dense cooperative networks
AU - Mergen, Birsen Sirkeci
AU - Scaglione, Anna
PY - 2006
Y1 - 2006
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
SP - 2889
EP - 2893
BT - IEEE International Symposium on Information Theory - Proceedings
ER -