Abstract
Link quality estimation has been an active area of research within the wireless sensor network community. It is now well known that the estimation of reliable links requires few sample packets less than 10, while the estimation of unreliable links require many more above 50. In scenarios where unreliable links are ubiquitous, and a rapid transfer of data is needed, traditional estimation techniques are not a viable option. In such scenarios, it is instead sufficient to identify the best link available at any given time. Within this context, we propose Link Quality Ranking (LQR), a mechanism that identifies the best link available when only unreliable links are present. Our testbed results indicate that with one sample packet, the delivery rate of LQR with respect to the best link available is above 93%. With 10 sample packets, the performance is above 96%.
| Original language | English |
|---|---|
| Title of host publication | 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS) |
| Number of pages | 8 |
| Publisher | IEEE |
| Publication date | 12.09.2011 |
| Pages | 1-8 |
| Article number | 5982169 |
| ISBN (Print) | 978-1-4577-0512-0 |
| ISBN (Electronic) | 978-1-4577-0513-7, 978-1-4577-0511-3 |
| DOIs | |
| Publication status | Published - 12.09.2011 |
| Event | 7th IEEE International Conference on Distributed Computing in Sensor Systems - Barcelona, Spain Duration: 27.06.2011 → 29.06.2011 Conference number: 86376 |
