Abstract

Skyline query-processing techniques considering various properties in peer to peer (P2P)-based services have become a recent topic of research. In this paper, we propose a new skyline query-processing scheme to improve the query-processing performance and accuracy in a mobile P2P service over delay-tolerant networks. The proposed scheme collects data on the query object from neighboring nodes and establishes a local skyline through static properties to reduce query-processing costs. To improve the query accuracy in a non-uniform distribution environment, the query-dissemination range is expanded by enforcing a query-dissemination range expansion. The performance evaluation conducted to verify the superiority of the proposed scheme demonstrates that it has a better performance compared to the existing schemes.

Highlights

  • The existing Transmission Control Protocol/Internet Protocol (TCP/IP) based on end-to-end connectivity is difficult to apply in a long-latency, low data rate, and intermittent connectivity environment

  • There are currently many ongoing studies on the topic of mobile P2P (MP2P) services that include mobility in the delay-tolerant network (DTN), following the increased use of wireless devices such as smartphones, tablet PCs, and laptops resulting from advancements in mobile communication [7,8]

  • The query node selects a local skyline object as the filtering object that has the smallest value of distance between the points and line (DPL), where DPL is the distance from a skyline object to line that passes the point o and mode point (MP)

Read more

Summary

Introduction

The existing Transmission Control Protocol/Internet Protocol (TCP/IP) based on end-to-end connectivity is difficult to apply in a long-latency, low data rate, and intermittent connectivity environment. On the other hand, [31] proposed the distance between the points and line (DPL), in which objects are filtered by using the mode value to reduce communication costs in a non-uniform distribution environment These existing schemes process local skyline requests by collecting object data for each node’s query and merge the query results of each node in order to generate the final query-processing results. The proposed scheme generates candidate-filtering object groups by establishing a local skyline through data dissemination with neighboring nodes in order to reduce communication costs and improve query-processing speeds. It processes queries by expanding the query dissemination range to improve the query-processing accuracy in a non-uniform distribution environment.

Related Work
Overall Architecture
Proposed
Data Structure
Local Skyline Processing
Merging
Performance Evaluation
Number
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call