By Topic

A flooding based routing algorithm for Mobile Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Deniz Cokuslu ; Bilgisayar Mühendisli¿i Bölümü, ¿zmir Yüksek Teknoloji Ünstitüsü, Turkey ; Kayhan Erciyes

Mobile ad hoc networks (MANETs) are videly in use in rescue, military operations, scientific and business areas. Many studies are addressed in MANETs because of their need to long lasting liveness, fault tolerance, dynamic addressing, collusion prevention, mobility management and security. Especially, self clustering, backbone construction and routing are the most interesting academic and industrial research areas in MANETs. A wide range of studies addressed the routing problem in MANETs. Many previous studies address the clustering and routing problems as seperate subjects. However, routing approaches which are specific to the clustering methodologies may have many advantages in terms of efficiency and availability. In this study, a flooding based routing algorithm is proposed. First, a detailed description of the algorithm is explained, then the analysis and test results using the ns2 simulator are given which show that the designed algorithm is scalable and has favorable performance.

Published in:

2008 IEEE 16th Signal Processing, Communication and Applications Conference

Date of Conference:

20-22 April 2008