EFFICIENT BROADCAST INDEXING SCHEME FOR LOCATION-DEPENDENT QUERIES IN MULTI CHANNELS WIRELESS ENVIRONMENT

2005 ◽  
Vol 06 (03) ◽  
pp. 303-321 ◽  
Author(s):  
AGUSTINUS BORGY WALUYO ◽  
BALA SRINIVASAN ◽  
DAVID TANIAR

Data dissemination scheme has been of great interest due to its scalability. In mobile environment, the advantage of such scheme is significant considering the inherent limitations of wireless environment. The application of broadcast indexing scheme in a wireless broadcast environment is necessary to help mobile clients to find the desired data instances efficiently. In this paper, we present a novel index structure called global indexing scheme for location-dependent queries. The proposed scheme is applied in a multi channel wireless environment and designed to serve queries efficiently in which the queries result depend on the mobile clients' current location. We develop a simulation model to find out the access time, tuning time and power consumption performance of global indexing scheme as compared to non-global indexing scheme. Additionally, we analyse the efficiency of valid scope used in the global index scheme as compared with an existing valid scope. It is found that global index performs substantially better than the existing indexing concept.

2010 ◽  
Vol 21 (1) ◽  
pp. 58-79 ◽  
Author(s):  
Jun Pyo Park ◽  
Chang-Sup Park ◽  
Yon Dohn Chung

In this article, we address the problem of delayed query processing raised by tree-based index structures in wireless broadcast environments, which increases the access time of mobile clients. We propose a novel distributed index structure and a clustering strategy for streaming XML data that enables energy and latencyefficient broadcasting of XML data. We first define the DIX node structure to implement a fully distributed index structure which contains the tag name, attributes, and text content of an element, as well as its corresponding indices. By exploiting the index information in the DIX node stream, a mobile client can access the stream with shorter latency. We also suggest a method of clustering DIX nodes in the stream, which can further enhance the performance of query processing in the mobile clients. Through extensive experiments, we demonstrate that our approach is effective for wireless broadcasting of XML data and outperforms the previous methods.


Author(s):  
Jun Pyo Park ◽  
Chang-Sup Park ◽  
Yon Dohn Chung

In this article, we address the problem of delayed query processing raised by tree-based index structures in wireless broadcast environments, which increases the access time of mobile clients. We propose a novel distributed index structure and a clustering strategy for streaming XML data that enables energy and latency-efficient broadcasting of XML data. We first define the DIX node structure to implement a fully distributed index structure which contains the tag name, attributes, and text content of an element, as well as its corresponding indices. By exploiting the index information in the DIX node stream, a mobile client can access the stream with shorter latency. We also suggest a method of clustering DIX nodes in the stream, which can further enhance the performance of query processing in the mobile clients. Through extensive experiments, we demonstrate that our approach is effective for wireless broadcasting of XML data and outperforms the previous methods.


Author(s):  
Agustinus Borgy Waluyo

A very large number of broadcast items affect the access time of mobile clients to retrieve data item of interest. This is due to high waiting time for mobile clients to find the desired data item over wireless channel. In this chapter, the authors propose a method to optimize query access time and hence minimize power consumption. The proposed method is divided into two stages: (1) The authors present analytical models and utilize the analytical models for both query access time over broadcast channel and on-demand channel; (2) they present a global index, an indexing scheme designed to assist data dissemination over multi broadcast channel. Several factors are taken into account, which include request arrival rate, service rate, number of request, size of data item, size of request, number of data item to retrieve, and bandwidth. Simulation models are developed to find out the performance of the analytical model. Finally, the authors compare the performance of the proposed method against the conventional approach.


Author(s):  
Kahkashan Tabassum ◽  
Asia Sultana ◽  
Avula Damaodaram

The growing demand for wireless technology and related applications has impelled companies to invest profoundly in a wide range of wireless products such as laptops, notebooks, cellular phones, etc., to meet needs of broad range of customers’ requirements while maintaining high efficiency and data integrity. The Mobile Customers (MC) should be able to access the desired information such as news, weather reports, traffic updates, financial information, stock prices, etc. whenever and wherever they desire, but it is possible that they may have inconsistent data as they are not physically connected to the servers and hence they maintain a local cache that stores some amount of data that has been sent by the server. They may also prefetch data from the server for caching, depending on history for future use. The cached data should be consistent with the data in the data server in order to correctly serve the user. The critical constraints of a mobile device like limited network bandwidth, low battery power and low processing power of mobile devices make them more susceptible to inconsistencies. Broadcasting is the natural method for disseminating information in media: namely, shared Ethernet, optical networks, short-range wireless and wireless links, including satellites. It has the highest priority to disseminate information on the wireless network. Multicasting supports an enormous range of applications within a network and is an effective method to guarantee scalability of bulk data transfer in wireless environment. In a Multicast scenario, a single source sends data items, which are then replicated within the network infrastructure to reach a large client population (group). Therefore, it can be used to guarantee scalability, reliable data dissemination, timely and consistent content distribution.


