Adaptive Search Area Configuration for Location-based P2P Networks

Hiroki Hanawa, Takumi Miyoshi, Taku Yamazaki, Thomas Silverston

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper proposes an adaptive peer search method that considers the dynamic users' mobility in location-based peer-to-peer (P2P) networks. In the previous study, the neighbor peer search is periodically executed, and the search area is constantly fixed as a circle regardless of the peers' moving speed. Therefore, it is difficult to properly acquire on neighbor peers, especially in the situation when peers are moving at high speed. In this paper, we suggest a method to determine the peer search interval and the search area size adaptively depending on the peers' locations and moving speed. Simulation results show that the proposed method enables peers to search neighbor peers at appropriate intervals and to obtain nearby information efficiently.

Original languageEnglish
Title of host publication2021 IEEE/ACM 29th International Symposium on Quality of Service, IWQOS 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665414944
DOIs
Publication statusPublished - 2021 Jun 25
Event29th IEEE/ACM International Symposium on Quality of Service, IWQOS 2021 - Virtual, Tokyo, Japan
Duration: 2021 Jun 252021 Jun 28

Publication series

Name2021 IEEE/ACM 29th International Symposium on Quality of Service, IWQOS 2021

Conference

Conference29th IEEE/ACM International Symposium on Quality of Service, IWQOS 2021
Country/TerritoryJapan
CityVirtual, Tokyo
Period21/6/2521/6/28

Keywords

  • adaptive peer search
  • location-based P2P
  • P2P

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems and Management
  • Safety, Risk, Reliability and Quality

Fingerprint

Dive into the research topics of 'Adaptive Search Area Configuration for Location-based P2P Networks'. Together they form a unique fingerprint.

Cite this