Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Grid-based hierarchy structure for mining and querying vehicular ad-hoc networks
Samarah S.  DIVANet 2012 (Proceedings of the 2nd ACM International Symposium on Design and Analysis of Intelligent Vehicular Networks and Applications, Paphos, Cyprus, Oct 21-22, 2012)63-68.2012.Type:Proceedings
Date Reviewed: Jan 3 2013

Emerging research on information systems for vehicular traffic management points to self-organizing information systems built around vehicular ad-hoc networks (VANETs). VANETs provide timely broadcast and geocast capabilities for informing and managing vehicular traffic flow. This paper describes a proposed framework for querying or mining data in this environment. The paper is primarily a short conceptual piece with a simple case study to illustrate the concepts. Numerous typographical errors, misspellings, and English usage errors are annoying but not fatal flaws.

The introduction provides an overview of a possible VANET architecture that is a modification of the statistical information grid (STING) presented previously by Wang, Yang, and Muntz [1]. The approach seeks to balance both temporal and spatial aspects of the problem domain. The next two sections identify the advantageous properties of this grid structure and give a summary of related work in the literature. The fourth section describes the grid structure more formally and explains how it is constructed. The next section presents a simple case study to illustrate application of the grid structure, and the paper closes with a brief conclusion. There are seven figures, an algorithm in pseudocode, and two tables, which help the reader visualize various concepts in the paper.

Naïve readers with little or no exposures to VANETs may benefit from the paper, but experts are likely to have moved well beyond what is presented here.

Reviewer:  M. G. Murphy Review #: CR140794 (1304-0322)
1) Wang, W.; Yang, J.; Muntz, R. STING: a statistical information grid approach to spatial data mining. In Proc. of VLDB ’97 Morgan Kaufmann, 1997, 186–195.
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Distributed Data Structures (E.1 ... )
 
 
Grid computing (C.2.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Distributed Data Structures": Date
Making data structures confluently persistent
Fiat A., Kaplan H. Journal of Algorithms 48(1): 16-58, 2003. Type: Article
Aug 5 2004
LH*RS--a highly-available scalable distributed data structure
Litwin W., Moussa R., Schwarz T. ACM Transactions on Database Systems 30(3): 769-811, 2005. Type: Article
Jan 19 2006
Skip graphs
Aspnes J., Shah G. ACM Transactions on Algorithms 3(4): 37-es, 2007. Type: Article
Apr 16 2008
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy