Distributed estimation scheme based on cooperative communication in wireless sensor networks

Distributed estimation scheme based on cooperative communication in wireless sensor networks

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Wireless Sensor Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In the distributed estimation of an unknown source in wireless sensor networks, the observations are transmitted through fading channels. Thus channel fading influences the estimation distortion significantly. Recently, cooperative communication has been proposed to combat channel fading by providing multiple independently fading paths. In this letter, the authors use cooperative communication to decrease estimation distortion. First, they propose a distributed estimation scheme with amplify-and-forward cooperation strategy. To minimise distortion, the optimal power allocation of the individual node transmission power is studied, in which the maximum number of active sensor nodes is limited so as to restrict slot overhead. The optimal solution and a sub-optimal solution with less computation overhead are given. Numerical results show that, the proposed scheme could achieve a lower estimation distortion even in the case of using fewer slots, when compared with the conventional estimation scheme with non-cooperative transmission. They also show that our scheme could achieve full estimation diversity.


    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
    15. 15)
    16. 16)

Related content

This is a required field
Please enter a valid email address