Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Non-cooperative uplink power control in cellular radio systems
Wireless Networks - Special issue transmitter power control
Asynchronous Stochastic Approximations
SIAM Journal on Control and Optimization
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
A rate-adaptive MAC protocol for multi-Hop wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Opportunistic media access for multirate ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Goodput Analysis and Link Adaptation for IEEE 802.11a Wireless LANs
IEEE Transactions on Mobile Computing
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Link-level measurements from an 802.11b mesh network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Exploiting medium access diversity in rate adaptive wireless LANs
Proceedings of the 10th annual international conference on Mobile computing and networking
Cross-Layer Exploitation of MAC Layer Diversity in Wireless Networks
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Game Theoretic Cross-Layer Transmission Policies in Multipacket Reception Wireless Networks
IEEE Transactions on Signal Processing
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Exploiting decentralized channel state information for random access
IEEE Transactions on Information Theory
Providing quality of service over a shared wireless link
IEEE Communications Magazine
Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks
IEEE Journal on Selected Areas in Communications
A framework for uplink power control in cellular radio systems
IEEE Journal on Selected Areas in Communications
Reinforcement learning for quality of service in mobile ad hoc network (MANET)
ICNVS'10 Proceedings of the 12th international conference on Networking, VLSI and signal processing
Multi-round contention in wireless LANs with multipacket reception
IEEE Transactions on Wireless Communications
Distributed opportunistic scheduling for ad-hoc communications under delay constraints
INFOCOM'10 Proceedings of the 29th conference on Information communications
Distributed opportunistic scheduling with two-level probing
IEEE/ACM Transactions on Networking (TON)
Distributed scheduling in a time-varying ad hoc network
Journal of Mobile Multimedia
Multiuser scheduling via dynamic optimization
WWIC'10 Proceedings of the 8th international conference on Wired/Wireless Internet Communications
Pricing-based decentralized spectrum access control in cognitive radio networks
IEEE/ACM Transactions on Networking (TON)
A game-theoretic approach to distributed opportunistic scheduling
IEEE/ACM Transactions on Networking (TON)
Hi-index | 754.84 |
In this paper, we study distributed opportunistic scheduling (DOS) in an ad hoc network, where many links contend for the same channel using random access. In such a network, DOS involves a process of joint channel probing and distributed scheduling. Due to channel fading, the link condition corresponding to a successful channel probing could be either good or poor. In the latter case, further channel probing, although at the cost of additional delay, may lead to better channel conditions and hence yield higher throughput. The desired tradeoff boils down to judiciously choosing the optimal stopping rule for channel probing and distributed scheduling. In this paper, we pursue a rigorous characterization of the optimal strategies from two perspectives, namely, a network-centric perspective and a user-centric perspective. We first consider DOS from a network-centric point of view, where links cooperate to maximize the overall network throughput. Using optimal stopping theory, we show that the optimal scheme for DOS turns out to be a pure threshold policy, where the rate threshold can be obtained by solving a fixed-point equation. We further devise iterative algorithms for computing the threshold. We also generalize the studies to take into account fairness requirements. Next, we explore DOS from a user-centric perspective, where each link seeks to maximize its own throughput. We treat the problem of threshold selection across different links as a noncooperative game. We explore the existence and uniqueness of the Nash equilibrium, and show that the Nash equilibrium can be approached by the best response strategy. Since the best response strategy requires message passing from neighboring nodes, we then develop an online stochastic iterative algorithm based on local observations only, and establish its convergence to the Nash equilibrium. Because there is an efficiency loss at the Nash equilibrium, we then study pricing-based mechanisms to mitigate the loss. Our results reveal that rich physical layer/MAC layer (PHY/MAC) diversities are available for exploitation in ad hoc networks.We believe that these initial steps open a new avenue for channel-aware distributed scheduling.