Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/3083
Title: | Graph Theoretic Clustering Algorithms in Mobile Ad Hoc Networks and Wireless Sensor Networks (survey) | Authors: | Erciyes, Kayhan Dagdeviren, Orhan Cokuslu, Deniz Ozsoyeller, Deniz |
Keywords: | clustering mobile ad hoc networks wireless sensor networks dominating sets spanning trees fault tolerant clustering Dominating Set |
Publisher: | Ministry Communications & High Technologies Republic Azerbaijan | 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 -- SEP 07-09, 2005 -- Gebze Technol Inst, Gebze, TURKEY | URI: | https://hdl.handle.net/20.500.14365/3083 | ISSN: | 1683-3511 1683-6154 |
Appears in Collections: | WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
WEB OF SCIENCETM
Citations
35
checked on Apr 2, 2025
Page view(s)
70
checked on Mar 31, 2025
Download(s)
6
checked on Mar 31, 2025
Google ScholarTM
Check
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.