Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Asynchronous Stochastic Approximations
SIAM Journal on Control and Optimization
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
Opportunistic spectral usage: bounds and a multi-band CSMA/CA protocol
IEEE/ACM Transactions on Networking (TON)
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
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
Deadline Probing: Towards Timely Cognitive Wireless Network
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
A real-time message scheduler support for dual-sink mobile ad-hoc sensor networks
Proceedings of the 2009 ACM symposium on Applied Computing
Exploiting time and user diversity in distributed medium access control for mobile ad-hoc networks
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Proceedings of the 15th annual international conference on Mobile computing and networking
PHY-aware distributed scheduling for ad hoc communications with physical interference model
IEEE Transactions on Wireless Communications
Optimal channel probing and transmission scheduling for opportunistic spectrum access
IEEE/ACM Transactions on Networking (TON)
Rematch: a highly reliable scheduling algorithm on heterogeneous wireless mesh network
The Journal of Supercomputing
On scheduling in multi-channel wireless downlink networks with limited feedback
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Opportunistic multi-channel CSMA protocol for OFDMA systems
IEEE Transactions on Wireless Communications
On optimal feedback allocation in multichannel wireless downlinks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Contention resolution under selfishness
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Delay-tolerant delivery of quality information in ad hoc networks
Journal of Parallel and Distributed Computing
Cross-layer optimization for wireless mesh networks with smart antennas
Computer Communications
Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks
Journal of Parallel and Distributed Computing
On the use of optimal stopping theory for improving cache consistency
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Multivariate context collection in mobile sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approaching throughput optimality with limited feedback in multichannel wireless downlink networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distributed opportunistic scheduling 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 higher transmission rates. The desired tradeoff boils down to judiciously choosing the optimal stopping strategy for channel probing and the rate threshold. 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 strategy turns out to be a pure threshold policy, where the rate threshold can be obtained by solving a fixed point equation. We further devise an iterative algorithm for computing the threshold. Next, we explore DOS from a user-centric perspective, where each links seeks to maximize its own throughput. We treat the problem of rate threshold selections for different links as a non-cooperative 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. We then develop an online stochastic iterative algorithm using local observations only, and establish its convergence. Finally, we observe that there is an efficiency loss in terms of the throughput at the Nash equilibrium, and introduce apricing-based mechanism to mitigate the loss.