• Calendar

April 2, Wednesday
12:00 – 13:00

Sensors are small, low-cost resource limited processors with sensing abilities. Sensor networks are wireless ad-hoc networks of sensors collaborating on a mission. In this talk I will briefly describe the first two parts of my thesis and elaborate on the third one. The first part suggests a polygonal based model as an ad-hoc infrastructure for a implementing basic tasks in sensor networks; such as, broadcast, sense of direction and simultaneous activation. The second part suggests a unique-permutation hash function as an efficient implementation of a home location service application for tracking a mobile node.

This application is built on top of a Virtual Stationary Automata (VSA) layer. Finally, I will elaborate on my latest work "Swarm Unit - Reactive k-Secret Sharing". Motivated by the virtual automata abstraction and swarm computing, we investigate an extension of the $k$-secret sharing scheme, in which the secret shares are changed on the fly, independently and without (internal) communication, as a reaction to a global external trigger. The changes are made while maintaining the requirement that $k$ or more secret shares may reconstruct the secret and no $k-1$ or fewer can do so. The application considered is a swarm of mobile processes, each maintaining a share of the secret which may change according to common outside inputs e.g., inputs received by sensors attached to the process. The proposed schemes support addition and removal of processes from the swarm as well as corruption of a small portion of the processes in the swarm. hash function as an efficient implementation of a home location service application for tracking a mobile node.