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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yao YU, Yu ZHOU, Kanglian ZHAO, Sidan DU, "Candidate-Based Routing for Mobile Ad Hoc Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 4, pp. 1033-1036, April 2010, doi: 10.1587/transcom.E93.B.1033.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.1033/_p
Copy
@ARTICLE{e93-b_4_1033,
author={Yao YU, Yu ZHOU, Kanglian ZHAO, Sidan DU, },
journal={IEICE TRANSACTIONS on Communications},
title={Candidate-Based Routing for Mobile Ad Hoc Networks},
year={2010},
volume={E93-B},
number={4},
pages={1033-1036},
abstract={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.},
keywords={},
doi={10.1587/transcom.E93.B.1033},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - Candidate-Based Routing for Mobile Ad Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1033
EP - 1036
AU - Yao YU
AU - Yu ZHOU
AU - Kanglian ZHAO
AU - Sidan DU
PY - 2010
DO - 10.1587/transcom.E93.B.1033
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2010
AB - 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.
ER -