Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/2362
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dağdeviren, Orhan | - |
dc.contributor.author | Erciyeş, Kayhan | - |
dc.date.accessioned | 2016-11-01T13:12:34Z | |
dc.date.available | 2016-11-01T13:12:34Z | |
dc.date.issued | 2008 | |
dc.identifier.citation | Dağdeviren, O., and Erciyeş, K. (2008). A hierarchical leader election protocol for mobile ad hoc networks. Lecture Notes in Computer Science, 5101 LNCS(PART 1), 509-518. doi:10.1007/978-3-540-69384-0_56 | en_US |
dc.identifier.isbn | 9783540693833 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | http://doi.org/10.1007/978-3-540-69384-0_56 | |
dc.identifier.uri | http://hdl.handle.net/11147/2362 | |
dc.description | 8th International Conference on Computational Science, ICCS 2008; Krakow; Poland; 23 June 2008 through 25 June 2008 | en_US |
dc.description.abstract | Leader Election is an important problem in mobile ad hoc networks and in distributed computing systems. In this study, we propose a hierarchical, cluster based protocol to elect a leader in a mobile ad hoc network. The initial phase of the protocol employs a clustering algorithm to group nodes of the network after which a leader for a cluster(clusterhead) is elected. The second phase is performed by forming a connected ring of these leaders using the Ring Formation Algorithm. Finally, Chang Roberts Leader Election Algorithm for rings is employed in the final phase to elect the super-leader among the clusterheads. We provide performance results of this protocol for various mobility parameters and analyze its time and message complexities. | en_US |
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 | Ad hoc networks | en_US |
dc.subject | Chang Roberts algorithm | en_US |
dc.subject | Leader election | en_US |
dc.subject | Telecommunication networks | en_US |
dc.subject | Wireless networks | en_US |
dc.title | A hierarchical leader election protocol for mobile ad hoc networks | en_US |
dc.type | Conference Object | en_US |
dc.authorid | TR15997 | en_US |
dc.institutionauthor | Dağdeviren, Orhan | - |
dc.institutionauthor | Erciyeş, Kayhan | - |
dc.department | İzmir Institute of Technology. Computer Engineering | en_US |
dc.identifier.volume | 5101 LNCS | en_US |
dc.identifier.issue | PART 1 | en_US |
dc.identifier.startpage | 509 | en_US |
dc.identifier.endpage | 518 | en_US |
dc.identifier.wos | WOS:000257188800053 | en_US |
dc.identifier.scopus | 2-s2.0-47749119264 | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.doi | 10.1007/978-3-540-69384-0_56 | - |
dc.relation.doi | 10.1007/978-3-540-69384-0_56 | en_US |
dc.coverage.doi | 10.1007/978-3-540-69384-0_56 | en_US |
dc.identifier.wosquality | N/A | - |
dc.identifier.scopusquality | Q3 | - |
dc.identifier.wosqualityttp | Top10% | en_US |
item.fulltext | With Fulltext | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.openairetype | Conference Object | - |
crisitem.author.dept | 03.04. Department of Computer Engineering | - |
crisitem.author.dept | 03.04. Department of Computer Engineering | - |
Appears in Collections: | Computer Engineering / Bilgisayar Mühendisliği Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
20
checked on Nov 15, 2024
WEB OF SCIENCETM
Citations
12
checked on Nov 9, 2024
Page view(s)
288
checked on Nov 18, 2024
Download(s)
184
checked on Nov 18, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.