The Reuleaux Triangle and its Center of Mass

“…However, several parts of the forwarding area which make good forwarding progress are not included in the circle. A different shape where any two points are no further apart than the transmission range, the Reuleaux triangle [10], much better covers the area with good forwarding progress (see Figure 2). 1 By using the Reuleaux triangle with a width of the transmission range, we trade off the number of nodes contained in the suppression area against the inclusion of better suited nodes.…”

Section: ) Area-based Suppressionmentioning

confidence: 99%

A novel forwarding paradigm for position-based routing (with implicit addressing)

Füßler

Widmer

Mauve

et al.

2002 14th International Conference on Ion Implantation Technology Proceedings (IEEE Cat. No.02EX505)

View full text Add to dashboard Cite

Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages each node sends out periodically. Due to mobility, the information that a node receives about its neighbors becomes outdated, leading either to a significant decrease in the packet delivery rate or to a steep increase in load on the wireless channel as node mobility increases.In this paper, we describe a mechanism to perform positionbased unicast forwarding without the help of beacons. In our contention-based forwarding scheme, the next hop is selected through a distributed contention process based on the actual positions of all current neighbors. For the contention process, CBF makes use of biased timers. To avoid packet duplication, the first node that is selected suppresses the selection of further nodes. Since the basic scheme can lead to packet duplication, we describe alternative ways of suppressing those. In addition to that, we compare the CBF schemes and standard greedy forwarding by means of simulation with ns

show abstract