Periodic Report Summary - AMSN (Adversarial models in sensor networks)
Advances in technology have made it possible to integrate sensing, processing and communication capabilities in a low-cost device, popularly known as a sensor node. Sensor nodes are randomly deployed over an area and must self-organise as a radio-communication network called a sensor network. Sensor networks can be used in almost any application where sensing or measuring physical variables over large areas is needed, e.g. gathering biological data or sensing in catastrophe areas. A sensor network is capable of achieving large tasks through the coordinated effort of sensor nodes, but individual nodes have strong limitations such as memory size, life cycle and range of communication, yielding algorithmically challenging problems.
Although sensor networks is a very active research area, most of this work is either empirical or includes unreallistic assumptions regarding the capabilities of the sensor nodes. Hence, there are still many open basic questions. The main objective of this project is to study various basic problems in sensor networks under adversarial models. Problems to be addressed include and are not limited to:
- deterministic transmissions in sensor networks under adversarial behaviour;
- efficiency bounds for the clear transmission and group therapy problems in sensor networks;
- efficiency bounds for the broadcast and wake-up problems in radio networks;
- routing and scheduling in sensor networks under the CAQT model; and
- non-uniform radius sensor network initialisation.
The following problems, yielding the corresponding scientific articles, have been studied during this reporting period. Unbounded contention resolution in multiple-access channels, probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions, opportunistic information dissemination in mobile ad-hoc networks, initialising sensor networks of non-uniform density in the weak sensor model, deterministic recurrent communication and synchronisation in restricted sensor networks, aggregate functions computation by flows in radio networks, mechanism design for internet-based computing under communication failures.
Although sensor networks is a very active research area, most of this work is either empirical or includes unreallistic assumptions regarding the capabilities of the sensor nodes. Hence, there are still many open basic questions. The main objective of this project is to study various basic problems in sensor networks under adversarial models. Problems to be addressed include and are not limited to:
- deterministic transmissions in sensor networks under adversarial behaviour;
- efficiency bounds for the clear transmission and group therapy problems in sensor networks;
- efficiency bounds for the broadcast and wake-up problems in radio networks;
- routing and scheduling in sensor networks under the CAQT model; and
- non-uniform radius sensor network initialisation.
The following problems, yielding the corresponding scientific articles, have been studied during this reporting period. Unbounded contention resolution in multiple-access channels, probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions, opportunistic information dissemination in mobile ad-hoc networks, initialising sensor networks of non-uniform density in the weak sensor model, deterministic recurrent communication and synchronisation in restricted sensor networks, aggregate functions computation by flows in radio networks, mechanism design for internet-based computing under communication failures.