ارسل ملاحظاتك

ارسل ملاحظاتك لنا







Minimizing Broadcast Expenses In Clustered Ad Hoc Networks

المصدر: مجلة جامعة الملك سعود - علوم الحاسب والمعلومات
الناشر: جامعة الملك سعود
المؤلف الرئيسي: Hussain, S. Zeeshan (Author)
مؤلفين آخرين: Ahmad, Naeem (Co-Author)
المجلد/العدد: مج30, ع1
محكمة: نعم
الدولة: السعودية
التاريخ الميلادي: 2018
الصفحات: 67 - 79
DOI: 10.33948/0584-030-001-007
ISSN: 1319-1578
رقم MD: 974326
نوع المحتوى: بحوث ومقالات
اللغة: الإنجليزية
قواعد المعلومات: science
مواضيع:
كلمات المؤلف المفتاحية:
Routing; Clustering | Congestion | Propagation | Broadcast
رابط المحتوى:
صورة الغلاف QR قانون
حفظ في:
المستخلص: One way to minimize the broadcast expenses of routing protocols is to cluster the net- work. In clustered ad-hoc networks, all resources can be managed easily by resolving scalability issues. However, blind query broadcast is a major issue that leads to the broadcast storm problem in clustered ad-hoc networks. This query broadcast is done to carry out the route-search task that leads to the unnecessary propagation of route-query even after route has been found. Hence, this query propagation poses the problem of congestion in the network. In particular this motivates us to propose a query-control technique in such networks which works based on broadcast repeal- ing. A huge amount of work has been devoted to propose the query control broadcasting tech- niques. However, such techniques used in traditional broadcasting mechanisms need to be properly extended for use in the cluster based routing architecture. In this paper, query-control technique is proposed for cluster based routing technique to reduce the broadcast expenses. Finally, we report some experiments which compare the proposed technique to other commonly used tech- niques including standard one-class AODV that follows TTL-sequence based broadcasting tech-nique.

ISSN: 1319-1578

عناصر مشابهة