Show simple item record

dc.contributor.authorAydın, Nevinen_US
dc.contributor.authorNait-Abdesselam, Fariden_US
dc.contributor.authorPryyma, Volodymyren_US
dc.contributor.authorTurgut, Damlaen_US
dc.date.accessioned2016-06-02T09:15:39Z
dc.date.available2016-06-02T09:15:39Z
dc.date.issued2010
dc.identifier.citationAydın, N., Nait-Abdesselam, F., Pryyma, V., Turgut, D. (6-10 Dec. 2010). Overlapping clusters algorithm in ad hoc networks. Global Telecommunications Conference (GLOBECOM 2010). Miami, FL: IEEE, 1 - 5en_US
dc.identifier.isbn9781424456376
dc.identifier.isbn9781424456369
dc.identifier.issn1930-529X
dc.identifier.urihttps://hdl.handle.net/20.500.12294/470
dc.identifier.urihttp://dx.doi.org/10.1109/GLOCOM.2010.5683454
dc.descriptionAydın, Nevin (Arel Author) --- Conference: Global Telecommunications Conference (GLOBECOM 2010). Miami, FL, 6-10 Dec. 2010.en_US
dc.description.abstractClustering allows efficient data routing and multi-hop communication among the nodes. In this paper, we propose Overlapping Clusters Algorithm (OCA) for mobile ad hoc networks. The goal of OCA is to achieve network reliability and load balancing. The algorithm consists of two discrete phases. The start-up phase takes battery and bandwidth capacity, transmission range, density, mobility, and buffer occupancy as input parameters to perform initial clustering for the entire network. The maintenance phase monitors the status of the network and keeps the network topology updated through local and global re-clustering. We compare the performance of OCA with Lowest ID, Highest Degree, WCA, and LCC algorithms in YAES simulator. The simulation results show that OCA outperforms all the compared algorithms in terms of network reliability and load distribution. The average numbers of global re-clusterings and reaffiliations were much lower in OCA than the other algorithms. However, OCA generates a larger number of clusters, which is expected considering that the nodes are allowed to be members of multiple clusters at the same time.en_US
dc.language.isoengen_US
dc.publisherIEEEen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectClustering Algorithmsen_US
dc.subjectLoad Modelingen_US
dc.subjectMobile Ad Hoc Networksen_US
dc.subjectMobile Computingen_US
dc.subjectPeer To Peer Computingen_US
dc.subjectReliabilityen_US
dc.titleOverlapping clusters algorithm in ad hoc networksen_US
dc.typeconferenceObjecten_US
dc.relation.journalGlobal Telecommunications Conference (GLOBECOM 2010)en_US
dc.contributor.departmentİstanbul Arel Üniversitesi, Mühendislik ve Mimarlık Fakültesi, Endüstri Mühendisliği Bölümü.en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record