BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260921T092923Z
UID:Seminar-dept-296@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20121023T160000
DTEND:20121023T170000
SUMMARY:School Seminar Series
DESCRIPTION:Prof. Miroslaw Kutylowski: Extreme Propagation in Ad-hoc Radio Networks\n\nOne of the main challenges for sensor fields is to aggregate information from the single sensors. In particular, it might be desirable to distribute the maximum from the values stored by the sensors. \n\n\n\nThese kind of algorithms is important for  environment monitoring networks. In particular, we have to keep in mind that some of the network nodes may fail (temporarily or permanently). Moreover, since typically communication is via a shared radio network, there is possibility of communication collisions, lack of synchronization,  transmission failures and so on. As the nodes are of limited computational capabilities, the algorithms executed must be simple and use limited resources (time, space and communication complexity). \n\n\n\nWe reconsider a simple algorithm by Baquero, Almeida and Menezes that computes extreme values observed by nodes of an ad hoc network. We adapt it  to meet  specific technical features.  of  communication with a single radio channel based on time multiplexing.  It turns out that this  leads \n\nto a substantial reduction of the number of messages transmitted as well as  execution  speed-up, despite abandoning an idealized network model. \n\n\n\njoint work with  K.Wolny, P.Blaskiewicz, W.Wodo\n\nproject: POIG.01.03.01-02-002/08-00\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=296
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR