Power-aware data retrieval protocols for indexed broadcast parallel channels

Efficient data retrieval algorithms for multiple requests in MIMO wireless networks

“…However, it does not consider any conflict. The work [34] proposed three heuristic schemes to solve the minimum switch data retrieval problem. Later, [35] proposed two schemes (least switch and best first) to extend data retrieval technique for downloading single request with multiple requested data items under the condition of clients equipped with multiple antennae.…”

“…Compared with [38], our algorithm is more efficient, because there are more paths between a pair of nodes in the DAG than that from the root to the respective leaves in the constructed tree. Figure 5 depicts an example of wireless data broadcast system in [34], and Figures 6, 7, and 8 depict the forest constructed by [34], the DAG generated by [38], and the super tree of our proposed algorithm, respectively. Clearly in this instance, our proposed scheme generates fewer paths and consequently executes faster.…”

Energy-efficient algorithms for data retrieval from indexed parallel broadcast channels

“…To manage energy consumption, one needs to develop energy-efficient protocols that run hardware devices in different operational modes [6,[8][9][10]. The literature has suggested indexing techniques and broadcasting over parallel channels as means to reduce the active time of mobile devices and the broadcast length -hence reducing the energy consumption and the response time.…”

“…The literature has suggested indexing techniques and broadcasting over parallel channels as means to reduce the active time of mobile devices and the broadcast length -hence reducing the energy consumption and the response time. However, access conflicts and channel switches are natural by-products of broadcasting over parallel channels [8]. Access conflicts (see Section 2.4) force additional passes over the parallel channels, which in turn increase the response time and energy consumption.…”

“…Within the scope of indexed parallel broadcast channels, heuristic rules were employed to schedule access to the data items such that both the number of passes and the frequency of channel switching were reduced [8]. Simulation results have proven the effectiveness of these approaches.…”