Campus Event Calendar
Event Entry
What and Who
PhD Application Talk: The title is "Computing k-hop Broadcast Trees Exactly".
Levan Machablishvili
Talk
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, RG2
MPI Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 29 October 2007
08:00
480 Minutes
E1 4
225
Saarbrücken
Abstract
In recent years wireless network technology has gained tremendous importance. It not only opens new dimensions in the availability of highbandwidth connections in particular for mobile applications, but also more and more replaces so far 'wired' network installations. While the spatial aspect was already of interest in the wired network world due to cable costs etc., it has far more influence on the design and operation of wireless networks. The power required to transmit information via radio waves is heavily dependent on the Euclidean distance of sender and receivers. Hence problems in this area are prime candidates for the use of techniques from computational geometry. We consider the problem of assigning powers to nodes of a wireless network in the plane such that a message originating from specific source node reaches all other nodes within a bounded number of transmissions and the total amount of assigned energy is minimized. We develop an algorithm for enumaration of all valid range assignemnts and describe different heuristics to improve the efficiency of the algorithm.
Contact
IMPRS
225
--email hidden
passcode not visible
logged in users only
Lourdes Lara-Tapia, 10/26/2007 19:04 -- Created document.