IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v62y2016i1d10.1007_s11235-015-0076-8.html
   My bibliography  Save this article

Optimized interference aware joint channel assignment model for wireless mesh network

Author

Listed:
  • Saqib Ali

    (Universiti Teknologi Malaysia
    University of Agriculture)

  • Md Asri Ngadi

    (Universiti Teknologi Malaysia)

Abstract

In this paper, linear optimization is used to model the interference aware joint channel assignment problem in Wireless Mesh Networks. The model selects the channels for the interfering links such that interference is minimized, overall throughput of the network is maximized, and network capacity is fairly distributed among the interfering links. The interference is minimized by classifying the interfering links into four different classes depending upon the geometric location of the sender and receiver of a link (i.e., Sender Connected, Asymmetric Incomplete State, Symmetric Incomplete State, and Far Hidden interfering links). Further, the classes of interfering links are assigned with distinct channels through optimized spectral re-usability of joint channels available in 2.4 GHz ISM band. As a result, it increases the simultaneous transmissions among the interfering links which in turn increases the aggregate throughput of the network while ensuring that capacity is fairly distributed among the interfering links. Numerical results indicated that joint channel assignment model has achieved better performance than non-overlapping channel assignment models. Hence, this validates the model, which can serve as a benchmark in the design and deployment of wireless mesh networks.

Suggested Citation

  • Saqib Ali & Md Asri Ngadi, 2016. "Optimized interference aware joint channel assignment model for wireless mesh network," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 62(1), pages 215-230, May.
    • Handle: RePEc:spr:telsys:v:62:y:2016:i:1:d:10.1007_s11235-015-0076-8
    DOI: 10.1007/s11235-015-0076-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-015-0076-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-015-0076-8?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. Robert Fourer & David M. Gay & Brian W. Kernighan, 1990. "A Modeling Language for Mathematical Programming," Management Science, INFORMS, vol. 36(5), pages 519-554, May.
    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. Pichler, Anton & Poledna, Sebastian & Thurner, Stefan, 2021. "Systemic risk-efficient asset allocations: Minimization of systemic risk as a network optimization problem," Journal of Financial Stability, Elsevier, vol. 52(C).
    2. Sinha, Ankur & Rämö, Janne & Malo, Pekka & Kallio, Markku & Tahvonen, Olli, 2017. "Optimal management of naturally regenerating uneven-aged forests," European Journal of Operational Research, Elsevier, vol. 256(3), pages 886-900.
    3. Duck Bong Kim, 2019. "An approach for composing predictive models from disparate knowledge sources in smart manufacturing environments," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1999-2012, April.
    4. Vaz, A. Ismael F. & Fernandes, Edite M. G. P. & Gomes, M. Paula S. F., 2004. "Robot trajectory planning with semi-infinite programming," European Journal of Operational Research, Elsevier, vol. 153(3), pages 607-617, March.
    5. Cindy Paola Guzman & Nataly Bañol Arias & John Fredy Franco & Marcos J. Rider & Rubén Romero, 2020. "Enhanced Coordination Strategy for an Aggregator of Distributed Energy Resources Participating in the Day-Ahead Reserve Market," Energies, MDPI, vol. 13(8), pages 1-22, April.
    6. H. Le Thi & A. Vaz & L. Vicente, 2012. "Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 190-214, April.
    7. Shraddha Ghatkar, 2019. "Optimization of fractionation schemes and beamlet intensities in intensity-modulated radiation therapy with changing cancer tumor properties," DECISION: Official Journal of the Indian Institute of Management Calcutta, Springer;Indian Institute of Management Calcutta, vol. 46(4), pages 385-407, December.
    8. Yongyang Cai & Kenneth L. Judd, 2023. "A simple but powerful simulated certainty equivalent approximation method for dynamic stochastic problems," Quantitative Economics, Econometric Society, vol. 14(2), pages 651-687, May.
    9. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.
    10. Robert Fourer & Jean-Pierre Goux, 2001. "Optimization as an Internet Resource," Interfaces, INFORMS, vol. 31(2), pages 130-150, April.
    11. Danny García Sánchez & Alejandra Tabares & Lucas Teles Faria & Juan Carlos Rivera & John Fredy Franco, 2022. "A Clustering Approach for the Optimal Siting of Recharging Stations in the Electric Vehicle Routing Problem with Time Windows," Energies, MDPI, vol. 15(7), pages 1-19, March.
    12. Cai, Yongyang & Judd, Kenneth L., 2012. "Dynamic programming with shape-preserving rational spline Hermite interpolation," Economics Letters, Elsevier, vol. 117(1), pages 161-164.
    13. Resteanu, Cornel & Filip, Florin-Gheorghe & Stanescu, Sorin & Ionescu, Cezar, 2000. "A cooperative production planning method in the field of continuous process plants," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 65-78, March.
    14. D. K. Karpouzos & K. L. Katsifarakis, 2021. "A new benchmark optimization problem of adaptable difficulty: theoretical considerations and practical testing," Operational Research, Springer, vol. 21(1), pages 231-250, March.
    15. Rao, Harish Venkatesh & Dutta, Goutam & Basu, Sankarshan, 2014. "Database Structure for a Multi Stage Stochastic Optimization Based Decision Support System for Asset – Liability Management of a Life Insurance Company," IIMA Working Papers WP2014-06-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    16. Bartolomeus Häussling Löwgren & Joris Weigert & Erik Esche & Jens-Uwe Repke, 2020. "Uncertainty Analysis for Data-Driven Chance-Constrained Optimization," Sustainability, MDPI, vol. 12(6), pages 1-17, March.
    17. Gordon P. Wright & Alok R. Chaturvedi & Radha V. Mookerjee & Susan Garrod, 1998. "Integrated Modeling Environments in Organizations: An Empirical Study," Information Systems Research, INFORMS, vol. 9(1), pages 64-84, March.
    18. Heilporn, Géraldine & De Giovanni, Luigi & Labbé, Martine, 2008. "Optimization models for the single delay management problem in public transportation," European Journal of Operational Research, Elsevier, vol. 189(3), pages 762-774, September.
    19. Benoît Legat & Oscar Dowson & Joaquim Dias Garcia & Miles Lubin, 2022. "MathOptInterface: A Data Structure for Mathematical Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 672-689, March.
    20. Yongyang Cai & Kenneth Judd, 2015. "Dynamic programming with Hermite approximation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 81(3), pages 245-267, June.

    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:spr:telsys:v:62:y:2016:i:1:d:10.1007_s11235-015-0076-8. 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.

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