Channel allocation was extensively investigated in the framework of cellular networks, but it was rarely studied in the wireless ad-hoc networks, especially in the multi-hop ad-hoc networks. In this paper, we study the competitive multi-radio channel allocation problem in multi-hop wireless networks in detail. We model the channel allocation problem as a static cooperative game, in which some players collaborate to achieve high date rate. We propose the min-max coalition-proof Nash equilibrium (MMCPNE) channel allocation scheme in the game, which aims to max the achieved date rates of communication links. We analyze the existence of MMCPNE and prove the necessary conditions for MMCPNE. Furthermore, we propose several algorithms that enable the selfish players to converge to MMCPNE. Simulation results show that MMCPNE outperforms CPNE and NE schemes in terms of achieved data rates of the multi-hop links due to cooperation gain.

In this paper, we present a new energy-efficient bandwidth allocation scheme for wireless networks. First of all, we investigate the intrinsic relationship between the energy consumption and transmission rates of mobile terminals, in which transmission rate is determined through channel allocations. Then, we propose two schemes for connection admission control: Victim Selection Algorithm (VSA) and Beneficiary Selection Algorithm (BSA) with the intent to reduce energy consumption of each terminal. Moreover, we introduce an adjustment algorithm to statistically meet the demands for quality of service (QoS) during the resource allocation. The performance of the proposed schemes is evaluated with respect to energy consumption rate of each successfully transmitted bit, throughput and call blocking probabilities. An extensive analysis and simulation study is conducted for Poisson and self-similar, multi-class traffic.

We consider a TCP/AQM system with large link capacity (NC) shared by many flows. The traditional rule-of-thumb suggests that the buffer size be chosen in proportion to the number of flows (N) for full link utilization, while recent research outcomes show that O( √N) buffer sizing is sufficient for high utilization and O(1) buffer sizing makes the system stable at the cost of reduced link utilization. In this paper, we consider a system where the AQM is scaled as O(Nα) with a buffer of size O(Nβ) (0 < α < β < 0.5). By capturing randomness both in packet arrivals and in packet markings, we develop a doubly-stochastic model for a TCP/AQM system with many flows. We prove that, under such a scale, the system always performs well in the sense that the link utilization goes to 100% and the loss ratio decreases to zero as the system size N increases. Our results assert that the system enjoys benefit of largeness with no tradeoff between full link utilization, zero packet loss, and small buffer size, at least asymptotically. This is in stark contrast to existing results showing that there always exists a tradeoff between full link utilization and the required buffer size. Extensive ns-2 simulation results under various configurations also confirm our theoretical findings. Our study illustrates that blind application of fluid modeling may result in strange results and exemplifies the importance of choosing a right modeling approach for different scaling regimes.