Efficient Resource Allocation for Broadcasting Multi-Slot Messages With Random Access with Capture
Abstract
Optimal resource allocations for best effort delivery of broadcasting bursty multi-slots messages with random access are investigated. We consider broadcast multi-slot messages originating from all nodes in wireless random access networks of varying sizes, with receivers employing capture. Allocation of both access probabilities and transmission energy needed for sending various amounts of coded packets are investigated. The distributed transmitters must cooperate by Duly using the resources They are allocated, so as not to cause additional collisions that would diminish the performance of the other users. We evaluate resource allocation schemes in terms of message loss probability, throughput, and probability of satisfaction of specific delay constraints. It is demonstrated that optimal strategies for these metrics depend on the total offered traffic, the number of nodes, and the capture effect. It is shown how the optimal throughput can be implemented with finite delay. Furthermore, we show how even in large networks with the optimal allocation strategy, edge effects and capture significantly impact performance not only at the edges of the network, but also in the center of the network. Finally, we demonstrate how the addition of minimal feedback and further cooperation to the optimal best effort delivery strategy can significantly increase the probability of 'reception for all nodes.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 15, 2011
- Accession Number
- ADA541058
Entities
People
- Amanda Peters
- Linda Zeger
Organizations
- Massachusetts Institute of Technology