Advanced Seminar A (20221511)
Algorithms for Wireless Networks
Fall 20122013
Announcements:
Instructor:
Matya Katz (
matya@cs.bgu.ac.il )
Office
hours: By appointment, Alon building (37), room 212, Tel: (08) 6461628
Class
Time:
Wednesday
1416 ( 90/234 )
Course
Description:
Wireless networks are everywhere and they raise several
interesting algorithmic issues. This course deals with some of these issues,
focusing on maximizing network lifetime, interference avoidance, deployment of
directional antennas, and the SINR model.
Bibliography:
A collection of recent and
carefully sought papers on the above topics.
Date

Title

Presented
by

31.10.12

E. Ackerman, T. Gelander, R.
Pinchasi



E. Kranakis, D. Krizanc, O. Morales


07.11.12

P. Bose, P.
Carmi, M. Damian, R. Flatland, M. Katz, A. Maheshwari
Switching
to Directional Antennas with Constant Increase in Radius and Hop Distance



P. Von Rickenbach , R. Wattenhofer , A. Zollinger
Algorithmic
Models of Interference in Wireless Ad Hoc and Sensor Networks


14.11.12

P. Von Rickenbach , S. Schmid , R. Wattenhofer, A. Zollinger
A
Robust Interference Model for Wireless AdHoc Networks



M. Halldórsson, T.
Tokuyama


28.11.12

M. Korman
Minimizing interference in adhoc networks
with bounded communication radius



R. Aschner, M. Katz, G. Morgenstern,


05.12.12

S. Smorodinsky



A. BarNoy,
B. Baumer, D. Rawitz


12.12.12

M. Gibson, K. Varadarajan



C. Avin, Y. Emek, E. Kantor, Z.
Lotker, D. Peleg, L.
Roditty


19.12.12

T. Kesselheim

Benny


M. Halldórsson, P. Mitra


27.12.12

1.
T. Tonoyan
2.
Algorithms
for Scheduling with Power Control in Wireless Networks





02.01.13

A. Dessmark, A. Pelc



C. Ambühl
An
Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast
Trees in Wireless Networks

Smadar

09.01.13


Jumana


A. Juels, R. L. Rivest, M. Szydlo
The
Blocker Tag: Selective Blocking of RFID Tags for Consumer Privacy


16.01.13

T. Ito,
S.I.
Nakano, Y. Okamoto,
Y. Otachi, R. Uehara, T. Uno,
Y. Uno
A
polynomialtime approximation scheme for the geometric unique coverage
problem on unit squares



R. Aschner, P. Carmi
and Y. Stein
Unique coverage with
rectangular regions

Slava

23.01.13






Beamer stuff: demo source and outcome, an intro
Requirements:
This is a 1credit course.
Students are required to attend all lectures.
Each student will give a lecture based on material that I
will provide her/him (usually, a scientific paper). The lecture will include a
Beamer presentation prepared by the student.
In addition, several homework assignments and short quizzes
are expected.
HW:
Last update December 12, 2012.