Abstract

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.

Highlights

  • During the past two decades, wireless networks have obtained a fast and comprehensive development due to low cost, low power, and self-organization

  • We use the standard signal-to-interference-plus-noise-ratio (SINR) model, where a message can be transmitted successfully depending on the ratio of the received signal strength and the sum of the interference caused by nodes sending simultaneously plus noise level

  • It is easy to know that the length of link would affect the performance, because we focus on oblivious power assignments, where the received signal strength depends on the length of link

Read more

Summary

Introduction

During the past two decades, wireless networks have obtained a fast and comprehensive development due to low cost, low power, and self-organization. A fundamental problem is how many communication links can be concurrently transmitted. Compared to the graph-based model, the physical interference model has been recognized as a more realistic and accurate model for interference in wireless communications In this model, a communication is successful if and only if the ratio of the received signal to the total interference caused by all other concurrently transmitting nodes plus noise at the receiver is beyond a threshold. In wireless communication networks with limited resources, efficient resource allocation (e.g., power control, link scheduling) plays an important role in achieving good performance. Resource allocation in wireless networks involves solving a joint link scheduling and power allocation problem which is very difficult in general.

Related Works
Model and Definition
Maximum Tolerance and Minimum Affectance Based MLS Algorithm
Maximum Weighted and Minimum Affectance Based MWLS Algorithm
Numerical Results
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.