Multiuser Detection
A multiqueue service room MAC protocol for wireless networks with multipacket reception
IEEE/ACM Transactions on Networking (TON)
Opportunistic carrier sensing for energy-efficient information retrieval in sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on advanced signal processing algorithms for wireless communications
Wireless Communications
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
A dynamic queue protocol for multiaccess wireless networks with multipacket reception
IEEE Transactions on Wireless Communications
Energy-constrained modulation optimization
IEEE Transactions on Wireless Communications
Progressive Accumulative Routing: Fundamental Concepts and Protocol
IEEE Transactions on Wireless Communications - Part 1
Power levels and packet lengths in random multiple access
IEEE Transactions on Information Theory
Exploiting decentralized channel state information for random access
IEEE Transactions on Information Theory
Stability and delay of finite-user slotted ALOHA with multipacket reception
IEEE Transactions on Information Theory
Power levels and packet lengths in random multiple access with multiple-packet reception capability
IEEE Transactions on Information Theory
Perfect-Capture ALOHA for Local Radio Communications
IEEE Journal on Selected Areas in Communications
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
Relay selection and data transmission throughput tradeoff in cooperative systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view
IEEE Transactions on Wireless Communications
The relay selection and transmission trade-off in cooperative communication systems
IEEE Transactions on Wireless Communications
| Hi-index | 0.01 |
Many wireless applications demand a fast mechanism to detect the packet from a node with the highest priority ("best node") only, while packets from nodes with lower priority are irrelevant. In this paper, we introduce an extremely fast contention-based multiple access algorithm that selects the best node and requires only local information of the priorities of the nodes. The algorithm, which we call Variable Power Multiple Access Selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities onto the receive power. It is based on a key result that shows that mapping onto a set of discrete receive power levels is optimal, when the power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture, idle channel, or collision. We also show how reliable information regarding the total received power at the receiver can be used to improve the algorithm by enhancing the feedback mechanism. The algorithm detects the packet from the best node in 1.5 to 2.1 slots, which is considerably lower than the 2.43 slot average achieved by the best algorithm known to date.