In order to maximize the average throughput and minimize the transmissionslot delay in wireless Ad Hoc networks, an optimal topology-transparent transmission schedulingalgorithm-multichannel Time-Spread Multiple Acces...In order to maximize the average throughput and minimize the transmissionslot delay in wireless Ad Hoc networks, an optimal topology-transparent transmission schedulingalgorithm-multichannel Time-Spread Multiple Access (TSMA) is proposed. Further analysis is shownthat the maximum degree is very sensitive to the network performance for a wireless Ad Hoc networkswith N mobile nodes. Moreover, the proposed multichannel TSMA can improve the average throughput Mtimes and decrease the average transmission slot delay M times, as compared with singlechannel TSMAwhen M channels are available.展开更多
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.展开更多
基金This work is supported by"863"High Technology Development Project Fund (No.2003AA12331004).
文摘In order to maximize the average throughput and minimize the transmissionslot delay in wireless Ad Hoc networks, an optimal topology-transparent transmission schedulingalgorithm-multichannel Time-Spread Multiple Access (TSMA) is proposed. Further analysis is shownthat the maximum degree is very sensitive to the network performance for a wireless Ad Hoc networkswith N mobile nodes. Moreover, the proposed multichannel TSMA can improve the average throughput Mtimes and decrease the average transmission slot delay M times, as compared with singlechannel TSMAwhen M channels are available.
基金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.
