کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
451825 694417 2014 16 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Energy efficient routing algorithm for fiber-wireless access networks: A network formation game approach
ترجمه فارسی عنوان
الگوریتم مسیر یابی کارآمد انرژی برای شبکه های دسترسی فیبر نوری: یک رویکرد بازی سازی تشکیل شبکه
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
چکیده انگلیسی

New multimedia services and ubiquitous networking pose great challenges on existing access network infrastructures. To cope with such requirements new access technologies, such as the fiber-wireless (FiWi), are being developed. Together with the emergence of new access networks, efforts are being made to reduce the amount of energy required to provide services. Indeed, this issue plays an increasingly important role. Here we propose an energy efficient routing algorithm for FiWi access networks. The main idea is to exploit the multipath capabilities of the wireless mesh front end of FiWi access networks to create energy efficient routes that optimize the sleeping and active periods of all ONUs and wireless nodes. To achieve this goal, an energy efficient network model based on network formation game theory is used. This model allows several network formation processes to be compared in regard to the energy efficiency of the routes they generate. Our results reveal that the farsighted network formation process establishes the most energy efficient routes, meaning that the choices done by this formation process were the best ones. However, this farsighted process is computationally expensive. For this reason a heuristic algorithm is developed, which explores the most energy efficient choices taken by the network formation processes, and farsighted process in particular. Results show that the proposed heuristic is able to obtain results close to the farsighted process.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Networks - Volume 60, 26 February 2014, Pages 201–216
نویسندگان
, , ,