Threshold Based Scheduling for Dynamic Wireless Links

This direction is merged into another direction: threshold-based transmission policy. Its last version stays readable and citable here.

Version 1 of 115 papers21 conceptsfrozen 2026-10-04

In a wireless network, the environment is never static. Signal strength fluctuates, energy levels deplete, and data packets arrive in unpredictable bursts. For a mobile device, the fundamental question is not just how to transmit, but when.

If a device transmits immediately over a poor channel, it wastes energy and risks failure. If it waits too long for a perfect channel, it misses its deadline or overflows its buffer. Research across cognitive radio, relay networks, and remote estimation has converged on a singular, elegant solution: threshold-based optimal stopping.

The Opportunism of Waiting

At its core, wireless scheduling is a search problem. A transmitter probes the environment, looking for a "good enough" window to send data. Panlong Yang and Qihui Wu frame this in Deadline Probing: Towards Timely Cognitive Wireless Network as a balance between the cost of further probing and the risk of missing a packet's transmission deadline.

The intuition is similar to the "Secretary Problem" in mathematics. You don't need the absolute best channel state that will ever occur; you need the best state available before your time runs out. By modeling this as an optimal stopping problem, researchers show that the best strategy is a simple threshold: if the current channel quality exceeds a calculated value $H$, transmit immediately. If not, wait.

Why Thresholds are Optimal

Why does a simple "yes/no" threshold outperform more complex decision trees? The answer lies in the structure of the reward function. In Distributed Opportunistic Channel Access in Wireless Relay Networks, Hai Jiang and Zhou Zhang demonstrate that for systems with full channel state information, a "pure-threshold" rule maximizes throughput.

The threshold represents the opportunity cost of time. If you transmit now at rate $R$, you gain $R$ but lose the chance to transmit later. The optimal threshold is exactly the point where the immediate reward equals the expected future reward of waiting. In relay networks, this becomes a bi-level problem, but the threshold structure remains the most efficient way to balance the reward of high-rate transmissions against the time cost of repeated channel contention.

Balancing Energy and Delay

In real-world systems, we aren't just maximizing throughput; we are minimizing energy and delay. Xiaoyu Zhao and Ness Shroff explore this in Delay-Optimal and Energy-Efficient Communications with Markovian Arrivals. They find that the optimal policy follows a "monotone" threshold structure:

  • Better Channel $\rightarrow$ Lower Queue Threshold: If the signal is strong, you should be willing to transmit even if you only have a few packets in your buffer.
  • Worse Channel $\rightarrow$ Higher Queue Threshold: If the signal is weak, you should wait until your buffer is nearly full (increasing "queue pressure") before spending the energy to transmit.

This mechanism, also supported by the work of Mahdi Khodaian and Babak Khalaj in Adaptive access and rate control of CSMA, ensures that the system prioritizes high-efficiency windows. It treats energy as a precious resource that should only be "spent" when the return on investment (bits per joule) is high.

Decentralized Coordination Without Communication

One of the most powerful facets of threshold policies is their ability to coordinate decentralized networks. In Random access design for wireless control systems, Alejandro Ribeiro and George J. Pappas show that if every node in a network follows a local threshold rule based on its own channel quality, the entire network can achieve global stability and power efficiency.

Because each node only transmits when its local conditions are favorable, the "collision" probability naturally drops when conditions are poor, and the network "self-organizes" to favor the nodes with the clearest paths. This removes the need for a central controller to micromanage every transmission, drastically reducing overhead.

State-Aware Adaptation

Finally, these thresholds are rarely static. They adapt to the "state" of the system—whether that state is the amount of harvested energy or the current estimation error of a remote sensor.

Hang Li and Chuan Huang apply this to energy-harvesting users in Opportunistic Multi-Channel Access in Heterogeneous Networks, using a "save-then-transmit" threshold to decide the exact moment to stop gathering solar/RF energy and start sending data. Similarly, Aditya Mahajan and Jhelum Chakravorty demonstrate in Remote Estimation Over a Packet-Drop Channel that thresholds should fluctuate: a sensor should be more selective (higher threshold) when the channel is flaky and more aggressive (lower threshold) when the link is reliable.

By collapsing complex, multi-dimensional optimization problems into simple, state-dependent thresholds, these researchers provide a practical blueprint for making wireless networks both timely and efficient.

Papers in this version

History & citationVersion 1 · 2026-10-04

Merged into another direction · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_threshold_based_scheduling_for_dynamic_w_da606bc3,
  title = {Threshold Based Scheduling for Dynamic Wireless Links},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/threshold-based-scheduling-for-dynamic-wireless-links/rdr_da606bc38fbd48d7ad6a15aafff65915},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_threshold_based_scheduling_for_dynamic_w_da606bc3_v1,
  title = {Threshold Based Scheduling for Dynamic Wireless Links},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/threshold-based-scheduling-for-dynamic-wireless-links/rdr_da606bc38fbd48d7ad6a15aafff65915/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}