8.1 System Model
In this chapter, we consider the local MGOR scenario as in the example in Figure 8.1. Assume node S, i.e., the sender, is forwarding a packet to a remote destination D. S can transmit the packet at k different rates R1, R2, …, Rk. Each rate corresponds to a communication range, within which the nodes can receive the packet sent by S with some non-negligible probability, which is larger than a threshold, e.g., 0.1. The available next-hop node set (1 ≤ j ≤ k) of node S under a particular transmission rate Rj is defined as all the nodes in the communication range of S that are closer to D than S. We denote the nodes in as , where . In a similar way to geographic routing (Karp and Kung 2000; Lee et al. 2005; Seada et al. 2004), we assume S is aware of the location information of itself, its one-hop neighbors and the destination D. Define the packet advancement as in Equation (8.1), which is the Euclidian distance between the sender and destination (d(S, D)) minus the Euclidian ...
Get Multihop Wireless Networks: Opportunistic Routing now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.