CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

A Stable Weighted Clustering Algorithm for Mobile Ad Hoc Networks with Power Saving

عنوان مقاله: A Stable Weighted Clustering Algorithm for Mobile Ad Hoc Networks with Power Saving
شناسه ملی مقاله: ICIKT03_042
منتشر شده در سومین کنفرانس بین المللی فناوری اطلاعات و دانش در سال 1386
مشخصات نویسندگان مقاله:

Reza Assareh - Science and Research Branch, Islamic Azad University Tehran, Iran
Ali Assarian - Science and Research Branch, Islamic Azad University Tehran, Iran
Ahmad Khadem Zadeh - Telecommunication Research Center Central Branch, Islamic Azad University Tehran, Iran
Arash Dana - Telecommunication Research Center Central Branch, Islamic Azad University Tehran, Iran

خلاصه مقاله:
This paper proposes a new weight based clustering algorithm for mobile ad hoc networks (MANETs). The proposed algorithm takes into account the transmission power, battery power, Tnb (connection duration with neighbors), Dnb (Average of distance with neighbors in Tnb), and the degree of a node for forming clusters. New Parameters of Tnb and Dnb are adopted as two metric to elect CH, in this paper. Using the first parameter increases the stability of cluster architecture. Using the second parameter causes the CHs to consume less power for communication with their neighbors. In this paper, these two parameters are defined and then a mathematical method is presented for their computation. Through simulations we have compared the performance of our algorithm with that of the Lowest-ID, Highest Degree (HD) and WCA algorithms in terms of number of reaffiliations, and power consumed in total network. Results obtained from simulations proved that the proposed algorithm achieves the goals.

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/49876/