This paper presents a detail analysis of two bandwidth packing algorithms, used for processing connection requests in the centralized wireless network. Each call comes with a specific bandwidth request. A request can ...This paper presents a detail analysis of two bandwidth packing algorithms, used for processing connection requests in the centralized wireless network. Each call comes with a specific bandwidth request. A request can be satisfied only if there is sufficient bandwidth available during resource scheduling and allocation. Unsatisfied requests were held in a queue. The metric of bandwidth utilization ratio was used to quantify the performance of our algorithms. By theoretical analysis, our algorithms can improve the average bandwidth usage ratio significantly, about 8%~10% without adding much computation complexity. Moreover, our algorithms outperform next fit with fragmentation (NFF) algorithm when the bandwidth resource is scarce. In this paper, the contributions follows: Introducing bandwidth packing problem into wireless network; Proposing two new bandwidth packing algorithms for wireless network where the complicate scheduling algorithms are prohibited; Studying the average performance of our algorithms mathematically, which agree well with the simulation results.展开更多
Recent research shows using network sion efficiency in wireless networks greatly et for retransmission over composite fading coding for reliable multicast can improve the retransmis- In this paper, we study how to co...Recent research shows using network sion efficiency in wireless networks greatly et for retransmission over composite fading coding for reliable multicast can improve the retransmis- In this paper, we study how to code the composite pack- channels efficiently. For the composite fading environ- ment with muhiple receivers, receivers experience different fading at any time. It＇ s very important to code the composite packet so that intended receivers are in good channel qualities, because in- tended receivers in deep fading have little opportunity to receive the composite packet correctly. Hence, we propose a novel composite packet coding principle of maximizing the total SNR of intend- ed receivers. Since the proposed principle is an NP-complete problem, an efficient heuristic algo- rithm with low complexity is given for finding a suboptimal solution. Simulation results show the heu- ristic based scheme achieves higher transmission efficiency than other network coding-based schemes due to the multi-user diversity gain.展开更多
文摘This paper presents a detail analysis of two bandwidth packing algorithms, used for processing connection requests in the centralized wireless network. Each call comes with a specific bandwidth request. A request can be satisfied only if there is sufficient bandwidth available during resource scheduling and allocation. Unsatisfied requests were held in a queue. The metric of bandwidth utilization ratio was used to quantify the performance of our algorithms. By theoretical analysis, our algorithms can improve the average bandwidth usage ratio significantly, about 8%~10% without adding much computation complexity. Moreover, our algorithms outperform next fit with fragmentation (NFF) algorithm when the bandwidth resource is scarce. In this paper, the contributions follows: Introducing bandwidth packing problem into wireless network; Proposing two new bandwidth packing algorithms for wireless network where the complicate scheduling algorithms are prohibited; Studying the average performance of our algorithms mathematically, which agree well with the simulation results.
文摘Recent research shows using network sion efficiency in wireless networks greatly et for retransmission over composite fading coding for reliable multicast can improve the retransmis- In this paper, we study how to code the composite pack- channels efficiently. For the composite fading environ- ment with muhiple receivers, receivers experience different fading at any time. It＇ s very important to code the composite packet so that intended receivers are in good channel qualities, because in- tended receivers in deep fading have little opportunity to receive the composite packet correctly. Hence, we propose a novel composite packet coding principle of maximizing the total SNR of intend- ed receivers. Since the proposed principle is an NP-complete problem, an efficient heuristic algo- rithm with low complexity is given for finding a suboptimal solution. Simulation results show the heu- ristic based scheme achieves higher transmission efficiency than other network coding-based schemes due to the multi-user diversity gain.
