A Merging Clustering Algorithm for Mobile Ad Hoc Networks
| dc.contributor.author | Dağdeviren, Orhan | |
| dc.contributor.author | Erciyeş, Kayhan | |
| dc.contributor.author | Çokuslu, Deniz | |
| dc.coverage.doi | 10.1007/11751588_71 | |
| dc.date.accessioned | 2016-10-17T08:46:52Z | |
| dc.date.available | 2016-10-17T08:46:52Z | |
| dc.date.issued | 2006 | |
| dc.description | ICCSA 2006: International Conference on Computational Science and Its Applications; Glasgow; United Kingdom; 8 May 2006 through 11 May 2006 | en_US |
| dc.description.abstract | Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a new fully distributed algorithm for clustering in MANETs that merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities and provide results in the simulation environment of ns2. Our results conform that the algorithm proposed is scalable and has a lower time and message complexities than the other algorithms | en_US |
| dc.identifier.citation | Dağdeviren, O., Erciyeş, K., and Çokuslu, D. (2006). A merging clustering algorithm for mobile ad hoc networks. Lecture Notes in Computer Science, 3981 LNCS, 681-690. doi:10.1007/11751588_71 | en_US |
| dc.identifier.doi | 10.1007/11751588_71 | en_US |
| dc.identifier.doi | 10.1007/11751588_71 | |
| dc.identifier.isbn | 9783540340720 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.scopus | 2-s2.0-33745928448 | |
| dc.identifier.uri | http://doi.org/10.1007/11751588_71 | |
| dc.identifier.uri | https://hdl.handle.net/11147/2255 | |
| dc.language.iso | en | en_US |
| dc.publisher | Springer Verlag | en_US |
| dc.relation.ispartof | Lecture Notes in Computer Science | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Communication systems | en_US |
| dc.subject | Algorithms | en_US |
| dc.subject | Computational complexity | en_US |
| dc.subject | Problem solving | en_US |
| dc.title | A Merging Clustering Algorithm for Mobile Ad Hoc Networks | en_US |
| dc.type | Conference Object | en_US |
| dspace.entity.type | Publication | |
| gdc.author.institutional | Dağdeviren, Orhan | |
| gdc.author.institutional | Erciyeş, Kayhan | |
| gdc.author.institutional | Çokuslu, Deniz | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | open access | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | İzmir Institute of Technology. Computer Engineering | en_US |
| gdc.description.endpage | 690 | en_US |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q3 | |
| gdc.description.startpage | 681 | en_US |
| gdc.description.volume | 3981 LNCS | en_US |
| gdc.description.wosquality | N/A | |
| gdc.identifier.openalex | W1503173866 | |
| gdc.identifier.wos | WOS:000237646100071 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 4.0 | |
| gdc.oaire.influence | 3.162576E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | Computational complexity | |
| gdc.oaire.keywords | Problem solving | |
| gdc.oaire.keywords | Communication systems | |
| gdc.oaire.keywords | Algorithms | |
| gdc.oaire.popularity | 6.1822114E-10 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0202 electrical engineering, electronic engineering, information engineering | |
| gdc.oaire.sciencefields | 0102 computer and information sciences | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.oaire.sciencefields | 01 natural sciences | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 2.03789988 | |
| gdc.openalex.normalizedpercentile | 0.85 | |
| gdc.opencitations.count | 4 | |
| gdc.plumx.crossrefcites | 4 | |
| gdc.plumx.mendeley | 7 | |
| gdc.plumx.scopuscites | 6 | |
| gdc.scopus.citedcount | 6 | |
| gdc.wos.citedcount | 6 | |
| relation.isAuthorOfPublication.latestForDiscovery | fbb306f8-ddf0-45db-8f73-d66feca793c2 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 9af2b05f-28ac-4014-8abe-a4dfe192da5e |