Taxonomy of Opportunistic Routing: Principles and Behaviors
Kai Zeng, Wenjing Lou, Ming Li · 2011
This chapter provides the definition of Expected Packet Advancement (EPA) for an arbitrary number of forwarding candidates in Geographic Opportunistic Routing (GOR). Through theoretical analysis, the author showed that the maximum EPA can only be achieved by following a relay priority rule giving the forwarding candidates closer to the destination higher relay priorities when a forwarding candidate set is given. The chapter shows that increasing the maximum EPA is consistent with increasing the one-hop reliability. It provides the least cost opportunistic routing and important properties about it. The chapter describes two polynomial algorithms that find shortest any path for Least Cost Opportunistic Routing (LCOR). These two algorithms are based on the proved properties. Controlled Vocabulary Terms network routing; wireless networks