Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/10084
Title: Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks (survey)
Authors: Erciyeş, Kayhan
Dağdeviren, Orhan
Çokuslu, Deniz
Özsoyeller, Deniz
Keywords: Clustering
Mobile Ad Hoc Networks
Wireless sensor networks
Dominating sets
Spanning trees
Fault tolerant clustering
Issue Date: 2007
Publisher: Azerbaijan National Academy of Sciences
Abstract: Clustering in mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs) is an important method to ease topology management and routing in such networks. Once the clusters are formed, the leaders (coordinators) of the clusters may be used to form a backbone for efficient routing and communication purposes. A set of clusters may also provide the underlying physical structure for multicast communication for a higher level group communication module which may effectively be used for fault tolerance and key management for security purposes. We survey graph theoretic approaches for clustering in MANETs and WSNS and show that although there is a wide range of such algorithms, each may be suitable for a different cross-layer design objective.
Description: System and Control Theory Workshop
URI: https://hdl.handle.net/11147/10084
ISSN: 1683-3511
1683-6154
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File SizeFormat 
acm07.pdf341.64 kBAdobe PDFView/Open
Show full item record

CORE Recommender

Page view(s)

36
checked on Dec 8, 2021

Download(s)

6
checked on Dec 8, 2021

Google ScholarTM

Check


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