A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks
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 p...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/986985 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832556168576237568 |
|---|---|
| author | Chih-Hao Lin Chia-Chun Chuang |
| author_facet | Chih-Hao Lin Chia-Chun Chuang |
| author_sort | Chih-Hao Lin |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-ef9bce5924fb486e9d39cc0e0fef60ed |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-ef9bce5924fb486e9d39cc0e0fef60ed2025-02-03T05:46:14ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/986985986985A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc NetworksChih-Hao Lin0Chia-Chun Chuang1Department of Information Management, Chung Yuan Christian University, Jhongli City 32023, TaiwanDepartment of Information Management, Chung Yuan Christian University, Jhongli City 32023, TaiwanMulticast 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.http://dx.doi.org/10.1155/2013/986985 |
| spellingShingle | Chih-Hao Lin Chia-Chun Chuang A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks Journal of Applied Mathematics |
| title | A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks |
| title_full | A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks |
| title_fullStr | A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks |
| title_full_unstemmed | A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks |
| title_short | A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks |
| title_sort | rough penalty genetic algorithm for multicast routing in mobile ad hoc networks |
| url | http://dx.doi.org/10.1155/2013/986985 |
| work_keys_str_mv | AT chihhaolin aroughpenaltygeneticalgorithmformulticastroutinginmobileadhocnetworks AT chiachunchuang aroughpenaltygeneticalgorithmformulticastroutinginmobileadhocnetworks AT chihhaolin roughpenaltygeneticalgorithmformulticastroutinginmobileadhocnetworks AT chiachunchuang roughpenaltygeneticalgorithmformulticastroutinginmobileadhocnetworks |