Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/3359
Title: A dominating set based communication architecture for distributed applications in mobile Ad hoc networks
Authors: Aytaç, İsmail Sıtkı
Çokuslu, Deniz
Issue Date: 2007
Publisher: Izmir Institute of Technology
Abstract: In this thesis, we aim to design and implement algorithms in a distributed environment in order to solve clustering, backbone formation and efficient routing problems for mobile ad hoc networks(MANET)s. Our first goal is to find a connected dominating set (CDS), then construct clusters using the clusterhead information and extend this approach to multi-level clusters. We propose a new Connected Dominating Set based clustering algorithm for clustering in MANETs. Our algorithm is based on Wu and Li's algorithm, however we provide significant modifications and heuristics such as considering the degrees of the nodes during marking process. We also extend our algorithm in order to generate a hierarchy of clusters. Our second goal is to implement a flooding based routing mechanism on top of CDS based clusters. We propose a two level flooding mechanism by using the CDS members as the gateways of the clusters. We describe the algorithms, analyze their time and message complexities and measure their performance in the simulation environments.
Description: Thesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 2007
Includes bibliographical references (leaves: 72-76)
Text in English; Abstract: Turkish and English
x, 93 leaves
URI: http://hdl.handle.net/11147/3359
Appears in Collections:Master Degree / Yüksek Lisans Tezleri
Sürdürülebilir Yeşil Kampüs Koleksiyonu / Sustainable Green Campus Collection

Files in This Item:
File Description SizeFormat 
T000652.pdfMasterThesis2.38 MBAdobe PDFThumbnail
View/Open
Show full item record

CORE Recommender

Page view(s)

42
checked on Sep 19, 2022

Download(s)

12
checked on Sep 19, 2022

Google ScholarTM

Check


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