The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication

Author:

Kantor Erez1,Lotker Zvi2,Parter Merav3,Peleg David3

Affiliation:

1. MIT, Cambridge, USA

2. Ben Gurion University, Beer Sheva, Israel

3. Weizmann Institute of Science, Rehovot, Israel

Abstract

Theoretical study of optimization problems in wireless communication often deals with tasks that concern a single point. For example, the power control problem requires computing a power assignment guaranteeing that each transmitting station s i is successfully received at a single receiver point r i . This paper aims at addressing communication applications that require handling two-dimensional tasks (e.g., guaranteeing successful transmission in entire regions rather than at specific points). The natural approach to two-dimensional optimization tasks is to discretize the optimization domain, e.g., by sampling points within the domain. The straightforward implementation of the discretization approach, however, might incur high time and memory requirements, and moreover, it cannot guarantee exact solutions. The alternative proposed and explored in this paper is based on establishing the minimum principle 1 for the signal to interference and noise ratio (SINR) function with free space path loss (i.e., when the signal decays in proportion to the square of the distance between the transmitter and receiver). Essentially, the minimum principle allows us to reduce the dimension of the optimization domain without losing anything in the accuracy or quality of the solution. More specifically, when the two-dimensional optimization domain is bounded and free from any interfering station, the minimum principle implies that it is sufficient to optimize the SINR function over the boundary of the domain, as the “hardest” points to be satisfied reside on the boundary and not in the interior. We then utilize the minimum principle as the basis for an improved discretization technique for solving two-dimensional problems in the SINR model. This approach is shown to be useful for handling optimization problems over two dimensions (e.g., power control, energy minimization); in providing tight bounds on the number of null cells in the reception map; and in approximating geometric and topological properties of the wireless reception map (e.g., maximum inscribed sphere). The minimum principle, as well as the interplay between continuous and discrete analysis presented in this paper, are expected to pave the way to future study of algorithmic SINR in higher dimensions.

Funder

Foundation des Sciences Mathematiques de Paris

Ministry of Science Technology and Space, Israel

French-Israeli Laboratory FILOFOCS

NSF

Israel Science Foundation

United States-Israel Binational Science Foundation

Israel Ministry of Science and Technology

Citi Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Reference24 articles.

1. Alfred V. Aho John E. Hopcroft and Jeffrey D. Ullman. 1976. The design and analysis of computer algorithms. (1976).

2. Batched Point Location in SINR Diagrams via Algebraic Tools

3. SINR diagrams: Convexity and its applications in wireless networks;Avin C.;J. ACM,2012

4. Saugata Basu, Richard Pollack, and Marie-Françoise Coste-Roy. 2007. Algorithms in Real Algebraic Geometry. Vol. 10. Springer Science & Business Media.

5. Wireless Link Scheduling With Power Control and SINR Constraints

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3