Welcome to the InfoSci Platform
Location-Aware Caching for Semantic-Based Image Queries in Mobile AD HOC Networks

Location-Aware Caching for Semantic-Based Image Queries in Mobile AD HOC Networks

Bo Yang, Manohar Mareboyana
Copyright: © 2012 |Volume: 3 |Issue: 1 |Pages: 19
ISSN: 1947-8534|EISSN: 1947-8542|EISBN13: 9781466613577|DOI: 10.4018/jmdem.2012010102
Cite Article Cite Article

MLA

Yang, Bo, and Manohar Mareboyana. "Location-Aware Caching for Semantic-Based Image Queries in Mobile AD HOC Networks." IJMDEM vol.3, no.1 2012: pp.17-35. http://doi.org/10.4018/jmdem.2012010102

APA

Yang, B. & Mareboyana, M. (2012). Location-Aware Caching for Semantic-Based Image Queries in Mobile AD HOC Networks. International Journal of Multimedia Data Engineering and Management (IJMDEM), 3(1), 17-35. http://doi.org/10.4018/jmdem.2012010102

Chicago

Yang, Bo, and Manohar Mareboyana. "Location-Aware Caching for Semantic-Based Image Queries in Mobile AD HOC Networks," International Journal of Multimedia Data Engineering and Management (IJMDEM) 3, no.1: 17-35. http://doi.org/10.4018/jmdem.2012010102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Mobile image information retrieval, i.e., the processing of mobile image queries, has attracted research attention due to the recent technological advances in mobile and ubiquitous computing, network infrastructures, and multimedia streaming. The previous research focuses on data delivery, while few works have reported on content-based mobile information retrieval. Therefore, it is important to devise effective means to describe the semantics as well as content distribution of mobile data. Caching is an attractive solution that helps reveal semantic relationships among mobile data sources. However, traditional caching techniques rely on exact match of fixed values and are not efficient in dealing with imprecisely described image data. To address these issues, the authors propose a location-aware caching model which reflects the distribution of images based on the analysis of earlier queries. Through extensive simulations, the authors show that the proposed model can perform search with less cost for voluminous data.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.