Data on air: organization and access

TLDR

Organizing massive data on wireless networks to provide fast, low‑power access to palmtop users is a new challenge due to limited bandwidth and battery life. The paper proposes algorithms for multiplexing clustering and non‑clustering indexes to manage data on wireless networks. The authors present two multiplexing algorithms, (1,m) indexing and Distributed Indexing, and a Nonclustered Indexing algorithm (generalized to multiple indexes), evaluating power consumption and latency as key performance criteria. Analytical results show the algorithms significantly improve battery life while maintaining low latency.

Abstract

Organizing massive amount of data on wireless communication networks in order to provide fast and low power access to users equipped with palmtops, is a new challenge to the data management and telecommunication communities. Solutions must take under consideration the physical restrictions of low network bandwidth and limited battery life of palmtops. This paper proposes algorithms for multiplexing clustering and nonclustering indexes along with data on wireless networks. The power consumption and the latency for obtaining the required data are considered as the two basic performance criteria for all algorithms. First, this paper describes two algorithms namely, (1, m) indexing and Distributed Indexing, for multiplexing data and its clustering index. Second, an algorithm called Nonclustered Indexing is described for allocating static data and its corresponding nonclustered index. Then, the Nonclustered indexing algorithm is generalized to the case of multiple indexes. Finally, the proposed algorithms are analytically demonstrated to lead to significant improvement of battery life while retaining a low latency.