Advanced Search

Show simple item record

dc.contributor.authorŞentürk, İzzet Fatih
dc.contributor.authorKebe, Gaoussou Youssouf
dc.date.accessioned2021-03-20T20:12:54Z
dc.date.available2021-03-20T20:12:54Z
dc.date.issued2019
dc.identifier.isbn978-1-7281-3964-7
dc.identifier.urihttps://hdl.handle.net/20.500.12885/734
dc.description4th International Conference on Computer Science and Engineering (UBMK) -- SEP 11-15, 2019 -- Samsun, TURKEYen_US
dc.descriptionWOS:000609879900053en_US
dc.description.abstractThis paper presents a heuristic solution to the shortest path routing problem in a road network where source and target locations are defined in a continuous plane. The problem arises when a wireless mobile entity is required to communicate with wireless nodes deployed apart from each other with a distance greater than their communication range and the mobility is limited with the transportation network layout. The goal is constructing a route which minimizes the mobility cost. Travelling salesman problem (TSP) is a classic discrete optimization problem to identify optimal routes between particular cities. Unlike TSP, our problem defines a neighborhood based on the node location and wireless communication range and seeks the optimal path between the neighborhoods. This paper defines mobility cost in terms of distance and delay separately. However, based on the defined cost function, the solution is applicable to other metrics as well including energy consumption.en_US
dc.description.sponsorshipIEEE, IEEE Turkey Secten_US
dc.description.sponsorshipScientific and Technical Research Council of Turkey (TUBITAK)Turkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [EEEAG-117E050]en_US
dc.description.sponsorshipThis work was supported by the Scientific and Technical Research Council of Turkey (TUBITAK) under Grant No. EEEAG-117E050.en_US
dc.language.isoengen_US
dc.publisherIeeeen_US
dc.relation.ispartof2019 4Th International Conference On Computer Science And Engineering (Ubmk)en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjecttravelling salesman problemen_US
dc.subjectcovering salesman problemen_US
dc.subjecttransportation networken_US
dc.subjectgraphen_US
dc.subjectopen street mapen_US
dc.subjectosmnxen_US
dc.titleA Novel Shortest Path Routing Algorithm for Wireless Data Collection in Transportation Networksen_US
dc.typeconferenceObjecten_US
dc.departmentBTÜ, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.authorid0000-0002-1550-563Xen_US
dc.contributor.institutionauthorŞentürk, İzzet Fatih
dc.identifier.startpage280en_US
dc.identifier.endpage284en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record