Candidate-Based Routing for Mobile Ad Hoc Networks

Yao YU  Yu ZHOU  Kanglian ZHAO  Sidan DU  

IEICE TRANSACTIONS on Communications   Vol.E93-B   No.4   pp.1033-1036
Publication Date: 2010/04/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E93.B.1033
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network
mobile ad hoc networks,  network routing,  routing efficiency,  overhead,  

Full Text: PDF>>
Buy this Article

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.