BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook 11.0 MIMEDIR//EN
VERSION:2.0
METHOD:PUBLISH
BEGIN:VEVENT
ORGANIZER:MAILTO:sit.info@usyd.edu.au
DTSTART:20091203T050000Z
DTEND:20091203T060000Z
LOCATION:The University of Sydney\, School of IT Building\, Lecture Theatre
  (Room 123)\, Level 1
TRANSP:OPAQUE
SEQUENCE:0
UID:040000008200E00074C5B7101A82E00800000000A0E17423266CCA010000000000000000100
 00000BBBA25492E837841B21C733A4BB62AD5
DTSTAMP:20091122T231746Z
DESCRIPTION:This seminar has changed to Thursday 3rd December 2009\,
  4.00-5.00pm.  I apologise for any confusion this may
  cause.\n\n----------------------------\n\nBasser Seminar Series\, School
  of Information Technologies\, USYD:\n\nDCBM - A Multipath Routing
  Algorithm for Mobile Wireless Sensor Networks\n\nSpeaker:	Professor
  Adrian Segall\n		Department of EE\, Technion\, IIT\, Haifa\, Israel and
  CSIRO ICT Centre (Sydney)\n\nTime:		Thursday 3 December 2009\,
  4:00-5:00pm\n		Refreshments will be available from 3:30pm\n\nLocation:
  	The University of Sydney\, School of IT Building\, Lecture Theatre (Room
  123)\, Level 1\n\nABSTRACT\nProviding reliable and yet energy efficient
  routing protocols is of an utmost importance in Wireless Sensor Networks.
  Wireless Sensor Networks imply multi-hop data forwarding over unreliable
  and moving nodes. When selecting the appropriate routing paradigm\, the
  main challenge is to find the right equilibrium between quality of data
  delivery and the energy invested. Insufficient quality of data delivery
  may fail the application deployed over the wireless sensor network\,
  while an energy wasteful protocol may significantly shorten the lifetime
  of the network. In this work we propose a new routing algorithm for
  WSN’s\, named the Data Centric Braided Multipath (DCBM) algorithm. The
  algorithm is designed to achieve and maintain route resiliency through
  multiple interleaving routing paths\, capable to cope with node mobility.
   Simulations show that the algorithm maintains a delivery ratio similar
  to the previously suggested protocols\, but requires significantly lower
  control packet overhead.  The algorithm has several additional desirable
  properties\, like loop reduction and the capability to restrict updates
  to areas close to disruption events.\n\nThis work was performed in
  collaboration with Alex Aronsky.\n\nSPEAKER’S BIOGRAPHY\nAdrian Segall
  is Professor of Electrical Engineering at the Technion\, Israel Institute
  of Technology\, holding the Benjamin chair in Computer-Communication
  Networks.  He is currently a Distinguished Visitor Scientist at the CSIRO
  ICT Centre\, Marsfield\, NSW.\n\nLOCATION DETAILS:\nThe School of
  Information Technologies is located in the new School of IT Building
  (J12)\, 1 Cleveland Street at the eastern end of the Darlington campus of
  the University of Sydney.\nMaps are available here (see coordinates
  L25/L26):\n
 	http://db.auth.usyd.edu.au/directories/map/largemap00a.html\n\n
SUMMARY:Basser Seminar
PRIORITY:5
X-MICROSOFT-CDO-IMPORTANCE:1
CLASS:PUBLIC
BEGIN:VALARM
TRIGGER:-PT720M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR