A hybrid routing algorithm based on local optimal clusters for ad-hoc networks

被引：0

作者：

Lei, W ^{[1
]}

Lin, YP ^{[1
]}

Yang, XL ^{[1
]}

Raju, S ^{[1
]}

机构：

[1] Hunan Univ, Coll Comp & Commun, Changsha 410082, Peoples R China

来源：

PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES | 2003年

关键词：

ad-hoc network; routing; unicast; multicast;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

An ad-hoc network is a multi-hop wireless network in which mobile hosts communicate over a shared, scarce wireless channel. In this paper, an innovative distributed routing algorithm for ad-hoc networks is proposed, which combines the local maximal degree with the mobile host's moving speed and identifier to generate clusters. The new algorithm supports both unicast and multicast routing, and exhibit good performances with low delay and low cost. Moreover, it is scalable and easy to realize and maintain.

引用

页码：1345 / 1348

页数：4