A novel multiple access scheme in wireless multimedia networks with multi-packet reception
WMuNeP '05 Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling
A multigroup priority queueing MAC protocol for wireless networks with multipacket reception
EURASIP Journal on Wireless Communications and Networking - Intelligent Systems for Future Generation Wireless Networks
Fast multiple access selection through variable power transmissions
IEEE Transactions on Wireless Communications
Design and analysis of a splitting algorithm for a multi-packet reception ALOHA system
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
A cooperative multi-group priority MAC protocol for multi-packet reception channels
IEEE Transactions on Wireless Communications
A distributed contention resolution algorithm in multi-packet reception ALOHA systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Adaptive probabilistic medium access in MPR-capable ad-hoc wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Wireless Personal Communications: An International Journal
Wireless Personal Communications: An International Journal
Quality-of-service specific information retrieval for densely deployed sensor networks
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Link scheduling in wireless networks with successive interference cancellation
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
A dynamic medium access control (MAC) protocol is proposed for a finite-user slotted channel with multipacket reception (MPR). This protocol divides the time axis into transmission periods (TPs) where the ith TP is dedicated to the transmission of the packets generated in the (i-1)th TP. At the beginning of each TP, the state (active or idle) of each user is estimated based on the length of the previous TP and the incoming traffic load. By exploiting the information on the state of users and the channel MPR capability, the number of users who can simultaneously access the channel in the current TP is chosen so that the expected length of this TP is minimized. As a result, the MPR capability is more efficiently utilized by the proposed protocol as compared to, for example, the slotted ALOHA with optimal retransmission probability. Furthermore, the proposed protocol requires little online computation. Its simplicity is comparable to that of slotted ALOHA. It can be applied to random access networks with spread spectrum and/or antenna array.