A MinMax Routing Algorithm for Long Life Route Selection in MANETs
In this paper, the stable or long life route selection problem in Mobile Ad-hoc Wireless Networks (MANETs) is addressed. The objective is to develop an on demand routing scheme to find a long life route between a given source and destination assuming each node has an estimate of neighbors’ mobilitie...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Iran Telecom Research Center
2015-12-01
|
| Series: | International Journal of Information and Communication Technology Research |
| Subjects: | |
| Online Access: | http://ijict.itrc.ac.ir/article-1-79-en.html |
| _version_ | 1811169278817206272 |
|---|---|
| author | Abdorasoul Ghasemi Mahmood Mollaei |
| author_facet | Abdorasoul Ghasemi Mahmood Mollaei |
| author_sort | Abdorasoul Ghasemi |
| collection | DOAJ |
| description | In this paper, the stable or long life route selection problem in Mobile Ad-hoc Wireless Networks (MANETs) is addressed. The objective is to develop an on demand routing scheme to find a long life route between a given source and destination assuming each node has an estimate of neighbors’ mobilities. Formulating the problem as a MinMax optimization one, we use a dynamic programming based scheme for route selection. The proposed MinMax Routing Algorithm (MRA) is an on demand routing that can be implemented in the traditional Ad-hoc On- Demand Distance Vector (AODV) structure. In the route request phase, tail subproblems of finding the most stable route from the source to each intermediate node are solved. MRA finds the most stable route in the route reply phase deploying the solutions of these subproblems. Simulation results using NS2 simulator are provided to show the performance of MRA compared to AODV and stable AODV schemes in terms of the lifetime of selected route and routing overhead. Also, the tradeoff between the route discovery delay and finding more stable routes is discussed and justified by simulations. |
| first_indexed | 2024-04-10T16:39:42Z |
| format | Article |
| id | doaj.art-25edf169ac2e40328332a5c7ed0d374a |
| institution | Directory Open Access Journal |
| issn | 2251-6107 2783-4425 |
| language | English |
| last_indexed | 2024-04-10T16:39:42Z |
| publishDate | 2015-12-01 |
| publisher | Iran Telecom Research Center |
| record_format | Article |
| series | International Journal of Information and Communication Technology Research |
| spelling | doaj.art-25edf169ac2e40328332a5c7ed0d374a2023-02-08T07:55:01ZengIran Telecom Research CenterInternational Journal of Information and Communication Technology Research2251-61072783-44252015-12-01741725A MinMax Routing Algorithm for Long Life Route Selection in MANETsAbdorasoul Ghasemi0Mahmood Mollaei1 In this paper, the stable or long life route selection problem in Mobile Ad-hoc Wireless Networks (MANETs) is addressed. The objective is to develop an on demand routing scheme to find a long life route between a given source and destination assuming each node has an estimate of neighbors’ mobilities. Formulating the problem as a MinMax optimization one, we use a dynamic programming based scheme for route selection. The proposed MinMax Routing Algorithm (MRA) is an on demand routing that can be implemented in the traditional Ad-hoc On- Demand Distance Vector (AODV) structure. In the route request phase, tail subproblems of finding the most stable route from the source to each intermediate node are solved. MRA finds the most stable route in the route reply phase deploying the solutions of these subproblems. Simulation results using NS2 simulator are provided to show the performance of MRA compared to AODV and stable AODV schemes in terms of the lifetime of selected route and routing overhead. Also, the tradeoff between the route discovery delay and finding more stable routes is discussed and justified by simulations.http://ijict.itrc.ac.ir/article-1-79-en.htmlmobile ad-hoc networkroutingroute stabilityad-hoc on-demand distance vectordynamic programming |
| spellingShingle | Abdorasoul Ghasemi Mahmood Mollaei A MinMax Routing Algorithm for Long Life Route Selection in MANETs International Journal of Information and Communication Technology Research mobile ad-hoc network routing route stability ad-hoc on-demand distance vector dynamic programming |
| title | A MinMax Routing Algorithm for Long Life Route Selection in MANETs |
| title_full | A MinMax Routing Algorithm for Long Life Route Selection in MANETs |
| title_fullStr | A MinMax Routing Algorithm for Long Life Route Selection in MANETs |
| title_full_unstemmed | A MinMax Routing Algorithm for Long Life Route Selection in MANETs |
| title_short | A MinMax Routing Algorithm for Long Life Route Selection in MANETs |
| title_sort | minmax routing algorithm for long life route selection in manets |
| topic | mobile ad-hoc network routing route stability ad-hoc on-demand distance vector dynamic programming |
| url | http://ijict.itrc.ac.ir/article-1-79-en.html |
| work_keys_str_mv | AT abdorasoulghasemi aminmaxroutingalgorithmforlongliferouteselectioninmanets AT mahmoodmollaei aminmaxroutingalgorithmforlongliferouteselectioninmanets AT abdorasoulghasemi minmaxroutingalgorithmforlongliferouteselectioninmanets AT mahmoodmollaei minmaxroutingalgorithmforlongliferouteselectioninmanets |