Power-aware data retrieval protocols for indexed broadcast parallel channels

  • Authors:
  • Ali R. Hurson;Angela Maria Muñoz-Avila;Neil Orchowski;Behrooz Shirazi;Yu Jiao

  • Affiliations:
  • Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA 16802, United States;Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA 16802, United States;Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA 16802, United States;School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA 99164-2812, United States;Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA 16802, United States

  • Venue:
  • Pervasive and Mobile Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In pervasive and mobile computing environments, ''timely and reliable'' access to public data requires methods that allow quick, efficient, and low-power access to information to overcome technological limitations of wireless communication and access devices. The literature suggests broadcasting (one-way communication) as an effective way to disseminate the public data to mobile devices. Within the scope of broadcasting, the response time and energy consumption of retrieval methods have been used as the performance metrics for measuring the effectiveness of different access methods. The hardware and architecture of the mobile units offer different operational modes that consume different energy levels. Along with these architectural and hardware enhancements, techniques such as indexing, broadcasting along parallel channels, and efficient allocation and retrieval protocols can be used to minimize power consumption and access latency. In general, the retrieval methods attempt to determine the optimal access pattern for retrieving the requested data objects on parallel broadcast channels. The employment of heuristics provides a methodology for such ideal path planning solutions. Using informative heuristics and intelligent searches of an access forest can provide a prioritized cost evaluation of access patterns for requested data objects and, hence, an optimal path for the access of requested data on broadcast air channels. This paper examines two scheduling methods that along with a set of heuristics generate and facilitate the access patterns for retrieving data objects in the presence of conflicts in an indexed parallel broadcast channel environment. A simulation of the proposed schemes is presented for analyzing the relationship between response time and power consumption.