Efficient Windows Query Processing with. Expanded Grid Cells on Wireless Spatial Data. Broadcasting for Pervasive Computing

Similar documents
A Distributed Air Index Based on Maximum Boundary Rectangle over Grid-Cells for Wireless Non-Flat Spatial Data Broadcast

A New Energy-Aware Routing Protocol for. Improving Path Stability in Ad-hoc Networks

Implementation of Semantic Information Retrieval. System in Mobile Environment

Adaptive Aggregation Scheduling Using. Aggregation-degree Control in Sensor Network

Data Indexing for Heterogeneous Multiple Broadcast Channel

On Reducing Communication Cost for Distributed Moving Query Monitoring Systems

Evaluation of Ad-hoc Routing Protocols with. Different Mobility Models for Warfield. Scenarios

Efficient Mobile Content-Centric Networking. Using Fast Duplicate Name Prefix Detection. Mechanism

Adaptive Cell-Size HoG Based. Object Tracking with Particle Filter

Pipelined Architecture of Dynamic Bandwidth. Allocation for Energy Efficiency in XG-PON

Applicability Estimation of Mobile Mapping. System for Road Management

The advent of sensor, wireless, and INFORMATION DISSEMINATION. via Wireless Broadcast. By Baihua Zheng and Dik Lun Lee

Improved Integral Histogram Algorithm. for Big Sized Images in CUDA Environment

Hybrid Cooperative Caching in a Mobile Environment

Implementation on Real Time Public. Transportation Information Using GSM Query. Response System

Security Flaws of Cheng et al. s Biometric-based Remote User Authentication Scheme Using Quadratic Residues

A Ship Area Network with WiMedia Wireless. Gateway Applying a Cooperative Transmission

A Survey on Disk-based Genome. Sequence Indexing

Robust EC-PAKA Protocol for Wireless Mobile Networks

Search K Nearest Neighbors on Air

Two-Tier Air Indexing for On-Demand XML Data Broadcast

On Processing Location Based Top-k Queries in the Wireless Broadcasting System

Grid-Partition Index: A Hybrid Method for Nearest-Neighbor Queries in Wireless Location-Based Services

The Area Code Tree for Nearest Neighbour Searching

Research Article MFT-MAC: A Duty-Cycle MAC Protocol Using Multiframe Transmission for Wireless Sensor Networks

Solving a Two Dimensional Unsteady-State. Flow Problem by Meshless Method

On the Parallel Implementation of Best Fit Decreasing Algorithm in Matlab

Data Access on Wireless Broadcast Channels using Keywords

A Simple Sink Mobility Support Algorithm for Routing Protocols in Wireless Sensor Networks

Distributed CoAP Handover Using Distributed Mobility Agents in Internet-of-Things Networks

An Efficient Bandwidth Estimation Schemes used in Wireless Mesh Networks

Spatial Queries in Wireless Broadcast Environments

Continuous Monitoring of Spatial Queries in Wireless Broadcast Environments

Graph Sampling Approach for Reducing. Computational Complexity of. Large-Scale Social Network

AN EFFICIENT MAC PROTOCOL FOR SUPPORTING QOS IN WIRELESS SENSOR NETWORKS

A Distributed Spatial Index for Error-Prone Wireless Data Broadcast

A Study on Multi-resolution Screen based Conference Broadcasting Technology


Problems of Sensor Placement for Intelligent Environments of Robotic Testbeds

An Edge-Based Algorithm for Spatial Query Processing in Real-Life Road Networks

Development of Smart-CITY Based Convergent Contents Platform Using Bluetooth Low Energy Beacon Sensors

Java Vulnerability Analysis with JAPCT: Java. Access Permission Checking Tree

Indexing Techniques for Wireless Data Broadcast under Data Clustering and Scheduling

Nodes Energy Conserving Algorithms to prevent Partitioning in Wireless Sensor Networks

Solutions of Stochastic Coalitional Games

The Number of Fuzzy Subgroups of Cuboid Group

Byte Index Chunking Approach for Data Compression

Location-Based Data Dissemination for Spatial Queries in Wireless Broadcast Environments

Energy-efficient Data Dissemination in Wireless Sensor Networks

Mobile Edge Computing for 5G: The Communication Perspective

Groups with Isomorphic Tables of Marks Orders: 32, 48, 72 and 80 1

Convergence Point Adjustment Methods for Minimizing Visual Discomfort Due to a Stereoscopic Camera

Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks

Bitmap lattice index in road networks

Cryptanalysis and Improvement of a New. Ultra-lightweight RFID Authentication. Protocol with Permutation

The Generalized Stability Indicator of. Fragment of the Network. II Critical Performance Event

