DMCA
Performance of repetition codes and punctured codes for accumulative broadcast (2003)
Cached
Download Links
| Venue: | in Proc. Modeling Optimization in Mobile, Ad Hoc Wireless Networks Workshop (WiOpt’03 |
| Citations: | 3 - 1 self |
BibTeX
@INPROCEEDINGS{Maric03performanceof,
author = {Ivana Maric and Roy Yates},
title = {Performance of repetition codes and punctured codes for accumulative broadcast},
booktitle = {in Proc. Modeling Optimization in Mobile, Ad Hoc Wireless Networks Workshop (WiOpt’03},
year = {2003},
pages = {29--30}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In the problem of minimum-energy broadcasting in a wireless network, the objective is to broadcast data reliably to all network nodes at a fixed rate with minimum transmitted power. In [3], this problem was formulated as a minimum-cost broadcast tree problem and the well-known heuristic for constructing energy-efficient broadcast trees, the Broadcast Incremental Protocol (BIP), was proposed. In this paper, we look to increase the energy efficiency by employing an accumulative broadcast strategy [2] that allows nodes to collect the energy of unreliably received signals. As a message is forwarded through the network, a node will have multiple opportunities to reliably receive the message by collecting energy during each retransmission. While we allow nodes to collect unreliably received signals,
Keyphrases
repetition code accumulative broadcast network node minimum transmitted power multiple opportunity well-known heuristic fixed rate accumulative broadcast strategy broadcast incremental protocol energy efficiency energy-efficient broadcast tree wireless network minimum-energy broadcasting minimum-cost broadcast tree problem
