IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2013y2013i1n986985.html

A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks

Author

Listed:
  • Chih-Hao Lin
  • Chia-Chun Chuang

Abstract

Multicast routing is an effective way to transmit messages to multiple hosts in a network. However, it is vulnerable to intermittent connectivity property in mobile ad hoc network (MANET) especially for multimedia applications, which have some quality of service (QoS) requirements. The goal of QoS provisioning is to well organize network resources to satisfy the QoS requirement and achieve good network delivery services. However, there remains a challenge to provide QoS solutions and maintain end‐to‐end QoS with user mobility. In this paper, a novel penalty adjustment method based on the rough set theory is proposed to deal with path‐delay constraints for multicast routing problems in MANETs. We formulate the problem as a constrained optimization problem, where the objective function is to minimize the total cost of the multicast tree subject to QoS constraints. The RPGA is evaluated on three multicast scenarios and compared with two state‐of‐the‐art methods in terms of cost, success rate, and time complexity. The performance analyses show that this approach is a self‐adaptive method for penalty adjustment. Remarkably, the method can address a variety of constrained multicast routing problems even though the initial routes do not satisfy all QoS requirements.

Suggested Citation

  • Chih-Hao Lin & Chia-Chun Chuang, 2013. "A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    • Handle: RePEc:wly:jnljam:v:2013:y:2013:i:1:n:986985
    DOI: 10.1155/2013/986985
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2013/986985
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/986985?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
    ---><---

    References listed on IDEAS

    as
    1. Atidel Ben Hadj-Alouane & James C. Bean, 1997. "A Genetic Algorithm for the Multiple-Choice Integer Program," Operations Research, INFORMS, vol. 45(1), pages 92-101, February.
    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. Chen, Miao & Zhao, Shijie & Zhang, Tianran & Yu, Xin, 2026. "Dual-population two-archive evolutionary framework for constrained multi-objective optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 243(C), pages 196-220.
    2. Xu, Rui & Liu, Fang, 2025. "Dynamic modeling and co-optimization of configuration and operation for a solar-assisted ejector heat pump with energy storages," Energy, Elsevier, vol. 320(C).

    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. Alice E. Smith, 2023. "Note from the Editor," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 711-712, July.
    2. Jeffrey W. Ohlmann & Barrett W. Thomas, 2007. "A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 80-90, February.
    3. Jacob R. Fooks & Kent D. Messer & Maik Kecinski, 2018. "A Cautionary Note on the Use of Benefit Metrics for Cost-Effective Conservation," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 71(4), pages 985-999, December.
    4. Zhihua Chen & Xuchen Xu & Hongbo Liu, 2023. "The Successive Approximation Genetic Algorithm (SAGA) for Optimization Problems with Single Constraint," Mathematics, MDPI, vol. 11(8), pages 1-26, April.
    5. Jeffrey W. Ohlmann & James C. Bean & Shane G. Henderson, 2004. "Convergence in Probability of Compressed Annealing," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 837-860, November.
    6. Zong-Zhi Lin & James C. Bean & Chelsea C. White, 2004. "A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 27-38, February.
    7. Martin Schlüter & Matthias Gerdts, 2010. "The oracle penalty method," Journal of Global Optimization, Springer, vol. 47(2), pages 293-325, June.
    8. Miettinen, Kaisa & Makela, Marko M., 2006. "Synchronous approach in interactive multiobjective optimization," European Journal of Operational Research, Elsevier, vol. 170(3), pages 909-922, May.
    9. Alexouda, Georgia & Paparrizos, Konstantinos, 2001. "A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study," European Journal of Operational Research, Elsevier, vol. 134(1), pages 165-178, October.
    10. Zhihua Chen & Xuchen Xu & Hongbo Liu, 2023. "Improved Dual-Population Genetic Algorithm: A Straightforward Optimizer Applied to Engineering Optimization," Sustainability, MDPI, vol. 15(20), pages 1-32, October.
    11. Lee, Yusin & Cheng, Juey-Fu, 2001. "A model for calculating optimal vertical alignments of interchanges," Transportation Research Part B: Methodological, Elsevier, vol. 35(5), pages 423-445, June.
    12. Kurt DeMaagd & Johannes M. Bauer, 2011. "Modeling the dynamic interactions of agents in the provision of network infrastructure," Information Systems Frontiers, Springer, vol. 13(5), pages 669-680, November.

    More about this item

    Statistics

    Access and download statistics

    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:wly:jnljam:v:2013:y:2013:i:1:n:986985. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    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.