Author(s):  
Mary Magdalene Jane.F ◽  
R. Nadarajan ◽  
Maytham Safar

Data caching in mobile clients is an important technique to enhance data availability and improve data access time. Due to cache size limitations, cache replacement policies are used to find a suitable subset of items for eviction from the cache. In this paper, the authors study the issues of cache replacement for location-dependent data under a geometric location model and propose a new cache replacement policy RAAR (Re-entry probability, Area of valid scope, Age, Rate of Access) by taking into account the spatial and temporal parameters. Mobile queries experience a popularity drift where the item loses its popularity after the user exhausts the corresponding service, thus calling for a scenario in which once popular documents quickly become cold (small active sets). The experimental evaluations using synthetic datasets for regular and small active sets show that this replacement policy is effective in improving the system performance in terms of the cache hit ratio of mobile clients.


Author(s):  
Vikas Goel ◽  
Anil Kumar Ahlawat ◽  
M N Gupta

Wireless data broadcasting seems to be an efficient way for dissemination of data to a large number of mobile users. Because of its scalability and flexibility, the service providers use this technology to resolve request of thousands of users in one single response. Full text search is the latest area of research in wireless data broadcasting. Access time and tuning time are the two metrics for evaluation of an indexing technique. In this paper, we propose an air indexing technique based on the dictionary data structure namely Dict-Based Air Indexing Technique for full text search over wireless broadcast stream that utilizes hash-tables. We also propose algorithms for the implementation of the technique. We analyze, evaluate and compare its performance with existing schemes. The results from simulation experiments demonstrate that the proposed technique is the most latency and energy efficient air indexing technique for full text searches.


Author(s):  
S. Lim

In this article, we concentrate particularly on cooperative caching, which is basically a type of caching strategy that not only allows mobile clients to retrieve database items from the servers, but also from the cache in their peers.


2011 ◽  
pp. 155-176
Author(s):  
Dimitrios Katsaros ◽  
Yannis Manolopoulos

The advances in computer and communication technologies made possible an ubiquitous computing environment were clients equipped with portable devices can send and receive data anytime and from anyplace. Due to the asymmetry in communication and the scarceness of wireless resources, data broadcast is widely employed as an effective means in delivering data to the mobile clients. For reasons like heterogeneous communication capabilities and variable quality of service offerings, we may need to divide a single wireless channel into multiple physical or logical channels. Thus, we need efficient algorithms for placing the broadcast data into these multiple channels so as to reduce the client access time. The present chapter discusses algorithms for placing broadcast data to multiple wireless channels, which cannot be coalesced into a lesser number of high-bandwidth channels, assuming that there are no dependencies among the transmitted data. We give an algorithm for obtaining the optimal placement to the channels and explain its limitation since it is computationally very demanding and thus unfeasible. Then, we present heuristic schemes for obtaining suboptimal solutions to the problem of reporting on their implementation cost and their relative performance.


Author(s):  
Panayotis Fouliras

Data dissemination has already been identified as one of the most important aspects for mobile environments and particularly so for large volumes of data such as video, with the additional constraints of speedy, accurate, and isochronous delivery to thousands of users. With the adoption of mobile broadcasting standards this factor has increased in importance. In this chapter, we present the respective issues involved, technical as well as financial and regulatory. The reader is provided with a brief, yet concise, picture of the most important traditional broadcasting techniques and video broadcasting standards for the mobile environment. We then conclude with a detailed comparative evaluation in order to better understand the merits of each approach.


Author(s):  
Panayotis Fouliras

Data dissemination today represents one of the cornerstones of network-based services and even more so for mobile environments. This becomes more important for large volumes of multimedia data such as video, which have the additional constraints of speedy, accurate, and isochronous delivery often to thousands of clients. In this chapter, we focus on video streaming with emphasis on the mobile environment, first outlining the related issues and then the most important of the existing proposals employing a simple but concise classification. New trends are included such as overlay and p2p network-based methods. The advantages and disadvantages for each proposal are also presented so that the reader can better appreciate their relative value.


Sign in / Sign up

Export Citation Format

Share Document