Low-Complexity, Distributed Characterization of Interferers in Wireless Networks
We consider a large-scale wireless network that uses sensors along its edge to estimate the characteristics of interference from neighboring networks or devices. Each sensor makes a noisy measurement of the received signal strength (RSS) from an interferer, compares its measurement to a threshold, a...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi - SAGE Publishing
2011-10-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2011/980953 |
| _version_ | 1797728763124908032 |
|---|---|
| author | Vibhav Kapnadak Murat Senel Edward J. Coyle |
| author_facet | Vibhav Kapnadak Murat Senel Edward J. Coyle |
| author_sort | Vibhav Kapnadak |
| collection | DOAJ |
| description | We consider a large-scale wireless network that uses sensors along its edge to estimate the characteristics of interference from neighboring networks or devices. Each sensor makes a noisy measurement of the received signal strength (RSS) from an interferer, compares its measurement to a threshold, and then transmits the resulting bit to a cluster head (CH) over a noisy communication channel. The CH computes the maximum likelihood estimate (MLE) of the distance to the interferer using these noise-corrupted bits. We propose and justify a low-complexity threshold design technique in which the sensors use nonidentical thresholds to generate their bits. This produces a dithering effect that provides better performance than previous techniques that use different non-identical thresholds or the case in which all the sensor motes use an identical non-optimal threshold. Our proposed technique is also shown (a) to be of low complexity compared to previous non-identical threshold approaches and (b) to provide performance that is very close to that obtained when all sensors use the identical, but unknown, optimal threshold. We derive the Cramér-Rao bound (CRB) and also show that the MLE using our dithered thresholds is asymptotically both efficient and consistent. Simulations are used to verify these theoretical results. |
| first_indexed | 2024-03-12T11:18:48Z |
| format | Article |
| id | doaj.art-700ccb947856424fab03a03fe8ab2b94 |
| institution | Directory Open Access Journal |
| issn | 1550-1477 |
| language | English |
| last_indexed | 2024-03-12T11:18:48Z |
| publishDate | 2011-10-01 |
| publisher | Hindawi - SAGE Publishing |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj.art-700ccb947856424fab03a03fe8ab2b942023-09-02T01:27:07ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772011-10-01710.1155/2011/980953980953Low-Complexity, Distributed Characterization of Interferers in Wireless NetworksVibhav Kapnadak0Murat Senel1Edward J. Coyle2 Network Systems Engineering, AT&T Labs, 2600 Camino Ramon, CA 94583, USA Robert Bosch LLC, Research and Technology Center North America, 4009 Miranda Avenue, Palo Alto, CA 94304, USA School of Electrical and Computer Engineering, Georgia Institute of Technology, 777 Atlantic Drive NW, Atlanta, GA 30332-0250, USAWe consider a large-scale wireless network that uses sensors along its edge to estimate the characteristics of interference from neighboring networks or devices. Each sensor makes a noisy measurement of the received signal strength (RSS) from an interferer, compares its measurement to a threshold, and then transmits the resulting bit to a cluster head (CH) over a noisy communication channel. The CH computes the maximum likelihood estimate (MLE) of the distance to the interferer using these noise-corrupted bits. We propose and justify a low-complexity threshold design technique in which the sensors use nonidentical thresholds to generate their bits. This produces a dithering effect that provides better performance than previous techniques that use different non-identical thresholds or the case in which all the sensor motes use an identical non-optimal threshold. Our proposed technique is also shown (a) to be of low complexity compared to previous non-identical threshold approaches and (b) to provide performance that is very close to that obtained when all sensors use the identical, but unknown, optimal threshold. We derive the Cramér-Rao bound (CRB) and also show that the MLE using our dithered thresholds is asymptotically both efficient and consistent. Simulations are used to verify these theoretical results.https://doi.org/10.1155/2011/980953 |
| spellingShingle | Vibhav Kapnadak Murat Senel Edward J. Coyle Low-Complexity, Distributed Characterization of Interferers in Wireless Networks International Journal of Distributed Sensor Networks |
| title | Low-Complexity, Distributed Characterization of Interferers in Wireless Networks |
| title_full | Low-Complexity, Distributed Characterization of Interferers in Wireless Networks |
| title_fullStr | Low-Complexity, Distributed Characterization of Interferers in Wireless Networks |
| title_full_unstemmed | Low-Complexity, Distributed Characterization of Interferers in Wireless Networks |
| title_short | Low-Complexity, Distributed Characterization of Interferers in Wireless Networks |
| title_sort | low complexity distributed characterization of interferers in wireless networks |
| url | https://doi.org/10.1155/2011/980953 |
| work_keys_str_mv | AT vibhavkapnadak lowcomplexitydistributedcharacterizationofinterferersinwirelessnetworks AT muratsenel lowcomplexitydistributedcharacterizationofinterferersinwirelessnetworks AT edwardjcoyle lowcomplexitydistributedcharacterizationofinterferersinwirelessnetworks |