Robust Maximum Lifetime Routing and Energy Allocation in Wireless Sensor Networks
We consider the maximum lifetime routing problem in wireless sensor networks in two settings: (a) when nodes’ initial energy is given and (b) when it is subject to optimization. The optimal solution and objective value provide optimal flows and the corresponding predicted lifetime, respectively. We...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-08-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2012/523787 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832559129028198400 |
|---|---|
| author | Ioannis Ch. Paschalidis Ruomin Wu |
| author_facet | Ioannis Ch. Paschalidis Ruomin Wu |
| author_sort | Ioannis Ch. Paschalidis |
| collection | DOAJ |
| description | We consider the maximum lifetime routing problem in wireless sensor networks in two settings: (a) when nodes’ initial energy is given and (b) when it is subject to optimization. The optimal solution and objective value provide optimal flows and the corresponding predicted lifetime, respectively. We stipulate that there is uncertainty in various network parameters (available energy and energy depletion rates). In setting (a) we show that for specific, yet typical, network topologies, the actual network lifetime will reach the predicted value with a probability that converges to zero as the number of nodes grows large. In setting (b) the same result holds for all topologies. We develop a series of robust problem formulations, ranging from pessimistic to optimistic. A set of parameters enable the tuning of the conservatism of the formulation to obtain network flows with a desirably high probability that the corresponding lifetime prediction is achieved. We establish a number of properties for the robust network flows and energy allocations and provide numerical results to highlight the tradeoff between predicted lifetime and the probability achieved. Further, we analyze an interesting limiting regime of massively deployed sensor networks and essentially solve a continuous version of the problem. |
| format | Article |
| id | doaj-art-2c5f1530e72b42a9a58dee843fb07053 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2012-08-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-2c5f1530e72b42a9a58dee843fb070532025-02-03T01:30:42ZengWileyInternational Journal of Distributed Sensor Networks1550-14772012-08-01810.1155/2012/523787Robust Maximum Lifetime Routing and Energy Allocation in Wireless Sensor NetworksIoannis Ch. Paschalidis0Ruomin Wu1 Division of Systems Engineering, Department of Electrical and Computer Engineering, Center for Information and Systems Engineering, Boston University, 8 St. Mary's Street, Boston, MA 02215, USA Center for Information and Systems Engineering, Boston University, Boston, MA 02215, USAWe consider the maximum lifetime routing problem in wireless sensor networks in two settings: (a) when nodes’ initial energy is given and (b) when it is subject to optimization. The optimal solution and objective value provide optimal flows and the corresponding predicted lifetime, respectively. We stipulate that there is uncertainty in various network parameters (available energy and energy depletion rates). In setting (a) we show that for specific, yet typical, network topologies, the actual network lifetime will reach the predicted value with a probability that converges to zero as the number of nodes grows large. In setting (b) the same result holds for all topologies. We develop a series of robust problem formulations, ranging from pessimistic to optimistic. A set of parameters enable the tuning of the conservatism of the formulation to obtain network flows with a desirably high probability that the corresponding lifetime prediction is achieved. We establish a number of properties for the robust network flows and energy allocations and provide numerical results to highlight the tradeoff between predicted lifetime and the probability achieved. Further, we analyze an interesting limiting regime of massively deployed sensor networks and essentially solve a continuous version of the problem.https://doi.org/10.1155/2012/523787 |
| spellingShingle | Ioannis Ch. Paschalidis Ruomin Wu Robust Maximum Lifetime Routing and Energy Allocation in Wireless Sensor Networks International Journal of Distributed Sensor Networks |
| title | Robust Maximum Lifetime Routing and Energy Allocation in Wireless Sensor Networks |
| title_full | Robust Maximum Lifetime Routing and Energy Allocation in Wireless Sensor Networks |
| title_fullStr | Robust Maximum Lifetime Routing and Energy Allocation in Wireless Sensor Networks |
| title_full_unstemmed | Robust Maximum Lifetime Routing and Energy Allocation in Wireless Sensor Networks |
| title_short | Robust Maximum Lifetime Routing and Energy Allocation in Wireless Sensor Networks |
| title_sort | robust maximum lifetime routing and energy allocation in wireless sensor networks |
| url | https://doi.org/10.1155/2012/523787 |
| work_keys_str_mv | AT ioannischpaschalidis robustmaximumlifetimeroutingandenergyallocationinwirelesssensornetworks AT ruominwu robustmaximumlifetimeroutingandenergyallocationinwirelesssensornetworks |