|
|
International Journal of Information and Communication Technology Research (IJICT، جلد ۷، شماره ۴، صفحات ۱۷-۲۵
|
|
|
| عنوان فارسی |
|
|
| چکیده فارسی مقاله |
|
|
| کلیدواژه‌های فارسی مقاله |
|
|
| عنوان انگلیسی |
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' 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. |
|
| کلیدواژه‌های انگلیسی مقاله |
|
|
| نویسندگان مقاله |
| Abdorasoul Ghasemi
| Mahmood Mollaei
|
|
| نشانی اینترنتی |
http://ijict.itrc.ac.ir/browse.php?a_code=A-10-27-57&slc_lang=fa&sid=1 |
| فایل مقاله |
اشکال در دسترسی به فایل - ./files/site1/rds_journals/417/article-417-1212361.pdf |
| کد مقاله (doi) |
|
| زبان مقاله منتشر شده |
fa |
| موضوعات مقاله منتشر شده |
فناوری اطلاعات |
| نوع مقاله منتشر شده |
پژوهشی |
|
|
|
برگشت به:
صفحه اول پایگاه |
نسخه مرتبط |
نشریه مرتبط |
فهرست نشریات
|