A Timer-based Session Setup Procedure in Cellular-WLAN Integrated Systems

QoS based vertical handoff method between UMTS systems and wireless LAN networks

(JBE Vol. 23, No. 6, November 2018) Detection of Frame Deletion Using Convolutional Neural Network. Abstract

Scanline-based rendering of 2D vector graphics

Spatial Queries in Wireless Broadcast Systems

Improved MAC protocol for urgent data transmission in wireless healthcare monitoring sensor networks

Spray and forward: Efficient routing based on the Markov location prediction model for DTNs

A Texture Extraction Technique for. Cloth Pattern Identification

An Adaptive Bandwidth Reservation Scheme for Multimedia Mobile Cellular Networks

Solution of Maximum Clique Problem. by Using Branch and Bound Method

A Time-based Recommender System using Implicit Feedback

An Energy Efficient Coverage Method for Clustered Wireless Sensor Networks

A Memory Management Scheme for Hybrid Memory Architecture in Mission Critical Computers

A Load Balancing Scheme for Games in Wireless Sensor Networks

Heronian Mean Labeling of. Disconnected Graphs

A New Secure Mutual Authentication Scheme with Smart Cards Using Bilinear Pairings

Distributed k-nn Query Processing for Location Services

A Novel Replication Strategy for Efficient XML Data Broadcast in Wireless Mobile Networks

Hyperbola for Curvilinear Interpolation

Energy-Efficient Mobile Cache Invalidation

A Hybrid Approach to Parallel Connected Component Labeling Using CUDA

Volume 6, Issue 12, December 2018 International Journal of Advance Research in Computer Science and Management Studies

Stochastic Coalitional Games with Constant Matrix of Transition Probabilities

A Comparative Study on Optimization Techniques for Solving Multi-objective Geometric Programming Problems

A Hybrid Peer-to-Peer Architecture for Global Geospatial Web Service Discovery

Cross-Layer Optimized Architecture of MBS over Mobile WiMAX

Efficient Adjacent Neighbor Expansion Search Keyword

NSF-RCN Workshop #2 Panel 2

The b-chromatic Number of Bistar Graph

Complete Bipartite Graphs with No Rainbow Paths

ijade Reporter An Intelligent Multi-agent Based Context Aware News Reporting System

The Study of Genetic Algorithm-based Task Scheduling for Cloud Computing

IEEE Wireless Coexistence Working Group (WG)

Comparative Evaluation of Probabilistic and Deterministic Tag Anti-collision Protocols for RFID Networks

INTERNATIONAL JOURNAL OF RESEARCH SCIENCE & MANAGEMENT

Using Ones Assignment Method and. Robust s Ranking Technique

Highlight Detection in Personal Broadcasting by Analysing Chat Traffic : Game Contests as a Test Case

Privacy Preservation Approach Using Grid Base Techniques for Mobile Users

LECTURE 2 SPATIAL DATA MODELS

Localized and Incremental Monitoring of Reverse Nearest Neighbor Queries in Wireless Sensor Networks 1

Proficient ID Allocation for MANETs

Object Placement in Shared Nothing Architecture Zhen He, Jeffrey Xu Yu and Stephen Blackburn Λ

Performance Analysis of Hierarchical Mobile IPv6 in IP-based Cellular Networks

PREDICTING NUMBER OF HOPS IN THE COOPERATION ZONE BASED ON ZONE BASED SCHEME

Transcription:

Contemporary Engineering Sciences, Vol. 7, 2014, no. 16, 785 790 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ces.2014.4691 Efficient Windows Query Processing with Expanded Grid Cells on Wireless Spatial Data Broadcasting for Pervasive Computing Seokjin Im Dept. of Computer Engineering, SungKyul University Anyang, Gyeonggido, Korea Kil Hong Joo Dept. of Computer Education, Gyeongin National University of Education Anyang, Gyeonggido, Korea Jintak Choi Dept. of Computer Science, Incheon National University, Incheon, Korea Copyright 2014 Seokjin Im, Kilhong Joo and Jintak Choi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Smart mobile devices and advanced wireless networks make the vision of pervasive computing come into reality through context aware services. A wireless spatial data broadcasting is a natural way of pervasive information services by providing information related to mobile clients' location context to an arbitrary number of clients. To support location aware information services efficiently, we propose a spatial index based on expanded grid cells, named SIEC, aiming at spatial data broadcasting on air. The SIEC is organized with expanded cells of a regular grid partition for spatial data items, allows mobile clients to quickly access the queried data items by lowering the number of grid cells the clients have to access. Simulation studies show that the proposed scheme outperforms the existing schemes regarding the access time, tuning time, and energy consumed while processing given queries.

