Wireless network positioning as a convex feasibility problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wireless network positioning as a convex feasibility problem

In this semi-tutorial paper, the positioning problem is formulated as a convex feasibility problem (CFP). To solve the CFP for non-cooperative networks, we consider the well-known projection onto convex sets (POCS) technique and study its properties for positioning. We also study outer-approximation (OA) methods to solve CFP problems. We then show how the POCS estimate can be upper bounded by s...

متن کامل

On the Convex Feasibility Problem

The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a family depending of the two characteristics: the emptiness and boudedness of the intersection of the family. The case four (the interior of the intersection...

متن کامل

Modeling of Partial Digest Problem as a Network flows problem

Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...

متن کامل

The Convex Feasibility Problem in Image Recovery∗

2 Mathematical Foundations 11 2.1 General Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.2 Geometrical Properties of Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.3 Strong and Weak Topologies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.4 Convex Functionals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

متن کامل

Solving the local positioning problem using a four-layer artificial neural network

Today, the global positioning systems (GPS) do not work well in buildings and in dense urban areas when there is no lines of sight between the user and their satellites. Hence, the local positioning system (LPS) has been considerably used in recent years. The main purpose of this research is to provide a four-layer artificial neural network based on nonlinear system solver (NLANN) for local pos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EURASIP Journal on Wireless Communications and Networking

سال: 2011

ISSN: 1687-1499

DOI: 10.1186/1687-1499-2011-161