Cooling schedules for optimal annealing
Mathematics of Operations Research
Complexity in wireless scheduling: impact and tradeoffs
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
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
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
One of the key messages in significant research on cross-layer design of wireless networks over the past 15 years is that extensive message passing may be necessary to achieve optimal performance. Heavy message passing is obviously an undesirable feature for practical implementation due to its reduced actual throughput and security issues. In this paper, we first summarize our preliminary work that does not need message passing, yet achieves near-optimality. Then, we present our recent efforts to realize such an algorithmic solution in a real network, e.g., IEEE 802.11-based systems, and discuss possible future research directions.