TY - GEN
T1 - Energy-efficient scheduling algorithms of object retrieval on indexed parallel broadcast channels
AU - Sun, Bingjun
AU - Hurson, Ali R.
AU - Hannan, John
PY - 2004/12/17
Y1 - 2004/12/17
N2 - With the goal of providing "timely and reliable" access to information in a mobile computing environment, mobile units and the wireless medium operate under constraints on energy, bandwidth, and connectivity. Among these limitations, power limitation of mobile units is one of the key issues. In a mobile computing environment, broadcasting has proved to be an effective method to distribute public data. Efficient methods for allocating and retrieving objects on parallel indexed broadcast channels have been proposed to manage power consumption and access latency. Employment of parallel channels also brings out the notion of conflicts. To minimize the effect of conflicts on both access latency and power consumption, one has to develop schemes to schedule access to the objects that minimizes the number of passes over the parallel channels. This work extends our past efforts and proposes two new scheduling algorithms that can find the minimum number of passes and inside channel switches. The simulation results show that the proposed scheduling algorithms relative to our previous work have a great impact on energy consumption and access latency. The proposed scheduling algorithms are simulated and results are presented.
AB - With the goal of providing "timely and reliable" access to information in a mobile computing environment, mobile units and the wireless medium operate under constraints on energy, bandwidth, and connectivity. Among these limitations, power limitation of mobile units is one of the key issues. In a mobile computing environment, broadcasting has proved to be an effective method to distribute public data. Efficient methods for allocating and retrieving objects on parallel indexed broadcast channels have been proposed to manage power consumption and access latency. Employment of parallel channels also brings out the notion of conflicts. To minimize the effect of conflicts on both access latency and power consumption, one has to develop schemes to schedule access to the objects that minimizes the number of passes over the parallel channels. This work extends our past efforts and proposes two new scheduling algorithms that can find the minimum number of passes and inside channel switches. The simulation results show that the proposed scheduling algorithms relative to our previous work have a great impact on energy consumption and access latency. The proposed scheduling algorithms are simulated and results are presented.
UR - http://www.scopus.com/inward/record.url?scp=10044278054&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=10044278054&partnerID=8YFLogxK
U2 - 10.1109/ICPP.2004.1327953
DO - 10.1109/ICPP.2004.1327953
M3 - Conference contribution
AN - SCOPUS:10044278054
SN - 0769521975
T3 - Proceedings of the International Conference on Parallel Processing
SP - 440
EP - 447
BT - Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004
A2 - Eigenmann, R.
T2 - Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004
Y2 - 15 August 2004 through 18 August 2004
ER -