Application of neighborhood sequences in communication of hexagonal networks

Simple item page
dc.contributor.authorNagy, Benedek
dc.date.accessioned2026-02-06T18:37:37Z
dc.date.issued2017
dc.departmentDoğu Akdeniz Üniversitesi
dc.description.abstractIn this paper communication in hexagonal network is analyzed. Every vertex of the network has direct connections to its neighbors. They communicate with neighborhood sequences varying the used neighborhood relations in each step. Theoretical results, such as algorithm to provide a shortest path and properties of B-distances are shown. Applications for broadcasting information and for two-way communications are presented and discussed. (C) 2015 Elsevier B.V. All rights reserved.
dc.description.sponsorship[GOP-1.1.1-11-2012-0026]
dc.description.sponsorshipThe work is partially supported by GOP-1.1.1-11-2012-0026.
dc.identifier.doi10.1016/j.dam.2015.10.034
dc.identifier.endpage440
dc.identifier.issn0166-218X
dc.identifier.issn1872-6771
dc.identifier.scopus2-s2.0-84947753596
dc.identifier.scopusqualityQ2
dc.identifier.startpage424
dc.identifier.urihttps://doi.org/10.1016/j.dam.2015.10.034
dc.identifier.urihttps://hdl.handle.net/11129/12561
dc.identifier.volume216
dc.identifier.wosWOS:000390504100009
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherElsevier Science Bv
dc.relation.ispartofDiscrete Applied Mathematics
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectNeighborhood sequences
dc.subjectHexagonal network
dc.subjectDigital distances
dc.subjectDigital discs
dc.subjectCommunication
dc.subjectVarious signal speed
dc.titleApplication of neighborhood sequences in communication of hexagonal networks
dc.typeArticle

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu