Advanced Seminar A (202-2-1511)

Algorithms for Wireless Networks

Fall 2012-2013


Announcements:


Instructor:

Matya Katz  ( matya@cs.bgu.ac.il

Office hours: By appointment, Alon building (37), room 212, Tel: (08) 6461628

 

Class Time:

Wednesday 14-16  ( 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

Ice-creams and wedge graphs

Erez

 

E. Kranakis, D. Krizanc, O. Morales

Maintaining connectivity in sensor networks using directional antennae

Tal

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

Elina

 

P. Von Rickenbach , R. Wattenhofer , A. Zollinger

Algorithmic Models of Interference in Wireless Ad Hoc and Sensor Networks

Evgeny

14.11.12

P. Von Rickenbach , S. Schmid , R. Wattenhofer, A. Zollinger

A Robust Interference Model for Wireless Ad-Hoc Networks

Vitaly

 

M. Halldórsson, T. Tokuyama

Minimizing Interference of a Wireless Ad-Hoc Network in a Plane

Yuval

28.11.12

M. Korman

Minimizing interference in ad-hoc networks with bounded communication radius

Gal

 

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

Do directional antennas facilitate in reducing interferences?

Ury

05.12.12

S. Smorodinsky

Conflict-Free Coloring and its Applications

Yehonatan

A. Bar-Noy, B. Baumer, D. Rawitz

Set It and Forget It: Approximating the Set Once Strip Cover Problem

Moshe

12.12.12

M. Gibson, K. Varadarajan

Decomposing Coverings and the Planar Sensor Cover Problem

Niv

 

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

SINR Diagrams: Convexity and Its Applications in Wireless Networks

Lior

19.12.12

T. Kesselheim

A constant-factor approximation for wireless capacity maximization with power control in the SINR model

Benny

 

M. Halldórsson, P. Mitra

Wireless Capacity with Oblivious Power in General Metrics

Etai

27.12.12

1.      T. Tonoyan

2.      Algorithms for Scheduling with Power Control in Wireless Networks

Vladimir

 

F. Claude, R. Dorrigiv, S. Kamali, A. Lopez-Ortiz, P. Pralat, J. Romero, A. Salinger, D. Seco      Broadcasting in Conflict-Aware Multi-Channel Networks

Tal

02.01.13

A. Dessmark, A. Pelc 

Broadcasting in geometric radio networks                                                                      

Ehud

 

C. Ambühl

An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks

Smadar

09.01.13

S. Sankararaman, K. Abu-Affash, A. Efrat, S. D. Eriksson-Bique, V. Polishchuk, S. Ramasubramanian, M. Segal

Optimization Schemes for Protective Jamming

Jumana

 

A. Juels, R. L. Rivest, M. Szydlo

The Blocker Tag: Selective Blocking of RFID Tags for Consumer Privacy

Majeed

16.01.13

T. Ito, S.-I. Nakano, Y. Okamoto, Y. Otachi, R. Uehara, T. Uno, Y. Uno

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares

Omrit

 

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 1-credit 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:

hw1

hw2-intro; hw2

 

 


Last update December 12, 2012.