Multihop Wireless Networks: Opportunistic Routing

11.1 Summary

The essential idea of opportunistic routing is to exploit the broadcast nature and space diversity provided by the wireless medium. By having multiple forwarding candidates, the successful rate of each transmission can be much improved. However, a good OR protocol is to decide which set of nodes (in contrast to which single node) are good to form the forwarding candidate set and how they should be prioritized. Although we are taking opportunities, we want the packets to be routed to the destination through a set of paths that are statistically optimal. In this book, we presented principles of the local behavior of OR, we analyzed the capacity, throughput and energy efficiency of OR, we developed a new candidate coordination scheme for OR, and we designed secure link quality measurement mechanism.

In Chapter 2, we found and proved properties of the local behavior of OR and the associated candidate selection and prioritization issues. In Chapter 3 we proposed an energy-efficient geographic opportunistic routing framework and corresponding local candidate selection and prioritization algorithms. The contributions of Chapters 4 and 5 present an analytical model to compute the end-to-end throughput bound and capacity of OR in multiradio, multichannel and multirate wireless networks. In Chapter 6, we presented a new, efficient candidate coordination scheme, which takes advantage of physical layer information. Chapter 7 demonstrated how network coding can be integrated with ...