Safe Regions for Moving Reverse Neighbourhood Queries in a Peer-to-Peer Environment

Abstract

The peer-to-peer (P2P) paradigm has become very popular for storing and sharing information. In most P2P systems, peers are connected by means of a limited range of uniform networks, leading to issues when some connected peers are isolated from the others. In order to address such issues, isolated peers rely on devices with long-range networks to relay their messages. However, since long-range devices can move freely, the set of connected peers may lose their connection. Hence, it is important not only to identify, but also to maximise the area known as the safe region (SR) where a long-range device can move freely while still maintaining connection with its peers. This paper illustrates an innovative and generic monitoring framework that addresses the issues related to frequent query location updating using a systematic approach. In our approach, we propose to apply the Reverse Nearest Neighbourhood (RNNH) concept in a P2P environment to efficiently identify and maximise the irregularly shaped area of the SR up to four times for the potential movement of the long-range devices. It was found that there is no need for costly re-computation when the query is retained within the SR. Monte-Carlo simulation was performed to calculate the area of the SR by weighing in shape irregularity. Experimental results demonstrate the effectiveness and efficiency of our approach. INDEX TERMS Moving query, query processing, reverse nearest neighbourhood, safe region.

Neighborhood Query Processing and Surrounding Objects Retrieval in Spatial Databases: Applications and Algorithms

“…The strict definition of neighborhoods (Definition 1), which models neighborhoods by circles [3,5], can be relaxed in the future works. For example, a few recent works on nearest neighborhood retrieval modeled neighborhoods based on the connectivity idea of density based clusters [1,2]. The work in [2] developed safe region based algorithms for moving RNHQ queries in peer-to-peer environments.…”

“…For example, a few recent works on nearest neighborhood retrieval modeled neighborhoods based on the connectivity idea of density based clusters [1,2]. The work in [2] developed safe region based algorithms for moving RNHQ queries in peer-to-peer environments. Both NHQ and RNHQ queries can be extended further in the road networks where the road network distance is found to be more useful than the Euclidean-based distance measures.…”

Monitoring Spatial Keyword Queries Based on Resident Domains of Mobile Objects in IoT Environments

“…For continuously monitoring spatial queries, the safe zone concept [21][22][23][24][25] was proposed to reduce frequent location updating from the mobile objects to the central server. A safe zone assigned to the mobile object is the area that contains the object and does not overlap the other query regions.…”

Independent Map Enhancement for a Spatial Road Network: Fundamental Applications and Opportunities

“…Note that the issue of isolated neighborhoods can be resolved using long-range communication, which enables two neighborhoods to communicate with each other. This can be achieved by using a wireless mesh network system, which can combine two types of communication: shortrange and long-range [39]. Figure 11a gives an example of a centralized system.…”

“…It is clear from Figure 11b that other objects now allow more objects, such as O 8 (similarly O 9 , O 1 , O 2 , and O 3 ), to join the communications within the network environment. Moreover, the neighborhoods are able now to communicate with each other because of the combination of two types of communication: short-range and long-range [39]. An independent map enhancement approach is a method whereby maps are updated, reviewed, and renewed based on users' movements.…”