Candidate-Based Routing for Mobile Ad Hoc Networks

被引：0

作者：

Yu, Yao ^{[1
]}

Zhou, Yu ^{[1
]}

Zhao, Kanglian ^{[1
]}

Du, Sidan ^{[1
]}

机构：

[1] Nanjing Univ, Dept Elect Sci & Engn, Nanjing 210093, Peoples R China

来源：

IEICE TRANSACTIONS ON COMMUNICATIONS | 2010年 / E93B卷 / 04期

关键词：

mobile ad hoc networks; network routing; routing efficiency; overhead;

D O I：

10.1587/transcom.E93.B.1033

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

A novel routing protocol. named candidate-based routing. for mobile ad hoc networks is presented Instead of flooding over the whole network it improves and rebuilds routing paths among a limited number of candidate nodes, which are dynamically elected without incurring or exchanging any additional information Experimental results show that the proposed protocol performs well in terms of overhead and improvement in route efficiency. especially in the high mobility speed environments

引用

页码：1033 / 1036

页数：4

共 5 条

[1] Abolhasan M., 2004, AD HOC NETW, V2, P1, DOI DOI 10.1016/S1570-8705(03)00043-X
[2] Belding-Royer E., 2003, RFC3561 AD HOC ON DE
[3] Gossip-based ad hoc routing
Haas, Zygmunt J.
Halpern, Joseph Y.
Li, Li
[J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2006, 14 (03) : 479 - 491
[4] JOHNSON D, 2007, RCF4728 IETF
[5] GloMoSim: A library for parallel simulation of large-scale wireless networks
Zeng, X
Bagrodia, R
Gerla, M
[J]. TWELFTH WORKSHOP ON PARALLEL AND DISTRIBUTED SIMULATION - PADS'98, PROCEEDINGS, 1998, : 154 - 161

← 1 →