Adaptive Cluster-based Approach for Reducing Routing Overheads in MANETs

被引：5

作者：

Er, Inn Inn ^{[1
]}

Seah, Winston K. G. ^{[2
]}

机构：

[1] Lion Nathan, Sydney, NSW, Australia

[2] Victoria Univ Wellington, Sch Engn & Comp Sci, Wellington, New Zealand

来源：

2010 16TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS (APCC 2010) | 2010年

关键词：

MANET; clustering; routing overheads; ALGORITHM; GLOMO;

D O I：

10.1109/APCC.2010.5679780

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

Despite the substantial work done on Mobile Ad Hoc Networks (MANETs), the scalability of routing protocols remains a limiting factor in large-scale deployments. An inherent problem lies in the route discovery mechanism of routing protocols, most of which rely on some form of flooding to search for routes and disseminate topology information. Clustering has been identified as one of the approaches to improve routing protocols' scalability and can prove to be useful provided the additional overheads incurred by the clustering management do not negate the gains in the reduction of routing overheads. In this paper, we present an extension of a typical MANET routing protocol that integrates an adaptive clustering mechanism and show that it is able to significantly reduce the communications overheads of routing protocols, thus paving the way for greater scalability.

引用

页码：279 / 284

页数：6

共 16 条

[1]

Beyer D. A., 1990, MILCOM 90. A New Era. 1990 IEEE Military Communications Conference. Conference Record (Cat. No.90CH2831-6), P855, DOI 10.1109/MILCOM.1990.117536

[2]

Chong P.H.J., 2008, ENCY WIRELESS MOBILE, P513

[3] Mobility-based d-hop clustering algorithm for mobile ad hoc networks [J].