Control procedures for slotted Aloha systems that achieve stability
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Network control by bayesian broadcast
IEEE Transactions on Information Theory
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Multiple access protocols: performance and analysis
Multiple access protocols: performance and analysis
Data networks (2nd ed.)
Stability and Optimal Control of the Packet Switching Broadcast Channel
Journal of the ACM (JACM)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit
IEEE/ACM Transactions on Networking (TON)
Information theory and communication networks: an unconsummated union
IEEE Transactions on Information Theory
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Transmission costs, selfish nodes, and protocol design
Wireless Networks
Next generation network management of heterogeneous mobile users
Proceedings of the 6th ACM international symposium on Mobility management and wireless access
A fluid-flow model for backlog-based CSMA policies
Proceedings of the 4th Annual International Conference on Wireless Internet
A potential game approach for uplink resource allocation in a multichannel wireless access network
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Layering as optimization decomposition: questions and answers
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Hi-index | 0.00 |
We study a price-based rate control mechanism for random access networks. The mechanism uses channel feedback information to control the aggregate packet arrival rate. For our analysis, we use the standard slotted Aloha model with an infinite set of nodes. We show that the resulting Markov chain is positive recurrent. In addition, we characterize the throughput and delay at the operating point of the system and show how the operating point can be set a priori by appropriately choosing the control parameters. We illustrate our results using numerical experiments.