Skip to main content
  • Research Article
  • Open access
  • Published:

Link Gain Matrix Estimation in Distributed Large-Scale Wireless Networks

Abstract

In planning and using large-scale distributed wireless networks, knowledge of the link gain matrix can be highly valuable. If the number of radio nodes is large, measuring 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.

1. Introduction

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 [1]; ad hoc mesh networks, wherein nodes act as relays for each other [2]; and the laboratory testbeds used to evaluate sensor and mesh network protocols [3]. In all these cases, the operation for the network can benefit from knowing the link gain matrix, which describes the transmitter-receiver power ratio among all the nodes in the network taken pairwise.

A particular application of the gain matrix in testbeds is described in [4, 5]. 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 [4, 5], 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 1(a). As shown by Figure 1(b), 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 multipath 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., [6]) 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.

Figure 1
figure 1

Mapping of real world environments onto the ORBIT indoor testbed. (a) Real world outdoor/indoor environment (b) 400-node ORBIT indoor testbed.

In [7], 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 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 [8]. 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.

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.

2. System Model

2.1. Classification of Link Gains

With the help of WiSE [8], 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 [9].

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 GHz was conducted by Durgin et al. in [10]. 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.

Consider the ORBIT testbed, for example, whose layout (top view) is shown in Figure 2. 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.

Figure 2
figure 2

Top view of layout of 400-nodes ORBIT testbed. 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.

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 different types of obstructions. Then, according to our approach, there will be distinct categories (with one LOS category and NLOS categories) for the pathloss formula, where pathloss is the negative dB value of link gain (received power divided by transmitted power). Assume that is a conveniently chosen reference distance, which is typically meter in indoor environments; that is the pathloss at for a single direct ray free-space pathloss; that is the pathloss exponent for the th category; that denotes the pathloss of type at T-R separation distance . A generalized expression for the LOS (type 0) and NLOS (type 1 to type ) pathloss estimate can be given by

(1)

where ; is the wavelength; is the pathloss exponent of type links; denotes an added increment resulting from multipath and for obstructions.

3. Link Gain Matrix Estimation Based on Classified Links

3.1. MMSE Estimation for the Model Parameters

Assume  m and that measurements of path loss for links of type are available, that is, . Then the MMSE estimate for the pathloss exponent and attenuations can be obtained by solving

(2)

where , ,

(3)

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).

For those links which are not measured, we can learn their T-R separations as well as their path type (i.e., value of ) through a simple geometric analysis. Then, by plugging the MMSE estimates into (1), the unknown link gains can be predicted.

3.2. A Heuristic Approach and Some Results

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.

To begin, let us consider the ORBIT testbed in Figure 2, 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 , , and 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 links. Therefore, these 21 transmitter locations have more uncertainty than the remaining ones in terms of link types.

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 , , and , 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 . For each transmitter-receiver pair on the grid, we employed the ray tracing result from WiSE as our benchmark set of type link gain "measurements", say . The estimation error for a type link is then given by

(4)

We repeat the above experiments for 100 trials.