786 Seokjin Im, Kilhong Joo and Jintak Choi Keywords: Pervasive Computing, Wireless Spatial Data Broadcast, Distributed Indexing Scheme, Grid Partition, Expanded Cell, Window Query 1. Introduction Wearable devices and smart mobile ones such as Google Glass and smart phones equipped with mobile communication technology like 4th generation technology leverage the vision of pervasive computing [1]. A wireless data broadcasting system for spatial data items is a natural way to resolve the two challenge, i.e., scalability and location, because it can provide location dependent information services efficiently regardless of the number of clients [2, 3]. A server disseminates spatial data items in buckets, the smallest logical access unit, via a wireless channel, and then clients access the channel, retrieve desired data items, and download them from the channel [4, 5, 6]. Thus, the system can accommodate an arbitrary number of clients simultaneously. Here, a spatial data item keeps the location of a feature on the ground, such as a shopping mall, with the latitude and longitude as well as a content about the feature. With the system, clients can obtain location dependent information related to their current locations through processing window queries to retrieve spatial data items within a given query window or k Nearest Neighbors (knn) queries to retrieve k nearest data items from a given query point [5]. A client, for example, can find shopping malls within a 1km square centered at its current location in a metropolitan area such as San Francisco or find 3 nearest gas stations from its location. 2. Related Works The broadcasting adopts air indexing schemes to allow clients to reduce the energy consumption by listening selectively to the data items they desire. An index is broadcast in an interleaved manner with data items on the wireless channel, that holds the time when each data item appears on the channel. With the index on the channel, clients can predict the times when their desired data items appear. This allows the clients to stay in doze mode for energy-saving by the times predicted. A client processes a given query as below: Initial probe: With the first bucket accessed after tuning in the wireless channel, a client determines the time when the index appears on the channel and switches to doze mode by the time. Index search and data download: The client wakes up to active mode at the time the index appears and accesses the index on the wireless channel. Then, the client extracts the queried data items with the index and decides the times when the items appear on the channel. The client waits for the data items in doze mode till the time decided; then, it wakes up at the time in active mode and downloads the data items. Air indexes are allocated in two schemes, (1,m) index allocation scheme and distributed indexing scheme. In (1,m) indexing scheme, an index of entire data

Efficient Windows query processing 787 items to broadcast is repeated m times for every 1/m data fraction. Distributed index allocation scheme distributes the indexes of partitions of data items to broadcast with the partitions. The authors propose CEll-based Distributed Index (CEDI) in [6] to support window queries. CEDI is organized over a regular grid partition of data space and holds real locations of data items with coordinates. CEDI outperforms HCI and DSI because of listening to only queried data items by extracting them with real coordinates, unlike HCI and DSI. In [7], the authors propose Cell-based Hybrid Index (CHI) on a regular cell-partition alike CEDI to support knn queries. CHI provides global knowledge of data distribution along with local knowledge to decide quickly the search space guaranteeing knn and to prune the queried knn from the search space. CEDI and CHI, however, make clients access excessive cells when query windows are overlapped slightly with neighboring cells. Those results in the performances deteriorated. 3. Spatial Indexed based on Expanded Grid Cells We present a spatial data index based on expanded grid cells (SIEC) for a wireless data broadcasting system and a window query processing algorithm with SIEC. The proposed SIEC purposes that clients quickly obtain the answer to a given window query by reducing the number of grid cells to access for a given window query. As the environment for the proposed SIEC, we consider a broadcasting system, in which a server disseminates a set of N spatial data items, {d1,, dn}, via a high-bandwidth wireless channel and then clients access the channel and download queried data items. Here, the data items are on a two-dimensional region, called data space D, and their locations are described with the longitude and latitude as ones of stationary features on the ground such as shopping malls. For example, Figure 1(a) shows nine spatial data items, {d0,d1,, d8} on D that are about shopping malls. (a) Data space (b) grid for Figure 1(a) Figure 1: Data space D and its grid partition

