collision-free communication

We focus on stabilizing interference-free slot assignment to WMN nodes. These slot assignments allow each node to transmit its data while ensuring that it does not interfere with other nodes.

In this paper, we propose a self-stabilizing deterministic TDMA algorithm where a sensor is aware of only its neighbors. We show that the slots are assigned to the sensors in a concurrent fashion and starting from arbitrary initial states, the algorithm converges to states where collision-free communication among the sensors is restored. Moreover, this algorithm facilitates the transformation of abstract programs into programs in WAC model that are deterministically correct.

To enable the designers to prototype power management protocols in target platform (e.g., nesC/TinyOS), in this paper, we use ProSe, a programming tool for sensor networks. ProSe enables the designers to specify their programs in simple abstract models while hiding low-level challenges of sensor networks and programming-level challenges. As a case study, in this paper, we specify a power management protocol with ProSe, automatically generate the corresponding nesC/TinyOS code, and evaluate its performance.

We focus on the problem of designing a TDMA service for a grid-based sensor network. Such networks are readily found in many applications in the area of monitoring, hazard detection, and so on. We consider three communication patterns, broadcast, convergecast and local gossip, that occur frequently in these systems.

We present TDMA algorithms customized for different communication patterns, namely, broadcast,convergecast and local gossip, that occur commonly in sensor networks.

In this paper, we provide a stabilizing solution for collision-free diffusion and time-division mutiplexing in sensor networks.