Link gain matrix estimation in distributed large-scale wireless networks

Authors:
Jing Lei;Larry Greenstein;Roy Yates
Affiliations:
WINLAB, Department of ECE, Rutgers University, North Brunswick, NJ;WINLAB, Department of ECE, Rutgers University, North Brunswick, NJ;WINLAB, Department of ECE, Rutgers University, North Brunswick, NJ
Venue:
EURASIP Journal on Wireless Communications and Networking - Special issue on simulators and experimental testbeds design and development for wireless networks
Year:
2010

Citing 8
Cited 0

WISE Design of Indoor Wireless Systems: Practical Computation and Optimization

IEEE Computational Science & Engineering
Constrained Maximum-Entropy Sampling

Operations Research
Wireless Link SNR Mapping Onto An Indoor Testbed

TRIDENTCOM '05 Proceedings of the First International Conference on Testbeds and Research Infrastructures for the DEvelopment of NeTworks and COMmunities
Wireless mesh networks: a survey

Computer Networks and ISDN Systems
Consistent selectivity estimation via maximum entropy

The VLDB Journal — The International Journal on Very Large Data Bases
Mapping link SNRs of real-world wireless networks onto an indoor testbed

IEEE Transactions on Wireless Communications
A survey on sensor networks

IEEE Communications Magazine
An empirically based path loss model for wireless channels in suburban environments

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.03

Visualization

Abstract

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