Campus Event Calendar
Event Entry
What and Who
k-hop energy-efficient broadcast in the plane
Sören Laue
Max-Planck-Institut für Informatik - D 1
AG1 Mittagsseminar (own work)
AG 1
AG Audience
-- Not specified --
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 6 October 2006
13:30
-- Not specified --
E1 4
023
Saarbrücken
Abstract
We consider the problem of assigning powers to nodes of a wireless
network in the plane such that a message originating from a specific
source node reaches all other nodes within a bounded number $k$ of
transmissions and the total amount of assigned energy is minimized. We
provide an improved PTAS for this problem with running time linear in
the number of nodes.
network in the plane such that a message originating from a specific
source node reaches all other nodes within a bounded number $k$ of
transmissions and the total amount of assigned energy is minimized. We
provide an improved PTAS for this problem with running time linear in
the number of nodes.
Contact
Petra Mayer, Sören Laue
518
--email hidden
passcode not visible
logged in users only
Ellen Fries, 10/05/2006 09:44
Petra Mayer, 09/21/2006 15:17 -- Created document.
Petra Mayer, 09/21/2006 15:17 -- Created document.