A Sub-Gradient Algorithm For Maximal Data Extraction
Uloženo v:
| Název: | A Sub-Gradient Algorithm For Maximal Data Extraction |
|---|---|
| Autoři: | Wei Ye, Fernando Ordóñez |
| Přispěvatelé: | The Pennsylvania State University CiteSeerX Archives |
| Zdroj: | http://www-bcf.usc.edu/~fordon/docs/IEEEWirelessCom05-weiordonez.pdf. |
| Sbírka: | CiteSeerX |
| Popis: | — We present an efficient and implementable algorithm for maximizing data extraction from energy limited wireless sensor networks. A distinguishing feature of this algorithm is that it arrives at efficient routing solutions after few iterations, which is vital for efficient performance in energy limited networks. The algorithm uses sub-gradient optimization to solve the dual of a data extraction problem constructed by relaxing the energy constraints. We show through computational experiments that, for the problem considered, both centralized and distributed versions of the algorithm arrive at routing solutions that are on average better than 10 % from optimal after only 10 iterations. I. |
| Druh dokumentu: | text |
| Popis souboru: | application/pdf |
| Jazyk: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.1957 |
| Dostupnost: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.1957 http://www-bcf.usc.edu/~fordon/docs/IEEEWirelessCom05-weiordonez.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Přístupové číslo: | edsbas.A5276B32 |
| Databáze: | BASE |
Nájsť tento článok vo Web of Science | Abstrakt: | — We present an efficient and implementable algorithm for maximizing data extraction from energy limited wireless sensor networks. A distinguishing feature of this algorithm is that it arrives at efficient routing solutions after few iterations, which is vital for efficient performance in energy limited networks. The algorithm uses sub-gradient optimization to solve the dual of a data extraction problem constructed by relaxing the energy constraints. We show through computational experiments that, for the problem considered, both centralized and distributed versions of the algorithm arrive at routing solutions that are on average better than 10 % from optimal after only 10 iterations. I. |
|---|