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

Author(s):  
Bo Yang ◽  
Manohar Mareboyana

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.

2001 ◽  
Vol 36 (5-6) ◽  
pp. 659-670 ◽  
Author(s):  
Stefano Basagni ◽  
Imrich Chlamtac ◽  
Violet R. Syrotiuk

2018 ◽  
Vol 2018 ◽  
pp. 1-10
Author(s):  
Farrukh Aslam Khan ◽  
Wang-Cheol Song ◽  
Khi-Jung Ahn

In this paper, the performance analysis of a hierarchical routing protocol for mobile ad hoc networks (MANETs) called Location-aware Grid-based Hierarchical Routing (LGHR) is performed. In LGHR, the network comprises nonoverlapping zones and each zone is further partitioned into smaller grids. Although LGHR is a location-aware routing protocol, the routing mechanism is similar to the link-state routing. The protocol overcomes some of the weaknesses of other existing location-based routing protocols such as Zone-based Hierarchical Link State (ZHLS) and GRID. A detailed analysis of the LGHR routing protocol is performed and its performance is compared with both the above-mentioned protocols. The comparison shows that LGHR works better than ZHLS in terms of storage overhead as well as communication overhead, whereas LGHR is more stable than GRID especially in scenarios where wireless nodes are moving with very high velocities.


Author(s):  
Gongjun Yan ◽  
Stephan Olariu ◽  
Shaharuddin Salleh

The key attribute that distinguishes Vehicular Ad hoc Networks (VANET) from Mobile Ad hoc Networks (MANET) is scale. While MANET networks involve up to one hundred nodes and are short lived, being deployed in support of special-purpose operations, VANET networks involve millions of vehicles on thousands of kilometers of highways and city streets. Being mission-driven, MANET mobility is inherently limited by the application at hand. In most MANET applications, mobility occurs at low speed. By contrast, VANET networks involve vehicles that move at high speed, often well beyond what is reasonable or legally stipulated. Given the scale of its mobility and number of actors involved, the topology of VANET is changing constantly and, as a result, both individual links and routing paths are inherently unstable. Motivated by this latter truism, the authors propose a probability model for link duration based on realistic vehicular dynamics and radio propagation assumptions. The paper illustrates how the proposed model can be incorporated in a routing protocol, which results in paths that are easier to construct and maintain. Extensive simulation results confirm that this probabilistic routing protocol results in more easily maintainable paths.


2007 ◽  
Vol 25 (8) ◽  
pp. 1590-1602 ◽  
Author(s):  
Marios Dikaiakos ◽  
Andreas Florides ◽  
Tamer Nadeem ◽  
Liviu Iftode

Sign in / Sign up

Export Citation Format

Share Document