<?xml version='1.0'?>
<!DOCTYPE art SYSTEM 'http://www.biomedcentral.com/xml/article.dtd'>
<art>
   <ui>1687-1499-2010-651795</ui>
   <ji>1687-1499</ji>
   <fm>
      <dochead>Research Article</dochead>
      <bibl>
         <title>
            <p>Link Gain Matrix Estimation in Distributed Large-Scale Wireless Networks</p>
         </title>
         <aug>
            <au ca="yes" id="A1"><snm>Lei</snm><fnm>Jing</fnm><insr iid="I1"/><email>michelle.j.lei@gmail.com</email></au>
            <au id="A2"><snm>Greenstein</snm><fnm>Larry</fnm><insr iid="I1"/><email>ljg@winlab.rutgers.edu</email></au>
            <au id="A3"><snm>Yates</snm><fnm>Roy</fnm><insr iid="I1"/><email>ryates@winlab.rutgers.edu</email></au>
         </aug>
         <insg>
            <ins id="I1"><p>WINLAB, Department of ECE, Rutgers University, North Brunswick, NJ 08902, USA</p></ins>
         </insg>
         <source>EURASIP Journal on Wireless Communications and Networking</source>
         <issn>1687-1499</issn>
         <pubdate>2010</pubdate>
         <volume>2010</volume>
         <issue>1</issue>
         <fpage>651795</fpage>
         <url>http://jwcn.eurasipjournals.com/content/2010/1/651795</url>
         <xrefbib><pubid idtype="doi">10.1155/2010/651795</pubid></xrefbib>
      </bibl>
      <history><rec><date><day>9</day><month>6</month><year>2009</year></date></rec><revrec><date><day>1</day><month>10</month><year>2009</year></date></revrec><acc><date><day>25</day><month>11</month><year>2009</year></date></acc><pub><date><day>4</day><month>1</month><year>2010</year></date></pub></history>
      <cpyrt><year>2010</year><collab>The Author(s).</collab><note>This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</note></cpyrt>
      <abs>
         <sec>
            <st>
               <p/>
            </st>
            <p>In planning and using large-scale distributed wireless networks, knowledge of the link gain matrix can be highly valuable. If the number <inline-formula><graphic file="1687-1499-2010-651795-i1.gif"/></inline-formula> of radio nodes is large, measuring <inline-formula><graphic file="1687-1499-2010-651795-i2.gif"/></inline-formula> node-to-node link gains can be prohibitive. This motivates us to devise a methodology that measures a fraction of the links and accurately estimates the rest. Our method partitions the set of transmit-receive links into mutually exclusive categories, based on the number of obstructions or walls on the path; then it derives a separate link gain model for each category. The model is derived using gain measurements on only a small fraction of the links, selected on the basis of a maximum entropy. To evaluate the new method, we use ray-tracing to compute the "true" path gains for all links in the network. We use knowledge of a subset of those gains to derive the models and then use those models to predict the remaining path gains. We do this for three different environments of distributed nodes, including an office building with many obstructing walls. We find in all cases that the partitioning method yields acceptably low path gain estimation errors with a significantly reduced number of measurements.</p>
         </sec>
      </abs>
   </fm>
   <meta><classifications><classification id="SETB" subtype="theme_series_title" type="BMC">Simulators and Experimental Testbeds Design and Development for Wireless Networks</classification><classification id="SETB" subtype="theme_series_editor" type="BMC"/></classifications></meta><bdy>
      <sec>
         <st>
            <p>1. Introduction</p>
         </st>
         <p>The powerful technology and market trends towards portable computing and communications imply an increasingly important role for wireless access in the next-generation Internet. Moreover, distributed and pervasive computing applications are proliferating and expected to drive large-scale deployments of embedded computing devices interconnected via wireless links. Large-scale distributed wireless networks arise in a variety of forms. Examples include sensor networks, wherein data processing is distributed among the nodes [<abbr bid="B1">1</abbr>]; ad hoc mesh networks, wherein nodes act as relays for each other [<abbr bid="B2">2</abbr>]; and the laboratory testbeds used to evaluate sensor and mesh network protocols [<abbr bid="B3">3</abbr>]. In all these cases, the operation for the network can benefit from knowing the <it>link gain matrix</it>, which describes the transmitter-receiver power ratio among all the nodes in the network taken pairwise. </p>
         <p>A particular application of the gain matrix in testbeds is described in [<abbr bid="B4">4</abbr>, <abbr bid="B5">5</abbr>]. Motivated by the goal to advance the technology innovation in the wireless networking field, the Open Access Research Testbed for Next-Generation Wireless Networks (ORBIT) was built at Rutgers University's WINLAB facility [<abbr bid="B4">4</abbr>, <abbr bid="B5">5</abbr>], which focuses on the creation of a large-scale wireless network testbed and aims to facilitate a broad range of experimental research on novel protocols and application concepts. The proposed ORBIT system employs a two-tier laboratory emulator/field trial network to achieve reproducibility of experimentation, and supports evaluation of protocols and applications in real-world settings illustrated in Figure <figr fid="F1">1(a)</figr>. As shown by Figure <figr fid="F1">1(b)</figr>, the laboratory-based wireless network emulator is constructed with a large two-dimensional array of 802.11x radio nodes (400 nodes), which are uniformly spaced on a square grid of 20 meters by 20 meters and can be dynamically interconnected into specified topologies for reproducible wireless channel models. The number of pairwise link gains in this case is about 80,000. Due to obstructing pillars as well as <it>multipath</it> from reflecting walls, floor, and ceiling, the link gains depart significantly from a simple free-space pathloss description. Unfortunately, conventional stochastic pathloss models (e.g., [<abbr bid="B6">6</abbr>]) cannot be applied to laboratory testbed, and the alternative of making measurements over all node pairs can be impractical. Therefore, it is desirable to estimate all the path gains, if possible, using only a small fraction of the full number of measurements.</p>
         <fig id="F1"><title><p>Figure 1</p></title><caption><p>Mapping of real world environments onto the ORBIT indoor testbed.</p></caption><text>
   <p><b>Mapping of real world environments onto the ORBIT indoor testbed.</b> (a) Real world outdoor/indoor environment (b) 400-node ORBIT indoor testbed.</p>
</text><graphic file="1687-1499-2010-651795-1"/></fig>
         <p>In [<abbr bid="B7">7</abbr>], we considered the use of spatial interpolation for pathloss estimation. In this approach, a subset of link gains is measured, and then we invoke the assumption of smooth spatial variations to infer all other path gains via interpolation. For the 400-node ORBIT testbed, we found that the use of spatial interpolation methods permitted reasonably accurate estimates to be obtained using only a few thousand measurements instead of 80,000. However, we report here on an alternative approach that provides even better accuracies with even fewer measurements. The key to this new approach, and what makes it novel, is that the set of all node-to-node paths is partitioned into 3 or more categories, and a separate stochastic model is derived for each. By using a suitable means of categorization, we find that each model of pathloss versus log-distance fits a simple mathematical function with a low-standard deviation of values about the fit. Specifically, we show that using 1,000 measurements, and a heuristic method for choosing which links to measure, the RMS value of the errors in estimating link gains can be kept below 3&#8201;dB. As noted, the testbed environment we study is characterized by multipath and also by obstructions on many of the paths. To test our approach, we emulate the measurements of link gains by using WiSE, a ray-tracing tool developed by Bell Labs [<abbr bid="B8">8</abbr>]. In addition to the perfect square grid on the ORBIT testbed, we also apply the proposed method to a similar lab with larger obstructions and an irregular node layout in a building with many obstructing walls. We find that, even for a difficult scenario with numerous obstructions, the partitioning method yields acceptably low-path gain estimation errors with a much-reduced number of measurements. </p>
         <p>The rest of this paper is organized as follows. Models of both the environment and the node-to-node link gain (or pathloss) are given in Section 2. The new method for estimating link gains from limited measurements is described and exemplified in Section 3, and a method based on entropy is described for choosing the subset of transmitting nodes. In Section 4, two alternative, more complicated distributed network scenarios are postulated. For each, the entropy method for choosing transmitters and the new method for estimating link gains are applied, and numerical results are presented. Section 5 concludes the paper.</p>
      </sec>
      <sec>
         <st>
            <p>2. System Model</p>
         </st>
         <sec>
            <st>
               <p>2.1. Classification of Link Gains</p>
            </st>
            <p>With the help of WiSE [<abbr bid="B8">8</abbr>], we can obtain the set of all link gains for a specific environment as a function of its geometry. We have observed that in an indoor environment, the link gains deviate from the law of free-space propagation, due to the impacts of reflection, diffraction, and scattering. Furthermore, we have found that obstructed links, that is, those without a clear LOS path, usually undergo more severe attenuation than those with an LOS path, and the added attenuation caused by the obstructions is almost unrelated to the T-R separation distance [<abbr bid="B9">9</abbr>].</p>
            <p>Accordingly, the link between a given transmitter and receiver can be classified into one of several different categories according to the number of obstructing objects lying between them. A partition-based path loss analysis for in-home and residential areas at 5.85&#8201;GHz was conducted by Durgin et al. in [<abbr bid="B10">10</abbr>]. In this paper, we generalize their framework to distributed wireless networks and propose to estimate both the path loss exponent and attenuation factors using selectively sampled measurements.</p>
            <p>Consider the ORBIT testbed, for example, whose layout (top view) is shown in Figure <figr fid="F2">2</figr>. All the links are classified into three categories, namely, links having an LOS path, NLOS links traversing pillars only once, and NLOS links traversing pillars twice (there are no links traversing pillars three or more times in this particular grid). For convenience, in the following we will refer to the links in the three categories as types 0, 1, and 2, respectively.</p>
            <fig id="F2"><title><p>Figure 2</p></title><caption><p>Top view of layout of 400-nodes ORBIT testbed.</p></caption><text>
   <p><b>Top view of layout of 400-nodes ORBIT testbed.</b> Both the vertical and horizontal dimensions are measured in meters (m). The three added rectangles in the middle represent obstructing pillars. The 21 transmitters highlighted with red stars and circled within ellipses serve transmit-receive links in all three categories. All other transmitters serve links in only the first and second categories.</p>
