Heuristic Algorithms for One-Slot Link Scheduling in Wireless Sensor Networks under SINR | Zendy

Hui Deng | Zendy; Jiguo Yu | Zendy; Dongxiao Yu | Zendy; Guangshun Li | Zendy; Baogui Huang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Heuristic Algorithms for One-Slot Link Scheduling in Wireless Sensor Networks under SINR

Author(s) -

Hui Deng,

Jiguo Yu,

Dongxiao Yu,

Guangshun Li,

Baogui Huang

Publication year - 2015

Publication title -

international journal of distributed sensor networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.324

H-Index - 53

eISSN - 1550-1477

pISSN - 1550-1329

DOI - 10.1155/2015/806520

Subject(s) - computer science , scheduling (production processes) , correctness , algorithm , wireless sensor network , wireless network , heuristic , wireless , distributed computing , mathematical optimization , computer network , mathematics , telecommunications , artificial intelligence

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research