IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v242y2015i3p778-787.html
   My bibliography  Save this article

A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks

Author

Listed:
  • Xia, Li
  • Shihada, Basem

Abstract

This paper studies the joint optimization problem of energy and delay in a multi-hop wireless network. The optimization variables are the transmission rates, which are adjustable according to the packet queueing length in the buffer. The optimization goal is to minimize the energy consumption of energy-critical nodes and the packet transmission delay throughout the network. In this paper, we aim at understanding the well-known decentralized algorithms which are threshold based from a different research angle. By using a simplified network model, we show that we can adopt the semi-open Jackson network model and study this optimization problem in closed form. This simplified network model further allows us to establish some significant optimality properties. We prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate. We also prove that the threshold-type policy is optimal, i.e., when the number of packets in the buffer is larger than a threshold, transmit with the maximal rate (power); otherwise, no transmission. With these optimality properties, we develop a heuristic algorithm to iteratively find the optimal threshold. Finally, we conduct some simulation experiments to demonstrate the main idea of this paper.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:242:y:2015:i:3:p:778-787
    DOI: 10.1016/j.ejor.2014.10.063
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714009023
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2014.10.063?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Xia, Li & Cao, Xi-Ren, 2012. "Performance optimization of queueing systems with perturbation realization," European Journal of Operational Research, Elsevier, vol. 218(2), pages 293-304.
    2. Donald L. Iglehart, 1963. "Optimality of (s, S) Policies in the Infinite Horizon Dynamic Inventory Problem," Management Science, INFORMS, vol. 9(2), pages 259-267, January.
    3. Li, Yanjie & Cao, Fang, 2013. "A basic formula for performance gradient estimation of semi-Markov decision processes," European Journal of Operational Research, Elsevier, vol. 224(2), pages 333-339.
    4. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Brooks, James D. & Kar, Koushik & Mendonça, David J., 2016. "Allocation of flows in closed bipartite queueing networks," European Journal of Operational Research, Elsevier, vol. 255(2), pages 333-344.
    2. Jing-Yu Ma & Quan-Lin Li, 2022. "Optimal dynamic mining policy of blockchain selfish mining through sensitivity-based optimization," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3663-3700, December.
    3. Keskin, Muhammed Emre, 2017. "A column generation heuristic for optimal wireless sensor network design with mobile sinks," European Journal of Operational Research, Elsevier, vol. 260(1), pages 291-304.

    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.
    1. Linwei Xin & David A. Goldberg, 2016. "Optimality Gap of Constant-Order Policies Decays Exponentially in the Lead Time for Lost Sales Models," Operations Research, INFORMS, vol. 64(6), pages 1556-1565, December.
    2. Awi Federgruen & Min Wang, 2015. "Inventory Models with Shelf-Age and Delay-Dependent Inventory Costs," Operations Research, INFORMS, vol. 63(3), pages 701-715, June.
    3. Perera, Sandun & Janakiraman, Ganesh & Niu, Shun-Chen, 2017. "Optimality of (s, S) policies in EOQ models with general cost structures," International Journal of Production Economics, Elsevier, vol. 187(C), pages 216-228.
    4. 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.
    5. Gah-Yi Ban, 2020. "Confidence Intervals for Data-Driven Inventory Policies with Demand Censoring," Operations Research, INFORMS, vol. 68(2), pages 309-326, March.
    6. Bo Li & Antonio Arreola‐Risa, 2022. "Minimizing conditional value‐at‐risk under a modified basestock policy," Production and Operations Management, Production and Operations Management Society, vol. 31(4), pages 1822-1838, April.
    7. Woonghee Tim Huh & Ganesh Janakiraman & Mahesh Nagarajan, 2011. "Average Cost Single-Stage Inventory Models: An Analysis Using a Vanishing Discount Approach," Operations Research, INFORMS, vol. 59(1), pages 143-155, February.
    8. Fleischmann, Moritz & Kuik, Roelof, 2003. "On optimal inventory control with independent stochastic item returns," European Journal of Operational Research, Elsevier, vol. 151(1), pages 25-37, November.
    9. Dehaybe, Henri & Catanzaro, Daniele & Chevalier, Philippe, 2024. "Deep Reinforcement Learning for inventory optimization with non-stationary uncertain demand," European Journal of Operational Research, Elsevier, vol. 314(2), pages 433-445.
    10. Xin Chen & David Simchi-Levi, 2004. "Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Infinite Horizon Case," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 698-723, August.
    11. Chen, Junlin & Zhao, Xiaobo & Zhou, Yun, 2012. "A periodic-review inventory system with a capacitated backup supplier for mitigating supply disruptions," European Journal of Operational Research, Elsevier, vol. 219(2), pages 312-323.
    12. 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.
    13. Shuangchi He & Dacheng Yao & Hanqin Zhang, 2017. "Optimal Ordering Policy for Inventory Systems with Quantity-Dependent Setup Costs," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 979-1006, November.
    14. Kilic, Onur A. & Tarim, S. Armagan, 2024. "A simple heuristic for computing non-stationary inventory policies based on function approximation," European Journal of Operational Research, Elsevier, vol. 316(3), pages 899-905.
    15. Hyun-Soo Ahn & Mehmet Gümüc{s} & Philip Kaminsky, 2009. "Inventory, Discounts, and the Timing Effect," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 613-629, September.
    16. David Easley & Daniel F. Spulber, 1978. "Optimal Policies and Steady-State Solutions for Inventory Problems with Markovian Uncertainty," Discussion Papers 353, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    17. Chiang, Chi, 2013. "A note on periodic review inventory models with stochastic supplier’s visit intervals and fixed ordering cost," International Journal of Production Economics, Elsevier, vol. 146(2), pages 662-666.
    18. Guillermo Gallego & Özalp Özer, 2001. "Integrating Replenishment Decisions with Advance Demand Information," Management Science, INFORMS, vol. 47(10), pages 1344-1360, October.
    19. Guan, Yongpei & Liu, Tieming, 2010. "Stochastic lot-sizing problem with inventory-bounds and constant order-capacities," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1398-1409, December.
    20. Haji Hosseinloo, Ashkan & Ryzhov, Alexander & Bischi, Aldo & Ouerdane, Henni & Turitsyn, Konstantin & Dahleh, Munther A., 2020. "Data-driven control of micro-climate in buildings: An event-triggered reinforcement learning approach," Applied Energy, Elsevier, vol. 277(C).

    Corrections

    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:eee:ejores:v:242:y:2015:i:3:p:778-787. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.