</text><graphic file="1687-1499-2010-651795-2"/></fig>
            <p>More generally, let us assume that, in a given network of distributed wireless nodes, there are some paths between node pairs with as many as <inline-formula><graphic file="1687-1499-2010-651795-i3.gif"/></inline-formula> different types of obstructions. Then, according to our approach, there will be <inline-formula><graphic file="1687-1499-2010-651795-i4.gif"/></inline-formula> distinct categories (with one LOS category and <inline-formula><graphic file="1687-1499-2010-651795-i5.gif"/></inline-formula> NLOS categories) for the pathloss formula, where pathloss is the negative dB value of link gain (received power divided by transmitted power). Assume that <inline-formula><graphic file="1687-1499-2010-651795-i6.gif"/></inline-formula> is a conveniently chosen reference distance, which is typically <inline-formula><graphic file="1687-1499-2010-651795-i7.gif"/></inline-formula> meter in indoor environments; that <inline-formula><graphic file="1687-1499-2010-651795-i8.gif"/></inline-formula> is the pathloss at <inline-formula><graphic file="1687-1499-2010-651795-i9.gif"/></inline-formula> for a single direct ray free-space pathloss; that <inline-formula><graphic file="1687-1499-2010-651795-i10.gif"/></inline-formula> is the pathloss exponent for the <inline-formula><graphic file="1687-1499-2010-651795-i11.gif"/></inline-formula>th category; that <inline-formula><graphic file="1687-1499-2010-651795-i12.gif"/></inline-formula> denotes the pathloss of type <inline-formula><graphic file="1687-1499-2010-651795-i13.gif"/></inline-formula> at T-R separation distance <inline-formula><graphic file="1687-1499-2010-651795-i14.gif"/></inline-formula>. A generalized expression for the LOS (type 0) and NLOS (type 1 to type <inline-formula><graphic file="1687-1499-2010-651795-i15.gif"/></inline-formula>) pathloss estimate can be given by</p>
            <p/>
            <p>
               <display-formula id="M1">
                  <graphic file="1687-1499-2010-651795-i16.gif"/>
               </display-formula>
            </p>
            <p>where <inline-formula><graphic file="1687-1499-2010-651795-i17.gif"/></inline-formula>; <inline-formula><graphic file="1687-1499-2010-651795-i18.gif"/></inline-formula> is the wavelength; <inline-formula><graphic file="1687-1499-2010-651795-i19.gif"/></inline-formula> is the pathloss exponent of type <inline-formula><graphic file="1687-1499-2010-651795-i20.gif"/></inline-formula> links; <inline-formula><graphic file="1687-1499-2010-651795-i21.gif"/></inline-formula> denotes an added increment resulting from multipath and for <inline-formula><graphic file="1687-1499-2010-651795-i22.gif"/></inline-formula> obstructions.</p>
         </sec>
      </sec>
      <sec>
         <st>
            <p>3. Link Gain Matrix Estimation Based on Classified Links</p>
         </st>
         <sec>
            <st>
               <p>3.1. MMSE Estimation for the Model Parameters</p>
            </st>
            <p>Assume <inline-formula><graphic file="1687-1499-2010-651795-i23.gif"/></inline-formula>&#8201;m and that <inline-formula><graphic file="1687-1499-2010-651795-i24.gif"/></inline-formula> measurements of path loss for links of type <inline-formula><graphic file="1687-1499-2010-651795-i25.gif"/></inline-formula> are available, that is, <inline-formula><graphic file="1687-1499-2010-651795-i26.gif"/></inline-formula>. Then the MMSE estimate for the pathloss exponent and attenuations can be obtained by solving</p>
            <p/>
            <p>
               <display-formula id="M2">
                  <graphic file="1687-1499-2010-651795-i27.gif"/>
               </display-formula>
            </p>
            <p>where <inline-formula><graphic file="1687-1499-2010-651795-i28.gif"/></inline-formula>, <inline-formula><graphic file="1687-1499-2010-651795-i29.gif"/></inline-formula>,</p>
            <p/>
            <p>
               <display-formula id="M3">
                  <graphic file="1687-1499-2010-651795-i30.gif"/>
               </display-formula>
            </p>
            <p>denotes the difference between the actual path loss (measured by equipment or emulated using ray tracing tools) and the estimate based on our model in (1).</p>
            <p>For those links which are not measured, we can learn their T-R separations as well as their path type (i.e., value of <inline-formula><graphic file="1687-1499-2010-651795-i31.gif"/></inline-formula>) through a simple geometric analysis. Then, by plugging the MMSE estimates into (1), the unknown link gains can be predicted.</p>
         </sec>
         <sec>
            <st>
               <p>3.2. A Heuristic Approach and Some Results</p>
            </st>
            <p>In order to achieve a good tradeoff between estimation accuracy and the complexity of measurement, an appropriate choice for the sampling set of link gains is important. Unfortunately, this is beyond the scope of classical sampling theory. Therefore, we need to resort to some heuristics.</p>
            <p>To begin, let us consider the ORBIT testbed in Figure <figr fid="F2">2</figr>, which shows the 2-D top view of the 400-nodes. The three rectangles in the middle represent the obstructing pillars, and the uniformly-spaced dots denote the possible node locations. Through a simple geometrical calculation, we learned that to have a full diversity of links, that is, types <inline-formula><graphic file="1687-1499-2010-651795-i32.gif"/></inline-formula>, <inline-formula><graphic file="1687-1499-2010-651795-i33.gif"/></inline-formula>, and <inline-formula><graphic file="1687-1499-2010-651795-i34.gif"/></inline-formula> all included, the transmitters have to be placed on one of the 21 locations (within the ellipses highlighted), while the remaining locations do not have type <inline-formula><graphic file="1687-1499-2010-651795-i35.gif"/></inline-formula> links. Therefore, these 21 transmitter locations have more uncertainty than the remaining ones in terms of link types.</p>
            <p>Our design is to measure a total of 1,000 link gains, and to do so by using transmitters at the 21 locations within the highlighted ellipses. Then we randomly choose 350, 600 and 50 samples from links of types <inline-formula><graphic file="1687-1499-2010-651795-i36.gif"/></inline-formula>, <inline-formula><graphic file="1687-1499-2010-651795-i37.gif"/></inline-formula>, and <inline-formula><graphic file="1687-1499-2010-651795-i38.gif"/></inline-formula>, respectively. The numbers of samples are chosen to be proportional to the total number of link gains in each category. This set of choices constitutes a trial. For each trial, we estimate the link gain model parameters via (2), and then substitute them into (1) to obtain the set of link gain estimates, say <inline-formula><graphic file="1687-1499-2010-651795-i39.gif"/></inline-formula>. For each transmitter-receiver pair on the grid, we employed the ray tracing result from WiSE as our benchmark set of type <inline-formula><graphic file="1687-1499-2010-651795-i40.gif"/></inline-formula> link gain "measurements", say <inline-formula><graphic file="1687-1499-2010-651795-i41.gif"/></inline-formula>. The estimation error for a type <inline-formula><graphic file="1687-1499-2010-651795-i42.gif"/></inline-formula> link is then given by</p>
            <p/>
            <p>
               <display-formula id="M4">
                  <graphic file="1687-1499-2010-651795-i43.gif"/>
               </display-formula>
            </p>
            <p>We repeat the above experiments for 100 trials. </p>
            <p>For each type of link, we calculate the bias and standard deviations of <inline-formula><graphic file="1687-1499-2010-651795-i44.gif"/></inline-formula>, and plot them against the experimental trial index (1, 2,<inline-formula><graphic file="1687-1499-2010-651795-i45.gif"/></inline-formula>, 100) in (a)-(b) of Figures <figr fid="F3">3</figr>, <figr fid="F4">4</figr>, and <figr fid="F5">5</figr>. (The estimation accuracy of type <inline-formula><graphic file="1687-1499-2010-651795-i46.gif"/></inline-formula> NLOS links outperforms type <inline-formula><graphic file="1687-1499-2010-651795-i47.gif"/></inline-formula> links in this example. This is because the number of sampled links versus the number of unmeasured links is greater for type <inline-formula><graphic file="1687-1499-2010-651795-i48.gif"/></inline-formula> links with respect to our choice, that is, 50/(unmeasured number of type <inline-formula><graphic file="1687-1499-2010-651795-i49.gif"/></inline-formula> links) <inline-formula><graphic file="1687-1499-2010-651795-i50.gif"/></inline-formula> 600/(unmeasured number of type <inline-formula><graphic file="1687-1499-2010-651795-i51.gif"/></inline-formula> links). Basically, the relative estimation accuracy for each category depend on how we allocate the ratio of samples for a given number of measurements. The general principle of selective sampling should guarantee the link gain estimation accuracy for every category.) The common value of <inline-formula><graphic file="1687-1499-2010-651795-i52.gif"/></inline-formula> in these results was approximately <inline-formula><graphic file="1687-1499-2010-651795-i53.gif"/></inline-formula>. The solid lines in (a) and (b) denote the empirical bias and standard deviation for the estimation error <inline-formula><graphic file="1687-1499-2010-651795-i54.gif"/></inline-formula>, respectively; the dashed lines indicate the mean value over the <inline-formula><graphic file="1687-1499-2010-651795-i55.gif"/></inline-formula> trials. We can conclude from these results that the random choice of <inline-formula><graphic file="1687-1499-2010-651795-i56.gif"/></inline-formula> link samples can provide sufficient estimation accuracy. (As a rule-of-thumb on testbed experimentation, calibration errors below <inline-formula><graphic file="1687-1499-2010-651795-i57.gif"/></inline-formula>&#8201;dB can be considered quite acceptable.). The method proposed in this paper outperforms spatial interpolation methods. In a separate computation not reported here, we have found that our proposed method, using <inline-formula><graphic file="1687-1499-2010-651795-i58.gif"/></inline-formula> as many measurements, produces RMS estimation errors 3&#8211;4&#8201;dB lower than those using spatial interpolation. </p>
            <fig id="F3"><title><p>Figure 3</p></title><caption><p>Statistics of estimation error for type 0 (LOS) links for 100 trial selection of sample measurements.</p></caption><text>
   <p><b>Statistics of estimation error for type 0 (LOS) links for 100 trial selection of sample measurements.</b> The horizontal line is the average over the 100 trials. (a) Bias of <inline-formula><graphic file="1687-1499-2010-651795-i59.gif"/></inline-formula>, (b) Standard deviation of <inline-formula><graphic file="1687-1499-2010-651795-i60.gif"/></inline-formula>.</p>
</text><graphic file="1687-1499-2010-651795-3"/></fig>
            <fig id="F4"><title><p>Figure 4</p></title><caption><p>Statistics of estimation error for type 1 (NLOS) links for 100 trial selection of sample measurements.</p></caption><text>
   <p><b>Statistics of estimation error for type 1 (NLOS) links for 100 trial selection of sample measurements.</b> The horizontal line is the average over the 100 trials. (a) Bias of <inline-formula><graphic file="1687-1499-2010-651795-i61.gif"/></inline-formula>, (b) Standard deviation of <inline-formula><graphic file="1687-1499-2010-651795-i62.gif"/></inline-formula>.</p>
</text><graphic file="1687-1499-2010-651795-4"/></fig>
            <fig id="F5"><title><p>Figure 5</p></title><caption><p>Statistics of estimation error for type 2 (NLOS) links for 100 trial selection of sample measurements.</p></caption><text>
   <p><b>Statistics of estimation error for type 2 (NLOS) links for 100 trial selection of sample measurements.</b> The horizontal line is the average over the 100 trials. (a) Bias of <inline-formula><graphic file="1687-1499-2010-651795-i63.gif"/></inline-formula>, (b) Standard deviation of <inline-formula><graphic file="1687-1499-2010-651795-i64.gif"/></inline-formula>.</p>
</text><graphic file="1687-1499-2010-651795-5"/></fig>
         </sec>
         <sec>
            <st>
               <p>3.3. Maximum Entropy Sampling</p>
            </st>
            <p>Despite the success of the heuristic strategy for the ORBIT testbed, for a more general setup a quantitative or semianalytic approach is desired. The first problem we need to solve is the selection of measurements. Given the size of samples, our objective is to select a most informative subset of link gains. As is traditional, we use entropy as our measure of information since it is a robust measure of the information available from a set of random variables [<abbr bid="B11">11</abbr>]. To this end, let us assume that through site-specific analysis, the relative frequencies of type <inline-formula><graphic file="1687-1499-2010-651795-i65.gif"/></inline-formula> link gains over the node ensemble of size <inline-formula><graphic file="1687-1499-2010-651795-i66.gif"/></inline-formula> are known a priori, and are given by <inline-formula><graphic file="1687-1499-2010-651795-i67.gif"/></inline-formula>, <inline-formula><graphic file="1687-1499-2010-651795-i68.gif"/></inline-formula>. For links in each category, we characterize their "importance" or entropy by a constant [<abbr bid="B12">12</abbr>]</p>
            <p/>
            <p>
               <display-formula id="M5">
                  <graphic file="1687-1499-2010-651795-i69.gif"/>
               </display-formula>
            </p>
            <p>As a consequence, the entropy of transmitter <inline-formula><graphic file="1687-1499-2010-651795-i70.gif"/></inline-formula> can be quantized by the weighted sum of the <inline-formula><graphic file="1687-1499-2010-651795-i71.gif"/></inline-formula> TX-RX links propagating from it, that is,</p>
            <p/>
            <p>
               <display-formula id="M6">
                  <graphic file="1687-1499-2010-651795-i72.gif"/>
               </display-formula>
            </p>
            <p>where </p>
            <p/>
            <p>
               <display-formula id="M7">
                  <graphic file="1687-1499-2010-651795-i73.gif"/>
               </display-formula>
            </p>
            <p>Then the indices of transmitters, <inline-formula><graphic file="1687-1499-2010-651795-i74.gif"/></inline-formula>, are rearranged according to their entropy, yielding</p>
            <p/>
            <p>
               <display-formula id="M8">
                  <graphic file="1687-1499-2010-651795-i75.gif"/>
               </display-formula>
            </p>
            <p>As a test for the proposed maximum-entropy sampling strategy, we calculated the empirical entropy for all the transmitter locations in Figure <figr fid="F2">2</figr>. It is not surprising that the 21 transmitter locations highlighted in Figure <figr fid="F2">2</figr> stand out as the ones having the largest entropy.</p>
            <p>In light of (8), we can identify the locations for the transmitter-receiver pairs whose link gains are going to be measured. Specifically, assume that <inline-formula><graphic file="1687-1499-2010-651795-i76.gif"/></inline-formula> is the total number of link gain measurements for a size <inline-formula><graphic file="1687-1499-2010-651795-i77.gif"/></inline-formula> network, and that we will measure all the <inline-formula><graphic file="1687-1499-2010-651795-i78.gif"/></inline-formula> link gains between a transmitter, say <inline-formula><graphic file="1687-1499-2010-651795-i79.gif"/></inline-formula>, and its <inline-formula><graphic file="1687-1499-2010-651795-i80.gif"/></inline-formula> receivers. We can choose <inline-formula><graphic file="1687-1499-2010-651795-i81.gif"/></inline-formula> transmitter locations for sampling, which correspond to the first <inline-formula><graphic file="1687-1499-2010-651795-i82.gif"/></inline-formula> indices <inline-formula><graphic file="1687-1499-2010-651795-i83.gif"/></inline-formula> in (8). Considering the reciprocity of link gains, <inline-formula><graphic file="1687-1499-2010-651795-i84.gif"/></inline-formula> is a lower bound for candidate transmitter locations. It is worth noting that spatial correlation is not taken into account by (8). In other words, provided some of the nodes are close enough in space, the adjacent neighbors may exhibit similar entropy values because they are subject to very similar obstruction situations. To remove the redundancy incurred by spatial correlation, we can employ a spatial mask over a sufficiently small area to "filter out" the node with representative entropy value and have it serve as the centroid of a clustered neighborhood. </p>
         </sec>
      </sec>
      <sec>
         <st>
            <p>4. Results for More Complex Scenarios</p>
         </st>
         <p>The results so far are for a fairly benign scenario: A <inline-formula><graphic file="1687-1499-2010-651795-i85.gif"/></inline-formula> square grid in an open lab with three small obstructions. Here, we postulate two scenarios that are more difficult and evaluate the new method for each one, using the maximum-entropy strategy for selecting the links that are measured. The first scenario assumes an ORBIT-like testbed, except that the three obstructing pillars are irregularly placed and of various sizes. The second scenario assumes an irregular layout of <inline-formula><graphic file="1687-1499-2010-651795-i86.gif"/></inline-formula> nodes distributed throughout an office building with <inline-formula><graphic file="1687-1499-2010-651795-i87.gif"/></inline-formula> separation walls. Specifically, we consider the first floor of the Alcatel-Lucent building at Crawford Hill in Holmdel, New Jersey. This building has been the focus of numerous studies using the WiSE ray-tracing tool [<abbr bid="B13">13</abbr>&#8211;<abbr bid="B15">15</abbr>].</p>
         <sec>
            <st>
               <p>4.1. Modified Testbed Environment</p>
            </st>
            <p>As shown in Figure <figr fid="F6">6</figr>, the 400-nodes are still arranged into a 20 by 20 array, but the three pillars are reconfigured such that they are of different size and do not align with each other. In this experimental setup, all links are classified into four categories depending on the number of obstructions encountered. Specifically, the LOS links are denoted as type <inline-formula><graphic file="1687-1499-2010-651795-i88.gif"/></inline-formula>, whereas the NLOS links are grouped into type <inline-formula><graphic file="1687-1499-2010-651795-i89.gif"/></inline-formula>, type <inline-formula><graphic file="1687-1499-2010-651795-i90.gif"/></inline-formula>, and type <inline-formula><graphic file="1687-1499-2010-651795-i91.gif"/></inline-formula>, respectively. As shown in Figure <figr fid="F7">7</figr>, their relative frequencies (normalized by the number of LOS-type <inline-formula><graphic file="1687-1499-2010-651795-i92.gif"/></inline-formula>inks) are quite different, where the type 1 links significantly outnumber their type 2 and type 3 counterparts, resulting in their discrepancies of entropy.</p>
            <fig id="F6"><title><p>Figure 6</p></title><caption><p>Layout of imaginary case with 400 nodes and three obstructers in the middle.</p></caption><text>
   <p><b>Layout of imaginary case with 400 nodes and three obstructers in the middle.</b> Both the vertical and horizontal dimensions are measured in meters (m).</p>
</text><graphic file="1687-1499-2010-651795-6"/></fig>
            <fig id="F7"><title><p>Figure 7</p></title><caption><p>Relative size for the three types of NLOS links.</p></caption><text>
   <p><b>Relative size for the three types of NLOS links.</b> For each type <inline-formula><graphic file="1687-1499-2010-651795-i93.gif"/></inline-formula>, the number of NLOS links is normalized by the number of LOS links (type 0).</p>
</text><graphic file="1687-1499-2010-651795-7"/></fig>
            <p>In this exercise, we will specify <inline-formula><graphic file="1687-1499-2010-651795-i94.gif"/></inline-formula> measurements, considerably more than the 1,000 measurements for the simpler, more regular ORBIT Lab. This means that there will be <inline-formula><graphic file="1687-1499-2010-651795-i95.gif"/></inline-formula> transmitting nodes, each sending signals to be measured by the other 399 nodes.</p>
            <p>Figures <figr fid="F8">8(a)</figr>&#8211;<figr fid="F8">8(c)</figr> enumerates the number of type 1, 2, and 3 links for each possible sampling location <inline-formula><graphic file="1687-1499-2010-651795-i96.gif"/></inline-formula>. Based on Figures <figr fid="F6">6</figr> and <figr fid="F8">8</figr>, Figure <figr fid="F9">9</figr> shows the entropy value for each possible transmitter location. It is obvious that our sampling of link gains can focus on a small set of transmitter locations only, namely, those with the largest entropies. The clustering around the spikes (local maxima) can be attributed to the spatial correlation among adjacent transmitters. It can also be seen that there are 20 transmitter indices exhibiting local maximum values of typicality. We select these beacons for our experiment.</p>
            <fig id="F8"><title><p>Figure 8</p></title><caption><p>Number of NLOS links in each category as a function of transmitter location.</p></caption><text>
   <p><b>Number of NLOS links in each category as a function of transmitter location.</b> For convenience, the TX located on array coordinates <inline-formula><graphic file="1687-1499-2010-651795-i97.gif"/></inline-formula> is indexed by <inline-formula><graphic file="1687-1499-2010-651795-i98.gif"/></inline-formula>.T&#8722;R Pair Obstructed by 1 Pillar OnlyObstructed by 2 Pillars OnlyObstructed by 3 Pillars</p>
</text><graphic file="1687-1499-2010-651795-8"/></fig>
            <fig id="F9"><title><p>Figure 9</p></title><caption><p>Entropy of each possible transmitter location.</p></caption><text>
   <p>
      <b>Entropy of each possible transmitter location.</b>
   </p>
</text><graphic file="1687-1499-2010-651795-9"/></fig>
            <p>By sampling the link gains associated with the 20 transmitter locations (<inline-formula><graphic file="1687-1499-2010-651795-i99.gif"/></inline-formula>), we can obtain MMSE estimates for the LOS and NLOS pathloss exponents, attenuation factors, and then use them to predict the gains of all the unmeasured links. As a benchmark, we can collect the ensemble of pseudomeasurements given by ray tracing (using WiSE or other tools) and do the same estimation for modeling parameters as above. Figures <figr fid="F10">10(a)</figr>, <figr fid="F10">10(b)</figr> and <figr fid="F10">10(c)</figr> compare the difference of these two approaches. The bar on the left corresponds to the full ensemble, which involves all the link gains obtained by ray tracing; while the bar on the right corresponds to the selected samples from the ensemble. Employing the full ensemble of link gains obtained by ray tracing, the estimation for the pathloss exponents and attenuation dB factors are given by <inline-formula><graphic file="1687-1499-2010-651795-i100.gif"/></inline-formula>; and <inline-formula><graphic file="1687-1499-2010-651795-i101.gif"/></inline-formula>, respectively. In contrast, by invoking the proposed "maximum entropy sampling" method, the estimation for the pathloss exponents and attenuation factors are <inline-formula><graphic file="1687-1499-2010-651795-i102.gif"/></inline-formula>; and <inline-formula><graphic file="1687-1499-2010-651795-i103.gif"/></inline-formula>, respectively, which agree well with the previous derivations. We can see from these figures that, although the samples in the selected set are <inline-formula><graphic file="1687-1499-2010-651795-i104.gif"/></inline-formula> of the ensemble size (<inline-formula><graphic file="1687-1499-2010-651795-i105.gif"/></inline-formula>), the estimation accuracies for the pathloss parameters using the reduced set are within <inline-formula><graphic file="1687-1499-2010-651795-i106.gif"/></inline-formula> of the accuracies using the full set. Therefore, the efficacy of our selective sampling approach, which is based on the links' entropy, is verified.</p>
            <fig id="F10"><title><p>Figure 10</p></title><caption><p>Comparison of Pathloss Model Parameters and RMS Estimation Error for the Experimental Setup in Figure <figr fid="F6">6</figr>.Comparison of pathloss exponentsComparison of attenuation factorsComparison of RMS estimation error</p></caption><graphic file="1687-1499-2010-651795-10"/></fig>
         </sec>
         <sec>
            <st>
               <p>4.2. Mesh Network in an Office Building</p>
            </st>
            <p>Figure <figr fid="F11">11</figr> shows a top view of the first floor of the Crawford Hill building [<abbr bid="B13">13</abbr>]. We assume that <inline-formula><graphic file="1687-1499-2010-651795-i107.gif"/></inline-formula> wireless transceivers (nodes) are deployed in the offices and hallways with uniform randomness. Figure <figr fid="F12">12</figr> is a scatter plot of pathloss versus distance for the nearly <inline-formula><graphic file="1687-1499-2010-651795-i108.gif"/></inline-formula> transmit-receive paths among the <inline-formula><graphic file="1687-1499-2010-651795-i109.gif"/></inline-formula> nodes. The spread is large, but appropriate partitioning of the links can produce individual scatter plots of narrower spread.</p>
            <fig id="F11"><title><p>Figure 11</p></title><caption><p>Top view of first floor of the Crawford Hill Building, with 100 nodes (filled circles) distributed with uniform randomness.</p></caption><text>
   <p>
      <b>Top view of first floor of the Crawford Hill Building, with 100 nodes (filled circles) distributed with uniform randomness.</b>
   </p>
</text><graphic file="1687-1499-2010-651795-11"/></fig>
            <fig id="F12"><title><p>Figure 12</p></title><caption><p>Scatter plot of pathloss versus log-distance for all node-to-node link gains inside the Crawford Hill Building (Figure <figr fid="F11">11</figr>). Most of the points near the top are for LOS paths.</p></caption><graphic file="1687-1499-2010-651795-12"/></fig>
            <p>Before proceeding, we note that there is a small number of weak links where the pathloss falls below <inline-formula><graphic file="1687-1499-2010-651795-i110.gif"/></inline-formula>&#8201;dB. As a rule-of-thumb, we can ignore any link in this category, since the pathloss is so large that the two nodes can be regarded as "disconnected". As a result, there are <inline-formula><graphic file="1687-1499-2010-651795-i111.gif"/></inline-formula> link gains to model, of which <inline-formula><graphic file="1687-1499-2010-651795-i112.gif"/></inline-formula> are LOS (type 0) and <inline-formula><graphic file="1687-1499-2010-651795-i113.gif"/></inline-formula> are NLOS.</p>
            <p>The <inline-formula><graphic file="1687-1499-2010-651795-i114.gif"/></inline-formula> NLOS links can be further partitioned into links with one or two intervening walls (type 1); links with three or four intervening walls (type 2); and links with more than four intervening walls (type 3). Figure <figr fid="F13">13</figr> presents fitting parameters (<inline-formula><graphic file="1687-1499-2010-651795-i115.gif"/></inline-formula> and <inline-formula><graphic file="1687-1499-2010-651795-i116.gif"/></inline-formula>) and RMS fitting errors (<inline-formula><graphic file="1687-1499-2010-651795-i117.gif"/></inline-formula>) for two cases: in (a), all NLOS links are lumped into one category; and in (b), the NLOS links are partitioned, as above, into three categories. It is clear that the refined modeling corresponding to (b) provides a better fit to the scatter plots, since the average <inline-formula><graphic file="1687-1499-2010-651795-i118.gif"/></inline-formula> is significantly reduced by increasing <inline-formula><graphic file="1687-1499-2010-651795-i119.gif"/></inline-formula>. Little is gained in this case, however, by increasing <inline-formula><graphic file="1687-1499-2010-651795-i120.gif"/></inline-formula> beyond 4. </p>
            <fig id="F13"><title><p>Figure 13</p></title><caption><p>Results for two ways of partitioning links in the Crawford Hill Building.</p></caption><text>
   <p><b>Results for two ways of partitioning links in the Crawford Hill Building.</b> (a) LOS links and all NLOS links. (b) LOS links and three categories of NLOS links, based on number of intervening walls. For each case, the results given are for the model parameters, <inline-formula><graphic file="1687-1499-2010-651795-i121.gif"/></inline-formula> and <inline-formula><graphic file="1687-1499-2010-651795-i122.gif"/></inline-formula>, and the fitting error, <inline-formula><graphic file="1687-1499-2010-651795-i123.gif"/></inline-formula>. </p>
</text><graphic file="1687-1499-2010-651795-13"/></fig>
            <p>Now assume a target of <inline-formula><graphic file="1687-1499-2010-651795-i124.gif"/></inline-formula> link gain measurements, that is, about <inline-formula><graphic file="1687-1499-2010-651795-i125.gif"/></inline-formula> of the total number of link gains. By applying the sampling methodology of Section 3.3, we can pick the five transmitter nodes with maximum entropy and then measure their link gains (with respect to the rest of the network) to estimate the model parameters of (1). The outcome is shown in Figure <figr fid="F14">14</figr>, where the three bar graphs indicate the values of <inline-formula><graphic file="1687-1499-2010-651795-i126.gif"/></inline-formula>, <inline-formula><graphic file="1687-1499-2010-651795-i127.gif"/></inline-formula>, and RMS gain estimation error for each of the NLOS categories. The close agreements between the bars for the ensemble and those for the sample sets validate, again, the maximum-entropy approach for selecting transmitters. The RMS gain estimation errors are seen to be <inline-formula><graphic file="1687-1499-2010-651795-i128.gif"/></inline-formula> dB while, with all NLOS links lumped into one category, this error is close to 10 dB. This demonstrates the significant gain in accuracy by partitioning the NLOS links into several categories.</p>
            <fig id="F14"><title><p>Figure 14</p></title><caption><p>Model parameters and gain estimation errors for the Crawford Hill scenario in Figure <figr fid="F11">11</figr> with three NLOS categories. Results are shown for measurement of the full ensemble of link gains (left bars) and for measurement of a reduced set of 500 link gains (right bars). For the more conventional case where all NLOS links are lumped into one category, the RMS estimation error is close to 10&#8201;dB. Comparison of pathloss exponentsComparison of attenuation factorsComparison of RMS estimation error</p></caption><graphic file="1687-1499-2010-651795-14"/></fig>
            <p>Most mesh network scenarios will probably have a complexity lying between the two extremes of the ORBIT Lab and the Crawford Hill example, above. In that case, the RMS gain estimation errors for most cases are likely to lie between <inline-formula><graphic file="1687-1499-2010-651795-i129.gif"/></inline-formula> and <inline-formula><graphic file="1687-1499-2010-651795-i130.gif"/></inline-formula>&#8201;dB. The latter value might be reduced further, not by increasing <inline-formula><graphic file="1687-1499-2010-651795-i131.gif"/></inline-formula> but by alternative, novel arrangements for choosing the links to be measured. This is a topic for further research.</p>
         </sec>
      </sec>
      <sec>
         <st>
            <p>5. Conclusion</p>
         </st>
         <p>We have developed a link gain matrix estimation methodology for distributed nodes in wireless networks. In contrast to stochastic pathloss models with but one set of parameters, the proposed approach distinguishes among links with different numbers of path obstructions (or walls) and partitions them into separate models. We also developed a maximum-entropy method for selecting, in a structured way, the links to be measured. The results show that all gain matrix elements can be predicted with reasonable accuracy by measuring only a small fraction of all network links. Finally, the proposed method could be extended to outdoor networks, assuming the availability of site-specific data. This is due to the generality of the pathloss modeling, link partitioning, and transmitter selection approaches described here.</p>
      </sec>
   </bdy>
   <bm>
      <refgrp><bibl id="B1"><title><p>A survey on sensor networks</p></title><aug><au><snm>Akyildiz</snm><fnm>IF</fnm></au><au><snm>Su</snm><fnm>W</fnm></au><au><snm>Sankarasubramaniam</snm><fnm>Y</fnm></au><au><snm>Cayirci</snm><fnm>E</fnm></au></aug><source>IEEE Communications Magazine</source><pubdate>2002</pubdate><volume>40</volume><issue>8</issue><fpage>102</fpage><lpage>105</lpage><xrefbib><pubid idtype="doi">10.1109/MCOM.2002.1024422</pubid></xrefbib></bibl><bibl id="B2"><title><p>Wireless mesh networks: a survey</p></title><aug><au><snm>Akyildiz</snm><fnm>IF</fnm></au><au><snm>Wang</snm><fnm>X</fnm></au><au><snm>Wang</snm><fnm>W</fnm></au></aug><source>Computer Networks</source><pubdate>2005</pubdate><volume>47</volume><issue>4</issue><fpage>445</fpage><lpage>487</lpage></bibl><bibl id="B3"><title><p>Mapping link SNRs of real-world wireless networks onto an indoor testbed</p></title><aug><au><snm>Lei</snm><fnm>J</fnm></au><au><snm>Yates</snm><fnm>R</fnm></au><au><snm>Greenstein</snm><fnm>L</fnm></au><au><snm>Liu</snm><fnm>H</fnm></au></aug><source>IEEE Transactions on Wireless Communications</source><pubdate>2009</pubdate><volume>8</volume><issue>1</issue><fpage>157</fpage><lpage>165</lpage></bibl><bibl id="B4"><title><p>Wireless link SNR mapping onto an indoor testbed</p></title><aug><au><snm>Lei</snm><fnm>J</fnm></au><au><snm>Yates</snm><fnm>R</fnm></au><au><snm>Greenstein</snm><fnm>L</fnm></au><au><snm>Liu</snm><fnm>H</fnm></au></aug><source>Proceddings of the 1st International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM &apos;05), February 2005, Trento, Italy</source><fpage>130</fpage><lpage>135</lpage></bibl><bibl id="B5"><title><p>Mapping link SNRs of wireless mesh networks onto an indoor testbed</p></title><aug><au><snm>Lei</snm><fnm>J</fnm></au><au><snm>Yates</snm><fnm>R</fnm></au><au><snm>Greenstein</snm><fnm>L</fnm></au><au><snm>Liu</snm><fnm>H</fnm></au></aug><source>Proceedings of the 2nd International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM &apos;06), March 2006, Barcelona, Spain</source><fpage>389</fpage><lpage>395</lpage></bibl><bibl id="B6"><title><p>Empirically based path loss model for wireless channels in suburban environments</p></title><aug><au><snm>Erceg</snm><fnm>V</fnm></au><au><snm>Greenstein</snm><fnm>LJ</fnm></au><au><snm>Tjandra</snm><fnm>SY</fnm></au><etal/></aug><source>IEEE Journal on Selected Areas in Communications</source><pubdate>1999</pubdate><volume>17</volume><issue>7</issue><fpage>1205</fpage><lpage>1211</lpage><xrefbib><pubid idtype="doi">10.1109/49.778178</pubid></xrefbib></bibl><bibl id="B7"><title><p>Path loss estimation algorithms and results for RF sensor networks</p></title><aug><au><snm>Zhao</snm><fnm>X</fnm></au><au><snm>Razoumov</snm><fnm>L</fnm></au><au><snm>Greenstein</snm><fnm>LJ</fnm></au></aug><source>Proceedings of the 60th IEEE Vehicular Technology Conference (VTC &apos;04), September 2004</source><volume>7</volume><fpage>4593</fpage><lpage>4596</lpage></bibl><bibl id="B8"><title><p>WISE design of indoor wireless systems: practical computation and optimization</p></title><aug><au><snm>Fortune</snm><fnm>SJ</fnm></au><au><snm>Gay</snm><fnm>DM</fnm></au><au><snm>Kernighan</snm><fnm>BW</fnm></au><au><snm>Landron</snm><fnm>O</fnm></au><au><snm>Valenzuela</snm><fnm>RA</fnm></au><au><snm>Wright</snm><fnm>MH</fnm></au></aug><source>IEEE Computational Science &amp; Engineering</source><pubdate>1995</pubdate><volume>2</volume><issue>1</issue><fpage>58</fpage><lpage>68</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1109/99.372944</pubid><pubid idtype="pmpid" link="fulltext">21622076</pubid></pubidlist></xrefbib></bibl><bibl id="B9"><title><p>Interpolation techniques for ray-tracing models</p></title><aug><au><snm>Aguado</snm><fnm>F</fnm></au><au><snm>Isasi</snm><fnm>F</fnm></au><au><snm>Hernando</snm><fnm>JM</fnm></au><au><snm>Formella</snm><fnm>A</fnm></au><au><snm>Pagel</snm><fnm>S</fnm></au></aug><source>Microwave and Optical Technology Letters</source><pubdate>2000</pubdate><volume>25</volume><issue>5</issue><fpage>343</fpage><lpage>346</lpage><xrefbib><pubid idtype="doi">10.1002/(SICI)1098-2760(20000605)25:5&lt;343::AID-MOP15&gt;3.0.CO;2-X</pubid></xrefbib></bibl><bibl id="B10"><title><p>Partition-based path loss analysis for in-home and residential areas at 5.85 GHz</p></title><aug><au><snm>Durgin</snm><fnm>GD</fnm></au><au><snm>Rappaport</snm><fnm>TS</fnm></au><au><snm>Xu</snm><fnm>H</fnm></au></aug><source>Proceedings of the IEEE Global Telecommunications Conference, 1998, Sydney, Australia</source><volume>2</volume><fpage>904</fpage><lpage>909</lpage></bibl><bibl id="B11"><title><p>Consistent selectivity estimation via maximum entropy</p></title><aug><au><snm>Markl</snm><fnm>V</fnm></au><au><snm>Haas</snm><fnm>PJ</fnm></au><au><snm>Kutsch</snm><fnm>M</fnm></au><au><snm>Megiddo</snm><fnm>N</fnm></au><au><snm>Srivastava</snm><fnm>U</fnm></au><au><snm>Tran</snm><fnm>TM</fnm></au></aug><source>The VLDB Journal</source><pubdate>2007</pubdate><volume>16</volume><issue>1</issue><fpage>55</fpage><lpage>76</lpage></bibl><bibl id="B12"><title><p>Constrained maximum-entropy sampling</p></title><aug><au><snm>Lee</snm><fnm>J</fnm></au></aug><source>Operations Research</source><pubdate>1998</pubdate><volume>46</volume><issue>5</issue><fpage>655</fpage><lpage>664</lpage><xrefbib><pubid idtype="doi">10.1287/opre.46.5.655</pubid></xrefbib></bibl><bibl id="B13"><title><p>Indoor propagation prediction accuracy and speed versus number of reflections in image-based 3-D ray-tracing</p></title><aug><au><snm>Valenzuela</snm><fnm>RA</fnm></au><au><snm>Fortune</snm><fnm>S</fnm></au><au><snm>Ling</snm><fnm>J</fnm></au></aug><source>Proceedings of the 48th IEEE Vehicular Technology Conference (VTC &apos;98), 1998, Ottawa, Canada</source><volume>1</volume><fpage>539</fpage><lpage>543</lpage></bibl><bibl id="B14"><title><p>A physical-layer technique to enhance authentication for mobile terminals</p></title><aug><au><snm>Xiao</snm><fnm>L</fnm></au><au><snm>Greenstein</snm><fnm>L</fnm></au><au><snm>Mandayam</snm><fnm>N</fnm></au><au><snm>Trappe</snm><fnm>W</fnm></au></aug><source>Proceedings of IEEE International Conference on Communications (ICC &apos;08), 2008</source><fpage>1520</fpage><lpage>1524</lpage></bibl><bibl id="B15"><title><p>Emitter localization and visualization (ELVIS): a backward ray tracing algorithm for locating emitters</p></title><aug><au><snm>Kaya</snm><fnm>AO</fnm></au><au><snm>Greenstein</snm><fnm>L</fnm></au><au><snm>Chizhik</snm><fnm>D</fnm></au><au><snm>Valenzuela</snm><fnm>R</fnm></au><au><snm>Moayeri</snm><fnm>N</fnm></au></aug><source>Proceedings og the 41st Annual Conference on Information Sciences and Systems (CISS &apos;07), 2007, Baltimore, Md, USA</source><fpage>376</fpage><lpage>381</lpage></bibl></refgrp>
   </bm>
</art>