788 Seokjin Im, Kilhong Joo and Jintak Choi To organize the proposed SIEC, we partition D into a regular n n grid, where is the length of all sides of the grid cells and e is the expanding factor, the ratio of the expanded length of sides of cells to. Each grid cell has the expanded coverage within D, that is, a square of +2e. We label the i-th row as ri (0 i < n) with r0 as the bottom row, and the j-th cell in Z-order as cj (0 j < n 2 ), with c0 as the first cell. For example, Figure 1(b) depicts a 4 4 grid laid upon D in Figure 1(a), where e is 0.25; rows are labeled from r0 to r3; cells are labeled from c0 to c15. The coverage in gray shows c6 expanded by e that contains d5 of c7 as well as d2 and d3. In order for a client to process a window query with a query window, such as qw in Figure 1(b), the proposed SIEC allows the clients to access only cell c6, rather than six cells, i.e., c2, c3, c6, c7, c10, and c11. This makes SIEC different from the other existing schemes using a regular grid partition. 4. Index Structure and Channel Organization SIEC has two kinds of indexing tables: a row table RTi for ri and a cell table CTj for cj. Row table RTi is defined as a table that keeps information about: what rows of the grid have data items, the broadcasting time for the rows, what cells in ri have data items, and the broadcasting time for the cells. RTi is organized as follows: (1) (Row Information):, where is the row having data items and is the time when of is broadcast on the wireless channel. (Cell Information):, where is a cell of that has data items and is the time when for is broadcast on the wireless channel. RI and CI provide clients with links to access other rows and cells efficiently. The links enable clients to take various multiple paths to a cell they try to access for a given query and result in the access time improved. Cell table CTj is defined as a table that keeps information about: the locations of data items within cj, the times when the items are appearing on the channel, the row and cell appearing immediately after cj on the channel and their broadcasting time. CTj is organized as follows: (2) is the broadcasting time for the row table appearing immediately after on the wireless channel.

Efficient Windows query processing 789 : is the cell appearing immediately after on the wireless channel and is the broadcasting time for the cell table of. (Data Table): and help clients access the neighboring row and cell, respectively. Data table enables clients to extract the queried data items within a given query window using real locations, before accessing them. With the proposed SIEC, the wireless channel is structured in row major order as follows. Row tables are placed in row number's increasing order. Row table RTi is followed by cell tables for the cells of ri. Cell table CTj is also followed the data items in cj. 5. Performance Evaluation To evaluate the performance of the proposed SIEC, we compare the scheme with the existing indexing schemes for spatial data regarding the access time and tuning time. Figure 2(a) shows the access time over various query sizes. The figure reveals that the proposed SIEC outperforms the existing indexing schemes for various query size, especially CEDI based on the grid partition like SIEC. That results from the reduced number of cells to access for a given query by adopting the expanded grid cells. The reduced number leads to quickly completing the given query. In addition, the links SIEC provides play the role of dropping down the access time by allowing multiple access paths to a target cell. Figure 2(b) shows the access time in details when query size is 0.08. The access time of SIEC is about 89 % and 83 % of CEDI and DSI, respectively. (a)access time over various query size (b) Access time at query size, 0.08 Figure 2: Comparison of SIEC with other schemes regarding the access time

790 Seokjin Im, Kilhong Joo and Jintak Choi 6. Conclusion In this paper, we have addressed processing window queries on the wireless spatial data broadcast stream for pervasive computing. We proposed a Spatial data Index based on Expanded grid Cells(SIEC) to support efficiently location dependent information service, one of the context-aware computing services. SIEC is organized over a regular grid partition with each grid cell expanded by a given factor in order to reduce the number of cells that clients have to access to get the queried data items when a given query window overlaps slightly with neighboring cells. The expansion makes SIEC unique from the other indexing schemes using a regular grid partition. SIEC with link information to rows and cells provides multiple access paths to a target cell in order to help clients access the cell efficiently. For the future study, we are investigating k nearest neighbors over expanded grid cells. Acknowledgements. This research was supported by the Incheon National University (International Cooperative) Research Grant in 2013 References [1] M. Satyanarayanan, Pervasive Computing: Vision and Challenges, IEEE Personal Communications 8 (4) (2001) 10-17. [2] T.Imielinski, S.Viswanathan and B.R.Bardrinath, Data on air: Organization and access, IEEE Transactions on Knowledge and Data Engineering 9 (3) (1997) 353-372. [3] T.Imielinski, S.Viswanathan, and B.R. Badrinath, Energy efficient indexing on air, Proceedings of the International Conference on Management of Data, (1994) 25-36. [4] B. Zheng, W.C. Lee, and D.L. Lee, Spatial Index on Air, Proceedings of the 1st IEEE International Conference on Pervasive Computing and Communications, (2003) 297-304. [5] B. Zheng, W.C. Lee, and D.L. Lee, Spatial Queries in Wireless Broadcast Systems, Wireless Network, 10 (6) (2004) 723-736. [6] SeokJin Im, MoonBae Song, Jongwan Kim, Sang-Won Kang, Chong-Sun Hwang, An Error-Resilient Cell-Based Distributed Index for Location-based Wireless Broadcast Services, Proceedings of ACM Workshop MobiDE06, (2006) 59-66. [7] R. McNab and F.W. Howell, Using Java for Discrete Event Simulation, Proceedings of the Twelfth UK Computer and Telecommunications Performance Engineering Workshop, (1996) 219-228. Received: May 1, 2014