Radio Resource Management in MIMO-OFDM-Mesh Networks: Issues and Approaches

D Niyato, E Hossain

For me, this was an introduction to rrm in multihop ofdm-mimo networks. I also learned about reinforcement learning algorithms.

CAPTURE EFFECT IN IEEE 802.11 BASIC SERVICE AREA UNDER INFLUENCE OF RAYLEIGH FADING AND NEAR/FAR EFFECT

Zoran Hadzi-Velkov Boris Spasenovski

The article proposes two models for the capture effect.

Multiuser OFDM with Adaptive Subcarrier, Bit, and Power Allocation

Cheong Yui Wong, Roger S. Cheng, Member, IEEE,
Khaled Ben Letaief, Senior Member, IEEE, and Ross D. Murch, Senior Member, IEEE


The idea and the algorithm to assign carriers to users in ofdma.

Could NACKs be useful in relay-assisted networks?

In WLAN IEEE 802.11, there is only positive acknowledges. Nevertheless, in a relay-assisted network, a negative acknowledgement might help the relay to decide whether it is in a favorable position to re-send the packet.

IEEE 802.11n Development: History, Process and Technology

Eldad Perahia

Today I re-read this article and I think it is very interesting. I think that CSMA/ECA should be included in upcoming standards.

nc for cellular

has anyone thought about using network coding for intra-cell calls?

Investigating the Validity of IEEE 802.11 MAC Modeling Hypothesis

K.D. Huang, K.R. Duffy, D.Malone and D.J. Leith

I should verify our model for CSMA/ECA to double-check whether we are using the (A3) and (A4) hypothesis or not. In any case, as the authors concede, the violation of hypothesis (A4) does not affect goodput predictions.

On the Shaping Introduced by IEEE 802.11 Nodes in Long-Range Dependent Traffic

David Rincón , David Remondo , and Cristina Cano

If we change CSMA/CA for CSMA/ECA, would the results presented in the paper differ?

Non-Saturation and Saturation Analysis of IEEE 802.11e EDCA with Starvation Prediction

Paal E. Engelstad and Olav N. Osterbo

This paper was very clarifying for me in many ways. It uses Markov Chains and presents an extension to take into account AIFS.

TCP Muro

There are two problems with current TCP:
- The slow start in high bandwith-delay links.
- The persistent p2p flows that consume most of the Internet's bandwith.

I believe that if the growing of the congestion window could be modified to increase also as a function of time at the beginning, the two problems would be solved. Or, at least, alleviated.

Game-theoretical approach to CSMA/ECA

It might be possible to show that a deterministic backoff after successes and a random backoff after failures is the nash equilibrium of a game.

Or maybe the nash equilibrium is a bit more complex: using a random backoff only if the collision resulted from a random backoff. This leads to a quick convergence protocol, a bit unfair by those that not find their place (slot) immediately.