This paper addresses the multiplexing loss that occurs in relay networks due to causality of relays and the halfduplex constraint. We devise relay selection methods to recover the ...
The k-nearest-neighbor rule is one of the most attractive pattern classification algorithms. In practice, the choice of k is determined by the cross-validation method. In this wor...
—The complexity of modern networked information systems, as well as all the defense-in-depth best practices, require distributed intrusion detection architectures relying on the ...
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
—Current rate control (selection) algorithms in IEEE 802.11 are not based on accurate measurements of packet errors caused at the physical layer. Instead, algorithms act on measu...