What is the equation for ALOHA?

What is the formula for pure ALOHA?

Well first of all it depends on what you mean by "pure".

There is no single formula for pure ALOHA, it's a whole bunch of different approaches, each of which is good at something and bad at others.

What's best? Well, that's impossible to answer. Different people and systems have different goals and preferences. You might consider a pure ALOHA system to best if it provides all three of these things:

High throughput. Low latency. High bandwidth. But this is not how it works. This is because "high throughput" is often achieved by sacrificing some of the other qualities. For example, in a pure ALOHA system that uses binary tree hashing, there is a tradeoff between throughput, latency, and bandwidth. The more items you put in the hash table, the faster throughput you can achieve. The less items you put in the hash table, the better latency can be. But the less items you put in the hash table, the worse the bandwidth can be.

In order to answer the question of "what is the best", you have to define your metrics. And the answer changes based on what metrics you use.

Why is it impossible to define a single formula for best? A single formula can't possibly take into account all of the ways that systems choose to implement ALOHIt can only take into account the approach that is being used. So, for example, an implementation that is optimal for low latency may not be optimal for high throughput.

But what if we asked what is optimal for low latency? I don't think anyone has answered this question yet, and nobody is going to be able to give us answer until someone tries something and gets disappointed. But if you like, we can look at what is optimal for low latency.

First of all, the ALOHA protocols that we know how to implement are optimized for latency. The reason is that ALOHA is designed to be very efficient in the case that a node has to broadcast its packet because it can be sure that there is another node close by that will accept it immediately. It was never designed to be broadcast in the case that another node is out of range or busy.

So there is an optimal latency for each of the protocols. But even though they are optimized for low latency, they will still have some latency.

What is the pure ALOHA protocol?

The ALOHA protocol is an important part of wireless LANs and as such it is used in many 802.

11 protocols. But the ALOHA protocol is not just a part of wireless LANs, it is more general than this:

The ALOHA protocol is used in Ethernet. The ALOHA protocol is used in any network that uses contention-based access mechanisms (such as Ethernet or IEEE 802.11) the ALOHA protocol is used in wireless LANs, but it is often the basis for other contention-based access mechanisms, such as IEEE 802.11's CSMA/CA (carrier sense multiple access with collision avoidance) In this article I will try to explain how the ALOHA protocol works and why it is so important. Contents. A simple protocol description. How is the ALOHA protocol different from CSMA/CA? The simple answer is that CSMA/CA is a protocol which tries to deal with collisions in a way that is quite robust, whereas ALOHA doesn't try to detect or avoid collisions at all. But let's try to understand what that means. To see this difference better, let's first look at the three simple cases of a CSMA/CA-like protocol. In case (a) both stations are awake and they transmit simultaneously. One station has no luck and the other has a successful transmission. The same goes for case (b): one station is asleep while the other is awake and transmitting. The situation in case (c) is very interesting: both stations are asleep and neither is transmitting. In case (a) the two stations collide and one of them has a successful transmission, while in case (b) the two stations don't collide.

It becomes clearer now that there is a large difference between ALOHA and CSMA/CALOHA doesn't try to detect or avoid collisions, while CSMA/CA does. How does CSMA/CA work? Let's assume that you want to send a message to a station, and you have been notified that the station is awake. The way it works is: You perform a short-range check (called "listening"), to find out whether the station is listening.