Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, April 26, 2012, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Matias Korman (Universitat Politècnica de Catalunya)

Geometric problems in Ad-Hoc Networks

Ad-hoc networks are commonly used whenever a number of electronic devices are spread across a geographical area and no central communication hub exists. In order to send messages between two sensors located far from each other, the message is repeated by other devices located between them. Ideally we could assign large enough radius to each sensor so that they can freely communicate with each other. However, this approach brings many problems like quick battery drainage and high interference. Thus, we look for a balance that allows free communication while reducing energy requirements and minimizing interference. In this talk, we will discuss the different approaches that have been taken to deal with this problem. We will also consider the case in which antennas are directional, and thus, in addition to the communication radius to each sensor one must also establish their orientation.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login