Approximation Algorithms for Maximum Link Scheduling under SINR-Based Interference Model
A fundamental problem in wireless networks is the maximum link scheduling (MLS) problem. In this problem, interference is a key issue and past researchers have shown that determining reception using Signal-to-Interference plus Noise Ratio (SINR) is more realistic than graph-based interference models...
Saved in:
| Main Authors: | Zi-Ao Zhou, Chang-Geng Li |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-07-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2015/120812 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Heuristic Algorithms for One-Slot Link Scheduling in Wireless Sensor Networks under SINR
by: Hui Deng, et al.
Published: (2015-03-01) -
Distributed Broadcast with Minimum Latency in Asynchronous Wireless Sensor Networks under SINR-Based Interference
by: Shiliang Xiao, et al.
Published: (2013-11-01) -
Robust Recursive Algorithm under Uncertainties via Worst-Case SINR Maximization
by: Xin Song, et al.
Published: (2015-01-01) -
Hypergraph Modeling and Approximation Algorithms for the Minimum Length Link Scheduling in Multiuser MIMO Networks
by: Hu Shen, et al.
Published: (2013-01-01) -
SDMA-Based Aeronautical Machine-to-Machine Communications under SINR Constraints
by: Jindong Xie, et al.
Published: (2013-12-01)