Heuristic Algorithms for One-Slot Link Scheduling in Wireless Sensor Networks under SINR
One-slot link scheduling is important for enhancing the throughput capacity of wireless sensor networks. It includes two aspects: maximum links scheduling (MLS) and maximum weighted links scheduling (MWLS). In this paper we propose two heuristic algorithms for the two NP-hard problems with obvious p...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-03-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2015/806520 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | One-slot link scheduling is important for enhancing the throughput capacity of wireless sensor networks. It includes two aspects: maximum links scheduling (MLS) and maximum weighted links scheduling (MWLS). In this paper we propose two heuristic algorithms for the two NP-hard problems with obvious power assignments under the SINR (signal-to-interference-plus-noise-ratio) model. For MLS, we propose an algorithm MTMA (maximum tolerance and minimum affectance ), which improves the currently best approximation algorithm by 28%–62% on average. For MWLS, we give an effective heuristic algorithm MWMA (maximum weighted and minimum affectance ), which performs better on improving the throughput and reducing the running time. The correctness and performance of our algorithms are confirmed through theoretical analysis and comprehensive simulations. |
|---|---|
| ISSN: | 1550-1477 |