As the wireless technology overwhelmingly occupies the consumer electronics market, the booming demands of the mobile users are largely unaccommodated. Thus wireless data broadcasting systems gain increasing attentions recently. Two wellknown metrics for evaluating wireless data broadcasting systems are Access Latency and Tuning Time. In order to reduce these two factors, many existing techniques have to make a tradeoff between the power consumption and the quality of services. In this paper, an energy-efficient Hybrid Asynchronous Multiple Hashing scheme named HAMHash for multi-channel broadcasting systems was proposed, which deals with variable data size and non-flat distribution of queries in multi-channel circumstance. Furthermore, algorithms of data allocation and retrieval for skewed broadcast are presented. Quantitative theoretical and experimental analysis of the system performance verifies the effectiveness of our scheme.

An optical transpose interconnection system (OTIS) network with n2nodes is a two-level swapped architecture built of n copies of an n-node basis network that constitute its clusters. A simple rule for intercluster connectivity (node j in cluster i connected to node i in cluster j) leads to regularity, modularity, packageability, fault tolerance, and algorithmic efficiency of the resulting networks. We prove that an OTIS (swapped) network with a connected basis network possesses maximal fault tolerance, regardless of whether its basis network is maximally fault tolerant. We also show how the corresponding maximal number of node-disjoint paths between two nodes of a swapped network can be algorithmically constructed in a manner that is independent of the existence and construction of node-disjoint paths within its basis network. Our results are stronger than previously published results and they replace a number of proofs and constructions in the literature for specific basis networks. Additionally, we use our parallel path constructions to establish that the fault diameter and wide diameter of an OTIS network is no more than 4 units greater than its diameter.

Recently, Melhem presented a "new" class of low-diameter interconnection (LDI) networks, (IEEE Trans. Computers, Vol. 56, No. 4, pp. 502-510). We note that LDI networks are the same as the previously known generalized de Bruijn graphs, point out an error in the decomposition of LDI networks into permutations, and find that the correct decomposition scheme is an instance of arc coloring for coset graphs. Hence, we pursue a number of general results on arc coloring of coset graphs that can be applied to this particular decomposition problem as well as within many other contexts, including complete arc coloring and normality of coset graphs.