Learn More
It is often useful to know the geographic positions of nodes in a communications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. We present an algorithm that uses connectivity information who is within communications range of whom to derive the locations of the nodes in the network. The method can take(More)
— It is often useful to know the geographic positions of nodes in a communications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. MDS-MAP is a recent localization method based on multidimensional scaling (MDS). It uses connectivity information—who is within communications range of whom—to derive the(More)
—We propose an approach that uses connectivity information—who is within communications range of whom—to derive the locations of nodes in a network. The approach can take advantage of additional information, such as estimated distances between neighbors or known positions for certain anchor nodes, if it is available. It is based on multidimensional scaling(More)
Satisfiability is a class of NP-complete problems that model a wide range of real-world applications. These problems are difficult to solve because they have many local minima in their search space, often trapping greedy search methods that utilize some form of descent. In this paper, we propose a new discrete Lagrange-multiplier-based global-search method(More)
—In ad-hoc wireless sensor networks, one approach for estimating the positions of sensor nodes is to use connectivity information of the network or local distance measurement. In this paper , we compare two representative methods, multilateration and MDS-MAP, and study some of their key issues that affect the performance. First, we study the various(More)
In this paper, we present a new discrete Lagrangian method for designing multiplierless QMF (quadrature mirror lter) banks. The lter coeecients in these lter banks are in powers-of-two (PO2), where numbers are represented as sums or diierences of powers of two (also called Canonical Signed Digit{CSD{representation), and multiplications are carried out as(More)
Satissability is a class of NP-complete problems that model a wide range of real-world applications. These problems are diicult to solve because they have many local minima in their search space, often trapping greedy search methods that utilize some form of descent. In this paper, we propose a new discrete Lagrange-multiplier-based global-search method for(More)