Minimum power multicasting in wireless networks under probabilistic node failures
Author
Abstract
Suggested Citation
DOI: 10.1007/s10589-009-9281-2
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- R. Montemanni & J. Barta & M. Mastrolilli & L. M. Gambardella, 2007. "The Robust Traveling Salesman Problem with Interval Data," Transportation Science, INFORMS, vol. 41(3), pages 366-381, August.
- Manki Min & Oleg Prokopyev & Panos M. Pardalos, 2006. "Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks," Journal of Combinatorial Optimization, Springer, vol. 11(1), pages 59-69, February.
- Montemanni, Roberto & Leggieri, Valeria & Triki, Chefi, 2008. "Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks," European Journal of Operational Research, Elsevier, vol. 190(2), pages 578-585, October.
- Valeria Leggieri & Paolo Nobili & Chefi Triki, 2008. "Minimum power multicasting problem in wireless networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 295-311, October.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Rossi, André & Aubry, Alexis & Jacomino, Mireille, 2012. "Connectivity-and-hop-constrained design of electricity distribution networks," European Journal of Operational Research, Elsevier, vol. 218(1), pages 48-57.
- Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
- Xia, Li & Shihada, Basem, 2015. "A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 778-787.
- R. Montemanni & V. Leggieri, 2011. "A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 327-342, December.
- Alireza Amirteimoori & Simin Masrouri, 2021. "DEA-based competition strategy in the presence of undesirable products: An application to paper mills," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(2), pages 5-21.
- Jean-François Cordeau & Gianpaolo Ghiani & Emanuela Guerriero, 2014. "Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem," Transportation Science, INFORMS, vol. 48(1), pages 46-58, February.
- Valeria Leggieri & Paolo Nobili & Chefi Triki, 2008. "Minimum power multicasting problem in wireless networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 295-311, October.
- Xiangyong Li & Y. P. Aneja, 2012. "A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 443-456, August.
- Dongxiao Yu & Yuexuan Wang & Qiangsheng Hua & Jiguo Yu & Francis C. M. Lau, 2016. "Distributed wireless link scheduling in the SINR model," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 278-292, July.
- Marika Ivanova & Dag Haugland, 2019. "Integer programming formulations for the shared multicast tree problem," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 927-956, October.
- Amadeu A. Coco & Andréa Cynthia Santos & Thiago F. Noronha, 2022. "Robust min-max regret covering problems," Computational Optimization and Applications, Springer, vol. 83(1), pages 111-141, September.
- Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
- Fabio Furini & Manuel Iori & Silvano Martello & Mutsunori Yagiura, 2015. "Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 392-405, May.
- Yossiri Adulyasak & Patrick Jaillet, 2016. "Models and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines," Transportation Science, INFORMS, vol. 50(2), pages 608-626, May.
- Brazil, M. & Ras, C.J. & Thomas, D.A., 2014. "A geometric characterisation of the quadratic min-power centre," European Journal of Operational Research, Elsevier, vol. 233(1), pages 34-42.
- Groß, Patrick-Oliver & Ehmke, Jan Fabian & Mattfeld, Dirk Christian, 2020. "Interval travel times for robust synchronization in city logistics vehicle routing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
- Patrick Jaillet & Jin Qi & Melvyn Sim, 2016. "Routing Optimization Under Uncertainty," Operations Research, INFORMS, vol. 64(1), pages 186-200, February.
- Wei Wu & Manuel Iori & Silvano Martello & Mutsunori Yagiura, 2022. "An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2523-2539, September.
- Liang, Jinpeng & Wu, Jianjun & Qu, Yunchao & Yin, Haodong & Qu, Xiaobo & Gao, Ziyou, 2019. "Robust bus bridging service design under rail transit system disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 97-116.
- Bock, Stefan, 2020. "Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios," European Journal of Operational Research, Elsevier, vol. 283(3), pages 863-882.
More about this item
Keywords
Minimum power multicasting; Probabilistic mathematical models; Multihop networks;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:49:y:2011:i:1:p:193-212. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.