Announcements:
Instructor:
Matya Katz ( matya@cs.bgu.ac.il
)
Office hours: By appointment, Alon building (37), room 212, Tel: (08) 6461628
Class
Time:
Wednesday
10-12 (building
34, room 303)
Course
Description:
Wireless networks are everywhere and they raise several interesting algorithmic issues. This course deals with some of these issues, focusing on location and power optimization, interference avoidance, network lifetime, local routing, resilience, coverage, deployment of directional antennas, the SINR model, and more.
Date
|
Title
|
Presented
by
|
8.11.2017
|
Aleksei V. Fishkin |
Gali Bar-On |
|
|
M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, D. J. Rosenkrantz |
|
15.11.2017
|
Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc |
Rachel Saban |
|
Paz Carmi, Matthew J. Katz |
||
|
|
Alon Efrat, S´andor P. Fekete, Poornananda R. Gaddehosur,
Joseph S. B. Mitchell3, Valentin Polishchuk, Jukka Suomela
|
|
|
29.11.2017 |
P. Von Rickenbach , S. Schmid , R. Wattenhofer, A. Zollinger |
Morad Muslimany |
|
M. Korman Minimizing interference in ad-hoc
networks with bounded communication radius |
||
|
|
R. Aschner, M. Katz, G. Morgenstern,
Do
directional antennas facilitate in reducing interferences?
|
|
|
A. Bar-Noy, D. Rawitz, Peter Terlecky Maximizing
Barrier Coverage Lifetime with Mobile Sensors
|
||
17.1.2018
|
G. Aloupis, J. Cardinal, S. Collette, S. Langerman, D. Orden, P. Ramos Decomposition of Multiple Coverings
into More Parts
|
Tsahi Saporta |
M. Gibson, K. Varadarajan
Decomposing Coverings and the Planar Sensor Cover Problem |
||
|
|
Thomas Erlebach, Erik Jan van Leeuwen |
|
|
|
C. Avin, Y. Emek, E. Kantor, Z.
Lotker, D. Peleg, L. Roditty
SINR
Diagrams: Convexity and Its Applications in Wireless Networks
|
|
T. Kesselheim
A
constant-factor approximation for wireless capacity maximization with power
control in the SINR model
|
||
|
1.
T. Tonoyan 2.
Algorithms
for Scheduling with Power Control in Wireless Networks |
||
13.12.2017
|
F. Claude, R. Dorrigiv, S.
Kamali, A. Lopez-Ortiz, P. Pralat, J. Romero, A.
Salinger, D. Seco
Broadcasting
in Conflict-Aware Multi-Channel Networks
|
Ahmad Droby |
A. Dessmark, A. Pelc
Broadcasting
in geometric radio networks
|
|
|
|
3.1.2018 |
H. Kaplan, W. Mulzer, L. Roditty, and P. Seiferth.
Routing in
unit disk graphs
|
Reem Asam
|
|
27.12.2017 |
Gui Citovsky, Jie Gao,
Joseph S. B. Mitchell, Jiemin Zeng Exact and Approximation Algorithms for Data
Mule Scheduling in a Sensor Network |
Alaa Abd Alhaleem
|
|
|
S. Sankararaman,
K. Abu-Affash, A. Efrat, S. D. Eriksson-Bique,
V. Polishchuk, S. Ramasubramanian,
M. Segal
Optimization Schemes
for Protective Jamming
|
|
20.12.2017
|
CF-coloring
|
David Iliaev
|
10.1.2018
|
|
Shaked Matar
|
3.1.2018
|
Aviv Adler, Mark de Berg,
Dan Halperin, Kiril Solovey
Efficient Multi-Robot Motion Planning for
Unlabeled Discs in Simple Polygons
|
Hanan Zaichyk
|
· This is a 1-credit course.
· Students are required to attend all lectures and to actively participate in the seminar.
· 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 independently by the student. About one week before the date of the lecture and after he/she has prepared a first draft of the presentation, I will meet with the student to discuss unclear points, if any, and presentation issues, e.g., which parts of the paper to focus on.
· At the end of each seminar meeting, each student will submit a one-page assignment that will be given at the beginning of the meeting and which will refer to the lecture(s) of that meeting.
· In addition, a few homework assignments are expected.
· Final grade consists of presentation (60%), participation including class assignments (30%), HW (10%).
Last update January 7, 2018.