PETAL: a fully distributed location service for wireless ad hoc networks

Simple item page
buir.contributor.authorUlusoy, Özgür
buir.contributor.authorGüdükbay, Uğur
dc.citation.epage11en_US
dc.citation.spage1en_US
dc.citation.volumeNumber83en_US
dc.contributor.authorIlkhechi, A. R.en_US
dc.contributor.authorKorpeoglu, I.en_US
dc.contributor.authorGüdükbay, Uğuren_US
dc.contributor.authorUlusoy, Özgüren_US
dc.date.accessioned2018-04-12T11:11:20Z
dc.date.available2018-04-12T11:11:20Z
dc.date.issued2017en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractLocation service is an essential prerequisite for mobile wireless ad hoc networks (MANETs) in which the underlying routing protocol leverages physical location information of sender and receiver nodes. Fulfillment of this requirement is challenging partly due to the mobility and unpredictability of nodes in MANETs. Moreover, scalability and location information availability under various circumstances are also substantial factors in designing an effective location service paradigm. By and large, utilizing centralized or distributed location servers responsible for storing the location information of all, or a subset of participant mobile devices, is a method employed in a significant portion of location service schemes. However, from the fairness point of view, it is more suitable to employ a location service scheme that treats participant nodes fairly, without mandating an unlucky subset to undertake the responsibility of serving as location server(s). In this work, we propose a scalable and fully decentralized location service scheme (PETAL) in which the burden of location update and inquiry tasks is almost evenly distributed among the nodes, resulting in an improvement in resilience against individual node failures. PETAL does not require hashing which results in more complexity, it is resilient against swarm mobility pattern, it requires minimal periodic location update messages when nodes do not move, and finally it does not require too many parameter configurations on all nodes. Our simulation results reveal that PETAL performs efficiently, particularly in environments densely populated by wireless devices. © 2017 Elsevier Ltden_US
dc.embargo.release2019-04-01en_US
dc.identifier.doi10.1016/j.jnca.2017.01.021en_US
dc.identifier.issn1084-8045
dc.identifier.urihttp://hdl.handle.net/11693/37361
dc.language.isoEnglishen_US
dc.publisherAcademic Pressen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.jnca.2017.01.021en_US
dc.source.titleJournal of Network and Computer Applicationsen_US
dc.subjectAd hoc networksen_US
dc.subjectComplex networksen_US
dc.subjectLocationen_US
dc.subjectMobile telecommunication systemsen_US
dc.subjectNetwork routingen_US
dc.subjectWireless ad hoc networksen_US
dc.subjectDistributed location servicesen_US
dc.subjectEffective locationen_US
dc.subjectGeographical routingen_US
dc.subjectLocation informationen_US
dc.subjectLocation servicesen_US
dc.subjectMobile wireless ad hoc networksen_US
dc.subjectSender and receiversen_US
dc.subjectSwarm mobilitiesen_US
dc.subjectMobile ad hoc networksen_US
dc.titlePETAL: a fully distributed location service for wireless ad hoc networksen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
PETAL__A_fully_distributed_location_service_for_wireless_ad_hoc_networks.pdf
Size:
1.21 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Computer Engineering