Abstract | ||
---|---|---|
In this paper we address the minimum-energy broadcast problem. To increase the en- ergy efficiency, we allow nodes that are out of the transmission range of a transmitter to collect the energy of unreliably received overheard signals. As a message is forwarded through the network, a node will have multiple opportunities to reliably receive the mes- sage by collecting energy during each retransmission. We refer to this strategy as accu- mulative broadcast. Under the assumption that the nodes reliably forward messages, we formulate the minimum-energy accumulative broadcast problem. We present a solution employing two subproblems. First, we identify the ordering in which nodes should trans- mit. Second, we determine the optimum power levels for that ordering. While the second subproblem can be solved by means of linear programming, the ordering subproblem is found to be NP-complete. We devise a heuristic algorithm to find a good ordering and evaluate the performance of the algorithm. Preliminary results show the performance of the heuristic algorithm is generally close to the optimum solution. Results also show a significant improvement compared to the well known BIP algorithm for constructing an energy-efficient broadcast tree. |
Year | Venue | Keywords |
---|---|---|
2003 | Multiantenna Channels: Capacity, Coding and Signal Processing | energy efficient,linear program,heuristic algorithm |
Field | DocType | Citations |
Broadcasting,Wideband,Transmitter,Heuristic (computer science),Efficient energy use,Computer science,Retransmission,Computer network,Linear programming | Conference | 17 |
PageRank | References | Authors |
2.36 | 8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ivana Marić | 1 | 1904 | 104.95 |
Roy D. Yates | 2 | 1889 | 266.12 |