Distributed routing algorithm with dynamic connection partition for mobile ad hoc networks

Distributed routing algorithm with dynamic connection partition for mobile ad hoc networks

For access to this article, please select a purchase option:

Buy eFirst article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Networks — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Mobile ad hoc networks (MANETs) are attractive for many applications because of their easy-to-use and self-organising nature. However, the routing overhead problem has always been a bottleneck restricting the development of MANETs technology. The reason behind is the traditional blind flooding methods and frequent route initiations caused by node mobility. Reducing routing overhead has a huge impact on saving energy consumption of mobile nodes and improving the MANETs performance. In this study, a distributed dynamic routing algorithm is proposed to establish an efficient routing mechanism for MANETs. Based on the mobility of nodes, a fuzzy positional relationship between nodes is constructed. Using this relationship, an improved routing method is designed. The authors characterise this relationship between nodes and implement the proposed algorithm in an ad hoc routing architecture. The simulation results show that the proposed routing algorithm achieves good performance in reducing routing overhead and improves the efficiency of packet transmissions in MANETs.

Related content

This is a required field
Please enter a valid email address