—We consider the situation where N nodes share a common access point. With each node i there is an associated buffer and channel state that change in time. Node i dynamically cho...
Eitan Altaian, Konstantin Avrachenkov, Nicolas Bon...
— We propose a spreading code medium access control (MAC) protocol with each node equipped with single transceiver for wireless ad hoc networks, based on the code division multip...
—E-limited (or K-limited) scheduling is attractive because its performance is close to that of the exhaustive scheduling which is proven to be the optimal polling scheme for symm...
— The quality of end-to-end services over wireless communication networks highly depends on the error characteristics of the wireless links. By utilizing the link error character...
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...