SINR based shortest link scheduling with oblivious power control in wireless networks

详细信息    查看全文

• 作者：Baogui Huang^a ; ^b ; ^{hjbaogui@126.com" class="auth_mail" title="E-mail the corresponding author} ; Jiguo Yu^a ; ^b ; ^{jiguoyu@sina.com" class="auth_mail" title="E-mail the corresponding author} ; Xiuzhen Cheng^c ; ^{cheng@gwu.edu" class="auth_mail" title="E-mail the corresponding author} ; Honglong Chen^d ; ^{chenhl@upc.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Hang Liu^e ; ^{liuh@cua.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Wireless network ; Shortest link scheduling ; SINR ; Oblivious power assignment
• 刊名：Journal of Network and Computer Applications
• 出版年：2017
• 出版时间：1 January 2017
• 年：2017
• 卷：77
• 期：Complete
• 页码：64-72
• 全文大小：1093 K

文摘

In this paper, we consider shortest link scheduling (SLS), a fundamental problem in wireless networks to improve the network performance, under the signal-to-interference-plus-noise-ratio (SINR) constraints. It is challenging to design efficient SLS algorithms due to the intrinsic non-locality of SINR. However, if two transmission links are far away from each other, the interference of one link on the other should be small under the SINR model. This motivates us to consider the interference only in a local area, which decreases the difficulty of designing link scheduling under SINR, by partitioning the links into disjoint local link sets with a certain distance away from each other, such that independent scheduling inside each local link set is possible. Based on this idea, we propose a novel approximation algorithm PPSLS (Plane Partition based Shortest Link Scheduling) for SLS with oblivious power control. Theoretical analysis and simulations demonstrate the correctness and effectiveness of the proposed algorithm.