Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/10068
Title: Gezgin tasarsız ağlar için taşırma tabanlı yönlendirme yordamı
Other Titles: A flooding based routing algorithm for mobile ad hoc networks
Authors: Çokuslu, Deniz
Erciyeş, Kayhan
Issue Date: 2008
Publisher: IEEE
Abstract: 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, rowing 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.
Description: IEEE 16th Signal Processing and Communications Applications Conference
URI: https://hdl.handle.net/11147/10068
ISBN: 978-1-4244-1998-2
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File SizeFormat 
A_flooding_based_routing.pdf717.14 kBAdobe PDFView/Open
Show full item record

CORE Recommender

Page view(s)

42
checked on Jan 24, 2022

Download(s)

10
checked on Jan 24, 2022

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.