Methods of constructing the optimum chemical balance weighing designs from symmetric balanced incomplete block designs are proposed with illustration. As a by-product pairwise efficiency and variance balanced designs ...Methods of constructing the optimum chemical balance weighing designs from symmetric balanced incomplete block designs are proposed with illustration. As a by-product pairwise efficiency and variance balanced designs are also obtained.展开更多
Given any positive integers k3 and λ,let c（k,λ）denote the smallest integer such that u ∈ B（k,λ）for every integer uc（k,λ）that satisfies the congruences λv（v-1）≡0（mod k（k-1））and λ（u-1）≡0（mod k-1...Given any positive integers k3 and λ,let c（k,λ）denote the smallest integer such that u ∈ B（k,λ）for every integer uc（k,λ）that satisfies the congruences λv（v-1）≡0（mod k（k-1））and λ（u-1）≡0（mod k-1）.In this article we make an improvement on the bound of c（k,λ）provided by Chang in[4]and prove that c（k,λ）exp{k<sup>3k<sup>6</sup></sup>}.In particular,c（k,1）exp{k<sup>k<sup>2</sup></sup>}.展开更多
Due to its character of topology independency, topology-transparent medium access control (MAC) scheduling algorithm is very suitable for large-scale mobile ad hoc wireless networks. In this paper, we propose a new to...Due to its character of topology independency, topology-transparent medium access control (MAC) scheduling algorithm is very suitable for large-scale mobile ad hoc wireless networks. In this paper, we propose a new topologytransparent MAC scheduling algorithm, with parameters of the node number and the maximal nodal degree known, our scheduling algorithm is based on a special balanced incomplete block design whose block size is optimized by maximizing the guaranteed throughput. Its superiority over typical other scheduling algorithms is proven mathematically with respect to the guaranteed throughput, the maximal transmission delay, and also the minimal transmission delay. The effect of inaccuracy in the estimation of the maximal nodal degree on the guaranteed throughput is deduced mathematically, showing that the guaranteed throughput decreases almost linearly as the actual nodal degree increases. Further techniques for improving the feasibility of the algorithm, such as collision avoidance, time synchronization, etc., are also discussed.展开更多
文摘Methods of constructing the optimum chemical balance weighing designs from symmetric balanced incomplete block designs are proposed with illustration. As a by-product pairwise efficiency and variance balanced designs are also obtained.
基金Supported by NSFC Grant No.19701002 and Huo Yingdong Foundation
文摘Given any positive integers k3 and λ,let c（k,λ）denote the smallest integer such that u ∈ B（k,λ）for every integer uc（k,λ）that satisfies the congruences λv（v-1）≡0（mod k（k-1））and λ（u-1）≡0（mod k-1）.In this article we make an improvement on the bound of c（k,λ）provided by Chang in[4]and prove that c（k,λ）exp{k<sup>3k<sup>6</sup></sup>}.In particular,c（k,1）exp{k<sup>k<sup>2</sup></sup>}.
基金supported by the National Natural Science Foundation of China (No. 61003307, 60803159, 60873093)the Basic DisciplinesResearch Foundation of China University of Petroleum, Beijing (No. JCXK-2010-01)+1 种基金the Beijing Municipal Natural Science Foundation (No.4102059)the National High Technology Research and Development Program of China (No. 2009AA062802)
文摘Due to its character of topology independency, topology-transparent medium access control (MAC) scheduling algorithm is very suitable for large-scale mobile ad hoc wireless networks. In this paper, we propose a new topologytransparent MAC scheduling algorithm, with parameters of the node number and the maximal nodal degree known, our scheduling algorithm is based on a special balanced incomplete block design whose block size is optimized by maximizing the guaranteed throughput. Its superiority over typical other scheduling algorithms is proven mathematically with respect to the guaranteed throughput, the maximal transmission delay, and also the minimal transmission delay. The effect of inaccuracy in the estimation of the maximal nodal degree on the guaranteed throughput is deduced mathematically, showing that the guaranteed throughput decreases almost linearly as the actual nodal degree increases. Further techniques for improving the feasibility of the algorithm, such as collision avoidance, time synchronization, etc., are also discussed.
