BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:How to improve performance of ad-hoc networks? - Michael Segal (Be
 n-Gurion University of the Negev)
DTSTART:20130717T120000Z
DTEND:20130717T130000Z
UID:TALK44392@talks.cam.ac.uk
CONTACT:Eiko Yoneki
DESCRIPTION:A wireless ad-hoc network consists of several transceivers (no
 des) located in the plane\, communicating by radio. Unlike wired networks\
 , in which the link topology is fixed at the time the network is deployed\
 , wireless ad-hoc networks have no fixed underlying topology. The temporar
 y physical topology of the network is determined by the distribution of th
 e wireless nodes\, as well as the transmission range of each node. The ran
 ges determine a directed communication graph\, in which the nodes correspo
 nd to the transceivers and the edges correspond to the communication links
 . The key difference between wireless ad-hoc networks and "conventional" c
 ommunication structures\, from the designer's point of view\, is in the po
 wer assignment model\, where each node decides on a transmission power lev
 el. In this talk we will concentrate on efficient power assignment strateg
 ies that produce communication graphs with various desired properties such
  as: k-connectivity\, small energy consumption and interferences\, bounded
  diameter\, limited latency and short paths.\n\nBio: Michael Segal finishe
 d B.Sc.\, M.Sc. and Ph.D. degrees in computer science from Ben-Gurion Univ
 ersity of the Negev in 1994\, 1997\, and 1999\, respectively. During a per
 iod of 1999–2000 Prof. Michael Segal held a MITACS National Centre of Ex
 cellence Postdoctoral  Fellow position in University of British Columbia\,
  Canada. Prof. Segal joined the Department of  Communication Systems Engin
 eering\, Ben-Gurion University\, Israel in 2000 where he served as departm
 ent’s Chairman between 2005–2010. He published more than 120 journal a
 nd conference papers on topics including  algorithms (sequential and distr
 ibuted)\, data structures with applications to optimization problems\, mob
 ile wireless networks\, scheduling and efficient networking.
LOCATION:LT2\, Computer Laboratory\, William Gates Builiding
END:VEVENT
END:VCALENDAR