NDLI: Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach

Please wait, while we are loading the content...

Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach

Social network analysis for routing in disconnected delay-tolerant MANETs

Containing denial-of-service attacks in broadcast authentication in sensor networks

Complexity in geometric SINR

Analysis of multi-hop emergency message propagation in vehicular ad hoc networks

Maximum-lifetime routing: system optimization & game-theoretic perspectives

Sensor network minimal energy routing with latency guarantees

Capacity of multi-channel wireless networks with random (c, f) assignment

On exploiting asymmetric wireless links via one-way estimation

Capacity scaling in delay tolerant networks with heterogeneous mobile nodes

A randomized, efficient, and distributed protocol for the detection of node replication attacks in wireless sensor networks

Cross-layer latency minimization in wireless networks with SINR constraints

Secure incentives for commercial ad dissemination in vehicular networks

Balancing traffic load in wireless networks with curveball routing

Distributed energy management algorithm for large-scale wireless sensor networks

Capacity of a wireless ad hoc network with infrastructure

A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges

Scalable routing in delay tolerant networks

A random perturbation-based scheme for pairwise key establishment in sensor networks

Characterization and analysis of multi-hop wireless MIMO network throughput

Distributed algorithms for spectrum allocation, power control, routing, and congestion control in wireless networks

Outlier detection in sensor networks

The multicast capacity of large multihop wireless networks

Surviving attacks on disruption-tolerant networks without authentication

Allocating dynamic time-spectrum blocks in cognitive radio networks

Approximation algorithms for longest-lived directional multicast communications in WANETs

Bounds for the capacity of wireless multihop networks imposed by topology and demand

Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach

Content Provider	ACM Digital Library
Author	Zhang, Junshan Ge, Weiyan Zheng, Dong
Abstract	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.
Starting Page	1
Ending Page	10
Page Count	10
File Format	PDF
ISBN	9781595936844
DOI	10.1145/1288107.1288109
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-09-09
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Optimal stopping Ad-hoc networks Game theory Distributed opportunistic scheduling
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Distributed Opportunistic Scheduling for Ad Hoc Networks With Random Access: An Optimal Stopping Approach

Distributed opportunistic scheduling for ad hoc communications with imperfect channel information

Distributed opportunistic scheduling for ad-hoc communications: An optimal stopping approach

Distributed opportunistic scheduling for ad-hoc communications: An optimal stopping approach (2007)

Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view

Distributed Opportunistic Scheduling for Wireless Ad-Hoc Networks with Block-Fading Model

ABSTRACT Distributed Opportunistic Scheduling For Ad-Hoc Communications: An Optimal Stopping Approach ∗

Distributed opportunistic scheduling with two-level probing

Distributed Opportunistic Scheduling With Two-Level Probing

Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach

Similar Documents

Distributed Opportunistic Scheduling for Ad Hoc Networks With Random Access: An Optimal Stopping Approach

Distributed opportunistic scheduling for ad hoc communications with imperfect channel information

Distributed opportunistic scheduling for ad-hoc communications: An optimal stopping approach

Distributed opportunistic scheduling for ad-hoc communications: An optimal stopping approach (2007)

Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view

Distributed Opportunistic Scheduling for Wireless Ad-Hoc Networks with Block-Fading Model

ABSTRACT Distributed Opportunistic Scheduling For Ad-Hoc Communications: An Optimal Stopping Approach ∗

Distributed opportunistic scheduling with two-level probing

Distributed Opportunistic Scheduling With Two-Level Probing

Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach