Search results

This study aims to propose and evaluate a searching scheme for a bichromatic reverse k-nearest neighbor (BRkNN) that has objects and queries in spatial networks. In this proposed scheme, the author’s search for the BRkNN of the query using an influence zone for each object with a network Voronoi diagram (NVD).

The author’s analyze and evaluate the performance of the proposed searching scheme.

The contribution of this paper is that it confirmed that the proposed searching scheme gives shorter processing time than the conventional linear search.

A future direction of this study will involve making a searching scheme that reduces the processing time when objects move automatically on spatial networks.

In BRkNN, consider two groups in a convenience store, where several convenience stores, which are constructed in Groups A and B, operate in a given region. The author’s can use RNN is RkNN when k = 1 (RNN) effectively to set a new store considering the Euclidean and road distances among stores and the location relationship between Groups A and B.

In the proposed searching scheme, the author’s search for the BRkNN of the query for each object with an NVD using the influence zone, which is the region where an object in the spatial network recognizes the nearest neighbor for the query.

The purpose of this paper is to reduce the waiting time on webcast for selective contents, by proposing a scheduling method called the “contents prefetched broadcasting considering user participation” (CPB‐CP) method.

The authors analyze and evaluate the performance of the proposed CPB‐CP method.

It is confirmed that the proposed method gives shorter average waiting time than the conventional methods.

A future direction of this study will involve making a scheduling method in the case where the playing time of each content item is different.

In selective contents delivery, users may wait for the next bit of content to start playing after watching the previous one. In quiz programs, users may wait to receive the content data for their selected answer after they select their answer.

In the CPB‐CP method, when a provider node pulls out of the network while delivering contents, waiting time is reduced effectively by reconstructing a delivery schedule that considers the available bandwidth of each provider node.

The purpose of this paper is to propose a scheduling method called the “Asynchronous Harmonic Broadcasting Considering Commercial (AHB‐CC)” method, to reduce waiting time for continuous media data broadcasting.

The authors analyze and evaluate the performance of the proposed AHB‐CC method.

The authors confirm that the proposed method gives shorter average waiting times than the conventional methods.

A future direction of this study will involve making a scheduling method where the server concurrently broadcasts data and commercial contents. Also, maximum buffer size needs to be considered.

In general broadcasting systems, the server broadcasts the same data repetitively and clients wait until the first portion of the data is broadcast. Although the server can deliver the data to many clients concurrently, clients have to wait until their desired data are broadcast.

The AHB‐CC method presented in the paper further reduces waiting time by scheduling an effective broadcast that considers the playing time of commercial contents.

The purpose of this paper is to propose a scheduling method called the “Hierarchical Asynchronous Harmonic Broadcasting (H‐AHB)” method, to reduce the waiting time for heterogeneous clients.

The authors analyze and evaluate the performance of the proposed H‐AHB method.

It was confirmed that the proposed method gives shorter average waiting time than the conventional methods.

A future direction of this study will involve making a scheduling method where the server broadcasts multiple videos.

In general broadcasting systems, the server broadcasts the same data repetitively and clients wait until the first portion of the data is broadcast. Although the server can deliver the data to many clients concurrently, clients have to wait until their desired data are broadcast.

The H‐AHB method further reduces waiting time by scheduling an effective broadcast that considers the number of clients' available channels.