Low Overhead Query Method for the Interface between Geo-Location Database and Secondary User

Ha-Nguyen TRAN; Hiroshi HARADA

doi:10.1587/transcom.E98.B.714

Low Overhead Query Method for the Interface between Geo-Location Database and Secondary User

Ha-Nguyen TRAN, Hiroshi HARADA

Full Text Views

0

Cite this

Summary :

Accessing a geo-location database is one of the approaches for a secondary user (SU) to obtain the list of available channels for its operation. Channel availability is calculated based on information stored in the geo-location database and information submitted by the SU so that primary users (PU) are protected from harmful interference. The available channel checking process is modeled as a number of intersection tests between the protected contours of PUs and the operation area of the SU regarding to all potential channels. Existing studies indicated that these intersection tests consume time and introduce overhead to the database, especially when the contours or the operation areas are represented by n-polygons and the number of vertices n is a large number. This paper presents a novel method of determining available channels which reduces the number of intersection tests. By submitting SU's preferred channels or the number of channels to be checked to the database, the calculation time and database's load will be reduced significantly. This paper also presents analysis and simulation results of the database workload and the average number of channels obtained per query on different query methods. Suitable query method can be selected based on the number of similar channels in neighbor areas and the maximum number of intersection tests.

Publication: IEICE TRANSACTIONS on Communications Vol.E98-B No.4 pp.714-722

Publication Date: 2015/04/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E98.B.714

Type of Manuscript: PAPER

Category: Wireless Communication Technologies

Authors

Ha-Nguyen TRAN
National Institute of Information and Communications Technology (NICT)
Hiroshi HARADA
National Institute of Information and Communications Technology (NICT)

Keyword

white space, cognitive radio, geo-location database, available channel, polygons intersection

Cite this

Copy

Ha-Nguyen TRAN, Hiroshi HARADA, "Low Overhead Query Method for the Interface between Geo-Location Database and Secondary User" in IEICE TRANSACTIONS on Communications, vol. E98-B, no. 4, pp. 714-722, April 2015, doi: 10.1587/transcom.E98.B.714.
Abstract: Accessing a geo-location database is one of the approaches for a secondary user (SU) to obtain the list of available channels for its operation. Channel availability is calculated based on information stored in the geo-location database and information submitted by the SU so that primary users (PU) are protected from harmful interference. The available channel checking process is modeled as a number of intersection tests between the protected contours of PUs and the operation area of the SU regarding to all potential channels. Existing studies indicated that these intersection tests consume time and introduce overhead to the database, especially when the contours or the operation areas are represented by n-polygons and the number of vertices n is a large number. This paper presents a novel method of determining available channels which reduces the number of intersection tests. By submitting SU's preferred channels or the number of channels to be checked to the database, the calculation time and database's load will be reduced significantly. This paper also presents analysis and simulation results of the database workload and the average number of channels obtained per query on different query methods. Suitable query method can be selected based on the number of similar channels in neighbor areas and the maximum number of intersection tests.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E98.B.714/_p

Copy

@ARTICLE{e98-b_4_714,
author={Ha-Nguyen TRAN, Hiroshi HARADA, },
journal={IEICE TRANSACTIONS on Communications},
title={Low Overhead Query Method for the Interface between Geo-Location Database and Secondary User},
year={2015},
volume={E98-B},
number={4},
pages={714-722},
abstract={Accessing a geo-location database is one of the approaches for a secondary user (SU) to obtain the list of available channels for its operation. Channel availability is calculated based on information stored in the geo-location database and information submitted by the SU so that primary users (PU) are protected from harmful interference. The available channel checking process is modeled as a number of intersection tests between the protected contours of PUs and the operation area of the SU regarding to all potential channels. Existing studies indicated that these intersection tests consume time and introduce overhead to the database, especially when the contours or the operation areas are represented by n-polygons and the number of vertices n is a large number. This paper presents a novel method of determining available channels which reduces the number of intersection tests. By submitting SU's preferred channels or the number of channels to be checked to the database, the calculation time and database's load will be reduced significantly. This paper also presents analysis and simulation results of the database workload and the average number of channels obtained per query on different query methods. Suitable query method can be selected based on the number of similar channels in neighbor areas and the maximum number of intersection tests.},
keywords={},
doi={10.1587/transcom.E98.B.714},
ISSN={1745-1345},
month={April},}

Copy

TY - JOUR
TI - Low Overhead Query Method for the Interface between Geo-Location Database and Secondary User
T2 - IEICE TRANSACTIONS on Communications
SP - 714
EP - 722
AU - Ha-Nguyen TRAN
AU - Hiroshi HARADA
PY - 2015
DO - 10.1587/transcom.E98.B.714
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E98-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2015
AB - Accessing a geo-location database is one of the approaches for a secondary user (SU) to obtain the list of available channels for its operation. Channel availability is calculated based on information stored in the geo-location database and information submitted by the SU so that primary users (PU) are protected from harmful interference. The available channel checking process is modeled as a number of intersection tests between the protected contours of PUs and the operation area of the SU regarding to all potential channels. Existing studies indicated that these intersection tests consume time and introduce overhead to the database, especially when the contours or the operation areas are represented by n-polygons and the number of vertices n is a large number. This paper presents a novel method of determining available channels which reduces the number of intersection tests. By submitting SU's preferred channels or the number of channels to be checked to the database, the calculation time and database's load will be reduced significantly. This paper also presents analysis and simulation results of the database workload and the average number of channels obtained per query on different query methods. Suitable query method can be selected based on the number of similar channels in neighbor areas and the maximum number of intersection tests.
ER -