Greedy geographical routing is a method used in sensor network applications to route
between points using only local properties and little to no global information. Unfortunately …

We consider combinatorial problems motivated by sensor networks for beacon-based point-
to-point routing and covering. A beacon b is a point that can be activated to effect a …

For a polygonal region P with n vertices, a guard cover S is a set of points in P, such that any
point in P can be seen from a point in S. In a colored guard cover, every element in a guard …

We establish tight bounds for beacon-based coverage problems. In particular, we show
that⌊ n 6⌋ beacons are always sufficient and sometimes necessary to cover a simple …

The beacon model is a recent paradigm for guiding the trajectory of messages or small
robotic agents in complex environments. A beacon is a fixed point with an attraction pull that …

Motivated by routing in sensor networks, Biro et al.[2] introduced the notion of beacon
attraction and inverse attraction as a new variant of visibility in a simple polygon. A beacon b …

Beacon attraction is a movement system whereby a robot (modeled as a point in 2D) moves
in a free space so as to always locally minimize its Euclidean distance to an activated …

A beacon b∈ R d is a point-shaped object in d-dimensional space that can exert a magnetic
pull on any other point-shaped object p∈ R d. This object p then moves greedily towards b …

We solve an open problem posed by Michael Biro at CCCG 2013 that was inspired by his
and others' work on beacon-based routing. Consider a human and a puppy on a simple …

In a paper by Biro et al.[3], a novel twist on guarding in art galleries, motivated by
geographical greedy routing in sensor networks, is introduced. A beacon is a fixed point that …