BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Time-aware Routing in Wireless Sensor Networks - Daniele Borsaro\,
  University of Cambridge Computer Laboratory
DTSTART:20080429T120000Z
DTEND:20080429T130000Z
UID:TALK12031@talks.cam.ac.uk
CONTACT:Henry Robinson
DESCRIPTION:The main scenario is the one of a naturalistic park in which a
  network of wireless sensors\nis deployed with a main duty of environmenta
 l monitoring. Sensors are in part fixed and in part mobile:\nthey collect 
 specific data\, partially elaborate them\, send them to sinks for centrali
 zed and/or\nconstraint-\nless elaboration\, collaborate to disseminate inf
 ormation to interested nodes which can be data collectors\nor\nactuators. 
 Such a network is actually a wireless sensor and actor network which topol
 ogy implies a non\ntrivial routing: nodes can be mobile or fixed\; sensor 
 or actuator or both\; some can be strictly\nconstrained\non buffer size\, 
 power supply\, radio range and computational power while other not. This h
 igh heterogeneity\ntraduces in a complex network.\nIn this first year\, I 
 am currently focusing on the fixed node subnetwork. These nodes are spread
  on a\nbroad area\, only\nfew of them can be wired to an external network\
 , many are likely to be physically accessed by staff very\nfew times over 
 a long period. This means that memory and power management are main concer
 ns during\nnodes workout. One of the main way to save battery power is to 
 switch the wireless interface off  when the\ncommunication is not needed a
 s\, for these devices\, the network communication is by orders of magnitud
 e\nmore expensive\nthan the other local activities.\n\nConsidering that ea
 ch node has this kind of duty-cycle\, the fixed nodes subnetwork\nresults 
 to be intermittently connected.  We assume that a network manager  assigns
  a specific duty-cycle\nto\nsensor nodes\, which is disseminated in a spec
 ific startup phase. Then sensors start to exchange their duty\ncycle and c
 onstruct their future communication behavior on the duty cycling informati
 on propagated by the\nneighbours. We construct\na decentralized time-aware
  delay tolerant routing protocol which aims to provide data delivery to sp
 ecific\npoints  and minimize end-to-end cost\, considering\nthat no contem
 porary end-to-end path could exist between a source-destination node pair.
  I am currently\nverifying the algorithm correctness and running it by mea
 ns of simulations to identify its basic\nproperties. 
LOCATION:Computer Laboratory\, William Gates Building\, Room FW11
END:VEVENT
END:VCALENDAR