Extreme Propagation in Ad-hoc Radio Networks

23^rd October 2012, 16:00 Ashton Lecture Theatre
Prof. Miroslaw Kutylowski
Institute of Mathematics and Computer Science
Wroclaw University of Technology
Poland

Abstract

One 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.

These 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).

We 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
to a substantial reduction of the number of messages transmitted as well as execution speed-up, despite abandoning an idealized network model.

joint work with K.Wolny, P.Blaskiewicz, W.Wodo
project: POIG.01.03.01-02-002/08-00