Peter Korteweg (TU/e): An approximation algorithm for
the Wireless Gathering Problem
The Wireless Gathering Problem is to find
a schedule for data gathering in a wireless static
network. The problem is to gather a set of messages from
the nodes in the network at which they originate to a
central node, representing a powerful base station. The
objective is to minimize the time to gather all
messages. The sending pattern or schedule should avoid
interference of radio signals, which distinguishes the
problem from wired networks.