Data Organization and Retrieval on Parallel Air Channels: Performance and Energy Issues

Juran, J.; Hurson, Ali R.; Narayanan, Vijaykrishnan; Kim, Soontae

doi:10.1023/b:wine.0000013082.03518.2e

Cited by 29 publications

(39 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Acharya et al first proposed the scheduling problem for data broadcast [1], and Prabhakara et al suggested the multi-channel model for data broadcast to improve the data delivery performance [14]. Since then, many works have been done for scheduling data on multiple channels to reduce the expected access time [20,22,2]. Besides, some researches began to study how to allocate dependent data on broadcast channels (see, e.g., [10,19,21,5,6]).…”

Section: Related Workmentioning

confidence: 99%

“…In such cases, different retrieving schedules may result in different response time. Moreover, in a multi-channel broadcast system, retrieving data will probably need switchings among the channels, which not only consumes additional energy, but also causes possible conflicts [17], [22], [26]. The LNDR problem takes the "deadline" into consideration and therefore also describes the time-critical scenario.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Heuristic Algorithm for Efficient Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments

Porselvi¹,

Devi²

2015

IJCATR

View full text Add to dashboard Cite

Wireless data broadcast is an efficient way of disseminating data to users in the mobile computing environments. From the server's point of view, how to place the data items on channels is a crucial issue, with the objective of minimizing the average access time and tuning time. Similarly, how to schedule the data retrieval process for a given request at the client side such that all the requested items can be downloaded in a short time is also an important problem. In this paper, we investigate the multi-item data retrieval scheduling in the push-based multichannel broadcast environments. The most important issues in mobile computing are energy efficiency and query response efficiency. However, in data broadcast the objectives of reducing access latency and energy cost can be contradictive to each other. Consequently, we define a new problem named Minimum Cost Data Retrieval Problem (MCDR) and Large Number Data Retrieval (LNDR) Problem. We also develop a heuristic algorithm to download a large number of items efficiently. When there is no replicated item in a broadcast cycle, we show that an optimal retrieval schedule can be obtained in polynomial time.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Heuristic Algorithm for Efficient Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments

Porselvi¹,

Devi²

2015

IJCATR

View full text Add to dashboard Cite

show abstract

“…Organization of data on broadcast channels has been discussed in [5,6,7]. Chehadeh and Hurson [6] proposed clustering of related data objects along parallel channels.…”

Section: Related Workmentioning

confidence: 99%

Efficient Object Retrieval from Parallel Air Channels in the Presence of Replicated Objects

Ayyagari

Mitra

Hurson

2006

7th International Conference on Mobile Data Management (MDM'06)

View full text Add to dashboard Cite

show abstract

“…Broadcast schemes based on the semantic relationships of data in a single broadcast channel are also proposed [6], [12], [15]. Moreover, the issues of allocating semantically dependent data on multiple broadcast channels are discussed in [7], [11].…”

Section: Introductionmentioning

confidence: 99%

“…To cope with this problem, broadcasting has been suggested as a possible solution [1], [6], [11], [12], [15]. Acharya et al proposed a "Broadcast Disks" technique for structuring the broadcast in a way that provides improved performance for data with a nonuniform access pattern [1].…”

Section: Introductionmentioning

confidence: 99%

A tree-structured index allocation method with replication over multiple broadcast channels in wireless environments

Jung

Lee

Pramanik

2005

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

Abstract-Broadcast has often been used to disseminate frequently requested data efficiently to a large volume of mobile units over single or multiple channels. Since mobile units have limited battery power, the minimization of the access and tuning times for the broadcast data is an important problem. There have been many research efforts that focus on minimizing access and tuning times by providing indexes on the broadcast data. In this paper, we have studied an efficient index allocation method for broadcast data with skewed access frequencies over multiple physical channels which cannot be coalesced into a single high bandwidth channel. Previously proposed index allocation techniques have one of two problems. The first problem is that they require equal size for both index and data. The second problem is that their performance degrades when the number of given physical channels is not enough. These two problems will result in an increased average access time for the broadcast data. To cope with these problems, we propose a tree-structured index allocation method. Our method minimizes the average access time by broadcasting the hot data and their indices more frequently than the less hot data and their indexes over the dedicated index and data channels. We present an in-depth experimental and theoretical analysis of our method by comparing it with other similar techniques. Our performance analysis shows that it significantly decreases the average access and tuning times for the broadcast data over existing methods.

show abstract

Data Organization and Retrieval on Parallel Air Channels: Performance and Energy Issues

Cited by 29 publications

References 18 publications

Heuristic Algorithm for Efficient Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments

Heuristic Algorithm for Efficient Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments

Efficient Object Retrieval from Parallel Air Channels in the Presence of Replicated Objects

A tree-structured index allocation method with replication over multiple broadcast channels in wireless environments

Contact Info

Product

Resources

About