Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Network optimization and control
Foundations and Trends® in Networking
Performance of random medium access control, an asymptotic approach
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
A tutorial on cross-layer optimization in wireless networks
IEEE Journal on Selected Areas in Communications
Markov approximation for combinatorial network optimization
INFOCOM'10 Proceedings of the 29th conference on Information communications
Distributed SINR based scheduling algorithm for multi-hop wireless networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
On the stability of flow-aware CSMA
Performance Evaluation
Cross-layer design in multihop wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the performance of TCP over throughput-optimal CSMA
Proceedings of the Nineteenth International Workshop on Quality of Service
Delay performance of backlog based random access
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
IEEE/ACM Transactions on Networking (TON)
Backlog-based random access in wireless networks: fluid limits and delay issues
Proceedings of the 23rd International Teletraffic Congress
Adaptive optical burst switching
Proceedings of the 23rd International Teletraffic Congress
Stability of spatial wireless systems with random admissible-set scheduling
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Low-complexity scheduling for wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
IEEE/ACM Transactions on Networking (TON)
Performance of CSMA in multi-channel wireless networks
Queueing Systems: Theory and Applications
Stability and delay of distributed scheduling algorithms for networks of conflicting queues
Queueing Systems: Theory and Applications
On distributed scheduling with heterogeneously delayed network-state information
Queueing Systems: Theory and Applications
Embedding of virtual network requests over static wireless multihop networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Delays and mixing times in random-access networks
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
CSMA over time-varying channels: optimality, uniqueness and limited backoff rate
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
v(t) CSMA: a link scheduling algorithm in wireless networks with improved delay characteristics
Proceedings of the 19th annual international conference on Mobile computing & networking
IEEE/ACM Transactions on Networking (TON)
Random access in wireless networks: how much aggressiveness can cause instability?
ACM SIGMETRICS Performance Evaluation Review
Delay-guaranteed cross-layer scheduling in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can never occur. In addition, simulation results indicate that the delay performance of these algorithms can be quite bad. On the other hand, although some simple heuristics (such as distributed approximations of greedy maximal scheduling) can yield much better delay performance for a large set of arrival rates, they may only achieve a fraction of the capacity region in general. In this paper, we propose a discrete-time version of the CSMA algorithm. Central to our results is a discrete-time distributed randomized algorithm which is based on a generalization of the so-called Glauber dynamics from statistical physics, where multiple links are allowed to update their states in a single time slot. The algorithm generates collision-free transmission schedules while explicitly taking collisions into account during the control phase of the protocol, thus relaxing the perfect CSMA assumption. More importantly, the algorithm allows us to incorporate delay-reduction mechanisms which lead to very good delay performance while retaining the throughput-optimality property.