For each type of link, we calculate the bias and standard deviations of , and plot them against the experimental trial index (1, 2,, 100) in (a)-(b) of Figures 3, 4, and 5. (The estimation accuracy of type NLOS links outperforms type links in this example. This is because the number of sampled links versus the number of unmeasured links is greater for type links with respect to our choice, that is, 50/(unmeasured number of type links) 600/(unmeasured number of type 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 in these results was approximately . The solid lines in (a) and (b) denote the empirical bias and standard deviation for the estimation error , respectively; the dashed lines indicate the mean value over the trials. We can conclude from these results that the random choice of link samples can provide sufficient estimation accuracy. (As a rule-of-thumb on testbed experimentation, calibration errors below  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 as many measurements, produces RMS estimation errors 3–4 dB lower than those using spatial interpolation.

Figure 3
figure 3

Statistics of estimation error for type 0 (LOS) links for 100 trial selection of sample measurements. The horizontal line is the average over the 100 trials. (a) Bias of , (b) Standard deviation of .

Figure 4
figure 4

Statistics of estimation error for type 1 (NLOS) links for 100 trial selection of sample measurements. The horizontal line is the average over the 100 trials. (a) Bias of , (b) Standard deviation of .

Figure 5
figure 5

Statistics of estimation error for type 2 (NLOS) links for 100 trial selection of sample measurements. The horizontal line is the average over the 100 trials. (a) Bias of , (b) Standard deviation of .

3.3. Maximum Entropy Sampling

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 [11]. To this end, let us assume that through site-specific analysis, the relative frequencies of type link gains over the node ensemble of size are known a priori, and are given by , . For links in each category, we characterize their "importance" or entropy by a constant [12]

(5)

As a consequence, the entropy of transmitter can be quantized by the weighted sum of the TX-RX links propagating from it, that is,

(6)

where

(7)

Then the indices of transmitters, , are rearranged according to their entropy, yielding

(8)

As a test for the proposed maximum-entropy sampling strategy, we calculated the empirical entropy for all the transmitter locations in Figure 2. It is not surprising that the 21 transmitter locations highlighted in Figure 2 stand out as the ones having the largest entropy.

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 is the total number of link gain measurements for a size network, and that we will measure all the link gains between a transmitter, say , and its receivers. We can choose transmitter locations for sampling, which correspond to the first indices in (8). Considering the reciprocity of link gains, 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.

4. Results for More Complex Scenarios

The results so far are for a fairly benign scenario: A 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 nodes distributed throughout an office building with 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 [13–15].

4.1. Modified Testbed Environment

As shown in Figure 6, 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 , whereas the NLOS links are grouped into type , type , and type , respectively. As shown in Figure 7, their relative frequencies (normalized by the number of LOS-type inks) are quite different, where the type 1 links significantly outnumber their type 2 and type 3 counterparts, resulting in their discrepancies of entropy.

Figure 6
figure 6

Layout of imaginary case with 400 nodes and three obstructers in the middle. Both the vertical and horizontal dimensions are measured in meters (m).

Figure 7
figure 7

Relative size for the three types of NLOS links. For each type , the number of NLOS links is normalized by the number of LOS links (type 0).

In this exercise, we will specify measurements, considerably more than the 1,000 measurements for the simpler, more regular ORBIT Lab. This means that there will be transmitting nodes, each sending signals to be measured by the other 399 nodes.

Figures 8(a)–8(c) enumerates the number of type 1, 2, and 3 links for each possible sampling location . Based on Figures 6 and 8, Figure 9 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.

Figure 8
figure 8

Number of NLOS links in each category as a function of transmitter location. For convenience, the TX located on array coordinates is indexed by .T−R Pair Obstructed by 1 Pillar OnlyObstructed by 2 Pillars OnlyObstructed by 3 Pillars

Figure 9
figure 9

Entropy of each possible transmitter location.

By sampling the link gains associated with the 20 transmitter locations (), 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 10(a), 10(b) and 10(c) 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 ; and , respectively. In contrast, by invoking the proposed "maximum entropy sampling" method, the estimation for the pathloss exponents and attenuation factors are ; and , respectively, which agree well with the previous derivations. We can see from these figures that, although the samples in the selected set are of the ensemble size (), the estimation accuracies for the pathloss parameters using the reduced set are within of the accuracies using the full set. Therefore, the efficacy of our selective sampling approach, which is based on the links' entropy, is verified.

Figure 10
figure 10

Comparison of Pathloss Model Parameters and RMS Estimation Error for the Experimental Setup in Figure 6.Comparison of pathloss exponentsComparison of attenuation factorsComparison of RMS estimation error

4.2. Mesh Network in an Office Building

Figure 11 shows a top view of the first floor of the Crawford Hill building [13]. We assume that wireless transceivers (nodes) are deployed in the offices and hallways with uniform randomness. Figure 12 is a scatter plot of pathloss versus distance for the nearly transmit-receive paths among the nodes. The spread is large, but appropriate partitioning of the links can produce individual scatter plots of narrower spread.

Figure 11
figure 11

Top view of first floor of the Crawford Hill Building, with 100 nodes (filled circles) distributed with uniform randomness.

Figure 12
figure 12

Scatter plot of pathloss versus log-distance for all node-to-node link gains inside the Crawford Hill Building (Figure 11). Most of the points near the top are for LOS paths.

Before proceeding, we note that there is a small number of weak links where the pathloss falls below  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 link gains to model, of which are LOS (type 0) and are NLOS.

The 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 13 presents fitting parameters ( and ) and RMS fitting errors () 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 is significantly reduced by increasing . Little is gained in this case, however, by increasing beyond 4.

Figure 13
figure 13

Results for two ways of partitioning links in the Crawford Hill Building. (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, and , and the fitting error, .

Now assume a target of link gain measurements, that is, about 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 14, where the three bar graphs indicate the values of , , 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 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.

Figure 14
figure 14

Model parameters and gain estimation errors for the Crawford Hill scenario in Figure 11 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 dB. Comparison of pathloss exponentsComparison of attenuation factorsComparison of RMS estimation error

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 and  dB. The latter value might be reduced further, not by increasing but by alternative, novel arrangements for choosing the links to be measured. This is a topic for further research.

5. Conclusion

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.

References

  1. Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E: A survey on sensor networks. IEEE Communications Magazine 2002, 40(8):102-105. 10.1109/MCOM.2002.1024422

    Article  Google Scholar 

  2. Akyildiz IF, Wang X, Wang W: Wireless mesh networks: a survey. Computer Networks 2005, 47(4):445-487.

    Article  MATH  Google Scholar 

  3. Lei J, Yates R, Greenstein L, Liu H: Mapping link SNRs of real-world wireless networks onto an indoor testbed. IEEE Transactions on Wireless Communications 2009, 8(1):157-165.

    Article  Google Scholar 

  4. Lei J, Yates R, Greenstein L, Liu H: Wireless link SNR mapping onto an indoor testbed. Proceddings of the 1st International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM '05), February 2005, Trento, Italy 130-135.

    Google Scholar 

  5. Lei J, Yates R, Greenstein L, Liu H: Mapping link SNRs of wireless mesh networks onto an indoor testbed. Proceedings of the 2nd International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM '06), March 2006, Barcelona, Spain 389-395.

    Google Scholar 

  6. Erceg V, Greenstein LJ, Tjandra SY, et al.: Empirically based path loss model for wireless channels in suburban environments. IEEE Journal on Selected Areas in Communications 1999, 17(7):1205-1211. 10.1109/49.778178

    Article  Google Scholar 

  7. Zhao X, Razoumov L, Greenstein LJ: Path loss estimation algorithms and results for RF sensor networks. Proceedings of the 60th IEEE Vehicular Technology Conference (VTC '04), September 2004 7: 4593-4596.

    Google Scholar 

  8. Fortune SJ, Gay DM, Kernighan BW, Landron O, Valenzuela RA, Wright MH: WISE design of indoor wireless systems: practical computation and optimization. IEEE Computational Science & Engineering 1995, 2(1):58-68. 10.1109/99.372944

    Article  Google Scholar 

  9. Aguado F, Isasi F, Hernando JM, Formella A, Pagel S: Interpolation techniques for ray-tracing models. Microwave and Optical Technology Letters 2000, 25(5):343-346. 10.1002/(SICI)1098-2760(20000605)25:5<343::AID-MOP15>3.0.CO;2-X

    Article  Google Scholar 

  10. Durgin GD, Rappaport TS, Xu H: Partition-based path loss analysis for in-home and residential areas at 5.85 GHz. Proceedings of the IEEE Global Telecommunications Conference, 1998, Sydney, Australia 2: 904-909.

    Google Scholar 

  11. Markl V, Haas PJ, Kutsch M, Megiddo N, Srivastava U, Tran TM: Consistent selectivity estimation via maximum entropy. The VLDB Journal 2007, 16(1):55-76.

    Article  Google Scholar 

  12. Lee J: Constrained maximum-entropy sampling. Operations Research 1998, 46(5):655-664. 10.1287/opre.46.5.655

    Article  MATH  Google Scholar 

  13. Valenzuela RA, Fortune S, Ling J: Indoor propagation prediction accuracy and speed versus number of reflections in image-based 3-D ray-tracing. Proceedings of the 48th IEEE Vehicular Technology Conference (VTC '98), 1998, Ottawa, Canada 1: 539-543.

    Google Scholar 

  14. Xiao L, Greenstein L, Mandayam N, Trappe W: A physical-layer technique to enhance authentication for mobile terminals. Proceedings of IEEE International Conference on Communications (ICC '08), 2008 1520-1524.

    Google Scholar 

  15. Kaya AO, Greenstein L, Chizhik D, Valenzuela R, Moayeri N: Emitter localization and visualization (ELVIS): a backward ray tracing algorithm for locating emitters. Proceedings og the 41st Annual Conference on Information Sciences and Systems (CISS '07), 2007, Baltimore, Md, USA 376-381.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jing Lei.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Lei, J., Greenstein, L. & Yates, R. Link Gain Matrix Estimation in Distributed Large-Scale Wireless Networks. J Wireless Com Network 2010, 651795 (2010). https://doi.org/10.1155/2010/651795

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1155/2010/651795

Keywords