Multiobjective Multicast DSR Algorithm for Routing in Mobile Networks with Cost, Delay, and Hop Count
Tremendous evaluation of wireless mobile communication needs more efficient algorithms for communication systems. The use of conventional single-objective optimization algorithms may be unsuitable for real applications, because they act to the detriment of the rest of the performance parameters like...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/9965872 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849412497763729408 |
|---|---|
| author | Hamdy H. El-Sayed A. Younes Fahad A. Alghamdi |
| author_facet | Hamdy H. El-Sayed A. Younes Fahad A. Alghamdi |
| author_sort | Hamdy H. El-Sayed |
| collection | DOAJ |
| description | Tremendous evaluation of wireless mobile communication needs more efficient algorithms for communication systems. The use of conventional single-objective optimization algorithms may be unsuitable for real applications, because they act to the detriment of the rest of the performance parameters like lifetime network, delay, cost, and hop count; for this reason, multiobjective is needed. This paper presents performance evaluation and compares between the Multicast MDSR and MAODV with MACO. The proposed MDSR is concerned with change of the route discovery phase, where the route selection is based on the shortest path of route reply packets on the route with calculating the number of hop counts. Also, this article compares our MDSR modification with the evaluation algorithm based on Ant Colony Optimization (ACO), which finds the best path and multicast tree optimizes total weight (cost, delay, and hop count) of the multicast tree using multiobjective. Experimental results proved that the proposed MDSR algorithm is more efficient than MAODV and MACO in the total weight (cost, delay, and hop count), respectively. Moreover, the MACO outperforms MAODV for multicast routing problem. |
| format | Article |
| id | doaj-art-649db89c5b1846ada93d6aacc44182d8 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-649db89c5b1846ada93d6aacc44182d82025-08-20T03:34:25ZengWileyComplexity1076-27871099-05262021-01-01202110.1155/2021/99658729965872Multiobjective Multicast DSR Algorithm for Routing in Mobile Networks with Cost, Delay, and Hop CountHamdy H. El-Sayed0A. Younes1Fahad A. Alghamdi2Faculty of Computers and Information, Sohag University, Sohag, EgyptFaculty of Computers and Information, Sohag University, Sohag, EgyptDepartment of MIS, College of Applied Studies and Community Service, Imam Abdulrahman Bin Faisal University, Dammam, Saudi ArabiaTremendous evaluation of wireless mobile communication needs more efficient algorithms for communication systems. The use of conventional single-objective optimization algorithms may be unsuitable for real applications, because they act to the detriment of the rest of the performance parameters like lifetime network, delay, cost, and hop count; for this reason, multiobjective is needed. This paper presents performance evaluation and compares between the Multicast MDSR and MAODV with MACO. The proposed MDSR is concerned with change of the route discovery phase, where the route selection is based on the shortest path of route reply packets on the route with calculating the number of hop counts. Also, this article compares our MDSR modification with the evaluation algorithm based on Ant Colony Optimization (ACO), which finds the best path and multicast tree optimizes total weight (cost, delay, and hop count) of the multicast tree using multiobjective. Experimental results proved that the proposed MDSR algorithm is more efficient than MAODV and MACO in the total weight (cost, delay, and hop count), respectively. Moreover, the MACO outperforms MAODV for multicast routing problem.http://dx.doi.org/10.1155/2021/9965872 |
| spellingShingle | Hamdy H. El-Sayed A. Younes Fahad A. Alghamdi Multiobjective Multicast DSR Algorithm for Routing in Mobile Networks with Cost, Delay, and Hop Count Complexity |
| title | Multiobjective Multicast DSR Algorithm for Routing in Mobile Networks with Cost, Delay, and Hop Count |
| title_full | Multiobjective Multicast DSR Algorithm for Routing in Mobile Networks with Cost, Delay, and Hop Count |
| title_fullStr | Multiobjective Multicast DSR Algorithm for Routing in Mobile Networks with Cost, Delay, and Hop Count |
| title_full_unstemmed | Multiobjective Multicast DSR Algorithm for Routing in Mobile Networks with Cost, Delay, and Hop Count |
| title_short | Multiobjective Multicast DSR Algorithm for Routing in Mobile Networks with Cost, Delay, and Hop Count |
| title_sort | multiobjective multicast dsr algorithm for routing in mobile networks with cost delay and hop count |
| url | http://dx.doi.org/10.1155/2021/9965872 |
| work_keys_str_mv | AT hamdyhelsayed multiobjectivemulticastdsralgorithmforroutinginmobilenetworkswithcostdelayandhopcount AT ayounes multiobjectivemulticastdsralgorithmforroutinginmobilenetworkswithcostdelayandhopcount AT fahadaalghamdi multiobjectivemulticastdsralgorithmforroutinginmobilenetworkswithcostdelayandhopcount |