Opportunistic routing in multi-hop wireless networks
ACM SIGCOMM Computer Communication Review
Link-level measurements from an 802.11b mesh network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Improving loss resilience with multi-radio diversity in wireless networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Packet combining in sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
802.11b/g Link Level Measurements for an Outdoor Wireless Campus Network
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Multipath code casting for wireless mesh networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
| Hi-index | 0.00 |
Opportunistic routing (OR) relies on links of intermediate quality, i.e. packet losses are common. However, the reasons for packet losses are manifold, e.g. a received packet may contain corrupted bits. According to traditional approaches, the receiver discards the whole frame in such a case. In this paper, we present measurements from an indoor IEEE 802.11 wireless mesh network (WMN), which indicate that corrupted frames still contain a significant amount of correct data, which can be utilized. In particular, corrupted frames are common for intermediate quality links. Bit errors tend to occur in proximity, i.e. they are bursty. Furthermore, bit errors are uncorrelated across different receivers in most cases. Based on our observations, we propose a HARQ scheme for OR called Hybrid ARQ with Limited Fragmentation (HALF). It operates on a hop-by-hop manner and requires only local knowledge. Due to the bursty nature of bit errors, we are dividing frames into fragments with additional error detection. Using random linear network codes, the sender transmits incremental redundancy until one of its receivers is able to decode all fragments and therefore sends an acknowledgement packet. However, the partial information at all other receivers is not lost. Instead, to increase the throughput further, it is also used in subsequent forwarding rounds along the multi-hop route. We implemented a prototype of our protocol to evaluate its performance. With the help of detailed simulations, we analyzed the reasons why HALF significantly outperforms traditional approaches like DSR.