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

A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem

Author

Listed:
  • Scheibe, Kevin P.
  • Ragsdale, Cliff T.

Abstract

Three critical factors in wireless mesh network design are the number of hops between supply and demand points, the bandwidth capacity of the transport media, and the technique used to route packets within the network. Most previous research on network design has focused on the issue of hop constraints and/or bandwidth capacity in wired networks while assuming a per-flow routing scheme. However, networks that employ per-packet routing schemes in wireless networks involve different design issues that are unique to this type of problem. We present a methodology for designing wireless mesh networks that consider bandwidth capacity, hop constraints, and profitability for networks employing a per-packet routing system.

Suggested Citation

  • Scheibe, Kevin P. & Ragsdale, Cliff T., 2009. "A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 773-784, September.
    • Handle: RePEc:eee:ejores:v:197:y:2009:i:2:p:773-784
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00562-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Bezalel Gavish & Kemal Altinkemer, 1990. "Backbone Network Design Tools with Economic Tradeoffs," INFORMS Journal on Computing, INFORMS, vol. 2(3), pages 236-252, August.
    2. Gouveia, Luis, 1996. "Multicommodity flow models for spanning trees with hop constraints," European Journal of Operational Research, Elsevier, vol. 95(1), pages 178-190, November.
    3. Samit Soni, 2001. "Hop Constrained Network Design Problem with Partial Survivability," Annals of Operations Research, Springer, vol. 106(1), pages 181-198, September.
    4. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(5), pages 687-698, October.
    5. Mirchandani, Prakash, 2000. "Projections of the capacitated network loading problem," European Journal of Operational Research, Elsevier, vol. 122(3), pages 534-560, May.
    6. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    7. Luis Gouveia, 1998. "Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 180-188, May.
    8. Hasan Pirkul & Sridhar Narasimhan, 1994. "Primary and Secondary Route Selection in Backbone Computer Networks," INFORMS Journal on Computing, INFORMS, vol. 6(1), pages 50-60, February.
    9. Pirkul, Hasan & Soni, Samit, 2003. "New formulations and solution procedures for the hop constrained network design problem," European Journal of Operational Research, Elsevier, vol. 148(1), pages 126-140, July.
    10. L. Gouveia & P. Martins, 1999. "The Capacitated Minimal Spanning Tree Problem: An experiment with a hop‐indexedmodel," Annals of Operations Research, Springer, vol. 86(0), pages 271-294, January.
    11. Anantaram Balakrishnan & Thomas L. Magnanti & Prakash Mirchandani, 1998. "Designing Hierarchical Survivable Networks," Operations Research, INFORMS, vol. 46(1), pages 116-136, February.
    12. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(3), pages 381-386, June.
    13. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(4), pages 525-537, August.
    14. Larry J. LeBlanc & Jerome Chifflet & Philippe Mahey, 1999. "Packet Routing in Telecommunication Networks with Path and Flow Restrictions," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 188-197, May.
    15. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(2), pages 285-292, April.
    16. Anantaram Balakrishnan & Thomas L. Magnanti & Richard T. Wong, 1995. "A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning," Operations Research, INFORMS, vol. 43(1), pages 58-76, February.
    17. Gouveia, Luis & Joao Lopes, Maria, 2005. "The capacitated minimum spanning tree problem: On improved multistar constraints," European Journal of Operational Research, Elsevier, vol. 160(1), pages 47-62, January.
    18. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(1), pages 151-159, February.
    Full references (including those not matched with items on IDEAS)

    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. Allen C. Goodman & Miron Stano, 2000. "Hmos and Health Externalities: A Local Public Good Perspective," Public Finance Review, , vol. 28(3), pages 247-269, May.
    2. Bettina Campedelli & Andrea Guerrina & Giulia Romano & Chiara Leardini, 2014. "La performance della rete ospedaliera pubblica della regione Veneto. L?impatto delle variabili ambientali e operative sull?efficienza," MECOSAN, FrancoAngeli Editore, vol. 2014(92), pages 119-142.
    3. Penn Loh & Zoë Ackerman & Joceline Fidalgo & Rebecca Tumposky, 2022. "Co-Education/Co-Research Partnership: A Critical Approach to Co-Learning between Dudley Street Neighborhood Initiative and Tufts University," Social Sciences, MDPI, vol. 11(2), pages 1-17, February.
    4. O'Brien, Raymond & Patacchini, Eleonora, 2003. "Testing the exogeneity assumption in panel data models with "non classical" disturbances," Discussion Paper Series In Economics And Econometrics 0302, Economics Division, School of Social Sciences, University of Southampton.
    5. YongSeog Kim & W. Nick Street & Gary J. Russell & Filippo Menczer, 2005. "Customer Targeting: A Neural Network Approach Guided by Genetic Algorithms," Management Science, INFORMS, vol. 51(2), pages 264-276, February.
    6. Yanling Li & Zita Oravecz & Shuai Zhou & Yosef Bodovski & Ian J. Barnett & Guangqing Chi & Yuan Zhou & Naomi P. Friedman & Scott I. Vrieze & Sy-Miin Chow, 2022. "Bayesian Forecasting with a Regime-Switching Zero-Inflated Multilevel Poisson Regression Model: An Application to Adolescent Alcohol Use with Spatial Covariates," Psychometrika, Springer;The Psychometric Society, vol. 87(2), pages 376-402, June.
    7. Oscar J. Cacho & Robyn L. Hean & Russell M. Wise, 2003. "Carbon‐accounting methods and reforestation incentives," Australian Journal of Agricultural and Resource Economics, Australian Agricultural and Resource Economics Society, vol. 47(2), pages 153-179, June.
    8. Walter M. Cadette, 1999. "Financing Long-Term Care: Options for Policy," Economics Working Paper Archive wp_283, Levy Economics Institute.
    9. Eggli, Yves & Halfon, Patricia & Chikhi, Mehdi & Bandi, Till, 2006. "Ambulatory healthcare information system: A conceptual framework," Health Policy, Elsevier, vol. 78(1), pages 26-38, August.
    10. M. A. Noor & E.A. Al-Said, 2002. "Finite-Difference Method for a System of Third-Order Boundary-Value Problems," Journal of Optimization Theory and Applications, Springer, vol. 112(3), pages 627-637, March.
    11. Yong He & Zhiyi Tan, 2002. "Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time," Journal of Combinatorial Optimization, Springer, vol. 6(2), pages 199-206, June.
    12. Henderson, James E. & Dunn, Michael A., 2007. "Investigating the Potential of Fee-Based Recreation on Private Lands in the Lower Mississippi River Delta," 2007 Annual Meeting, February 4-7, 2007, Mobile, Alabama 34822, Southern Agricultural Economics Association.
    13. Eike Quilling & Birgit Babitsch & Kevin Dadaczynski & Stefanie Kruse & Maja Kuchler & Heike Köckler & Janna Leimann & Ulla Walter & Christina Plantz, 2020. "Municipal Health Promotion as Part of Urban Health: A Policy Framework for Action," Sustainability, MDPI, vol. 12(16), pages 1-10, August.
    14. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    15. Alireza Nili & Mary Tate & David Johnstone, 2019. "The process of solving problems with self-service technologies: a study from the user’s perspective," Electronic Commerce Research, Springer, vol. 19(2), pages 373-407, June.
    16. Chein-Shan Liu & Zhuojia Fu & Chung-Lun Kuo, 2017. "Directional Method of Fundamental Solutions for Three-dimensional Laplace Equation," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 9(6), pages 112-123, December.
    17. Ali Akgül & Esra Karatas Akgül & Dumitru Baleanu & Mustafa Inc, 2018. "New Numerical Method for Solving Tenth Order Boundary Value Problems," Mathematics, MDPI, vol. 6(11), pages 1-9, November.
    18. Li, Haitao & Womer, Norman K., 2015. "Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 246(1), pages 20-33.
    19. José Sánchez Maldonado & Salvador Gómez Sala, 2006. "The Reform of Indirect Taxation in Spain: VAT and Excise," International Center for Public Policy Working Paper Series, at AYSPS, GSU paper0607, International Center for Public Policy, Andrew Young School of Policy Studies, Georgia State University.
    20. Georgios Marinakos & Sophia Daskalaki, 2017. "Imbalanced customer classification for bank direct marketing," Journal of Marketing Analytics, Palgrave Macmillan, vol. 5(1), pages 14-30, March.

    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:197:y:2009:i:2:p:773-784. 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.