IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i23p4557-d990870.html
   My bibliography  Save this article

A Guaranteed Approximation Algorithm for QoS Anypath Routing in WMNs

Author

Listed:
  • Weijun Yang

    (School of Mechanical and Electrical Engineering, Guangzhou City Polytechnic, Guangzhou 510405, China)

  • Xianxian Zeng

    (School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou 510665, China
    Guangdong Provincial Key Laboratory of Big Data Computing, The Chinese University of Hong Kong, Shenzhen 518000, China)

  • Guanyu Lai

    (School of Automation, Guangdong University of Technology, Guangzhou 510006, China)

Abstract

Anypath routing is a hot research topic for QoS guarantee in wireless mesh networks (WMNs). According to time-varying characteristics of WMNs and the idea of anypath routing, a system network modeling method is proposed to address the multiple constrained optimization anypath problem. It focuses on the application of WMNs; under various QoS constraints, it satisfies a specific constraint and approaches other QoS constraints from an approximate perspective. A heuristic multi-constrained anypath algorithm with a time complexity as Dijkstra is proposed for the problem, and the algorithm is proved to be a K-1 approximation algorithm. The feasibility of the algorithm is verified, then its computational efficiency and performance are evaluated through simulation experiments, respectively. According to the application characteristics of wireless networks, the algorithm is suitable for WMNs and has good compatibility with existing routing protocols.

Suggested Citation

  • Weijun Yang & Xianxian Zeng & Guanyu Lai, 2022. "A Guaranteed Approximation Algorithm for QoS Anypath Routing in WMNs," Mathematics, MDPI, vol. 10(23), pages 1-15, December.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:23:p:4557-:d:990870
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/23/4557/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/23/4557/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:10:y:2022:i:23:p:4557-:d:990870. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.