The aggregate throughput of wireless mesh networks (WMNs) can be significantly improved by equipping the mesh routers with multiple radios tuned to orthogonal channels. Not only the links using orthogonal channels can be activated at a time, but some links in the same channel also can be activated concurrently if the Signal-to-Interference-and-Noise Ratio (SINR) at their receivers is not lower than the threshold, which is the spatial-reuse characteristic. STDMA is considered as one of the medium access schemes that can exploit spatial reuse to improve network throughput. Past studies have shown that optimizing the performance of STDMA is NP-Hard. Therefore, we propose a STDMA-based scheduling algorithm that operates in a greedy fashion for WMNs. We show that the proposed algorithm enhances not only the throughput but also the fairness by capturing the essence of spatial-reuse approach of STDMA and giving medium access opportunities to each network element based on its priority. We furthermore validate our algorithm through theoretical analysis and extensive simulations and the results show that our algorithm can outperform state-of-the-art alternatives.

We study joint rate control and resource allocation with a packet collision constraint that maximizes the total utility of secondary users in cognitive radio networks. We formulate and decouple the original optimization problem into separable subproblems and then develop an algorithm that converges to optimal rate control and resource allocation. The proposed algorithm can operate on different time-scales to reduce the amortized time complexity.

In this paper, a hybrid overlay/underlay cognitive radio system is modeled as an M/M/1 queue where the rate of arrival and the service capacity are subject to Poisson alternations. Each packet as a customer arriving at the queue makes a decision to join the queue or not. Upon arrival, the individual decision of each packet is optimized based on his observation about the queue length and the state of system. It is shown that the individually optimal strategy for joining the queue is characterized by a threshold of queue length. Thus, the individual optimal threshold of queue length is analyzed in detail in this work.