Support: NSF grants IIS-0093581 and CCR-0330342

Wireless Sensor Networks are cheap, easy to implement, and allow the coverage of vast regions.

Individually, each one of those small sensors is not as accurate as the expensive macrosensors, but when the agents combine their efforts, the resulting network offers a superior sensing capability.

The scalability of the network is restricted by the resources that each agent consumes on the coordination algorithm.

We consider two cases:

1. When the communication graph of the resulting network is the complete graph with n vertices and
2. when the communication graph is induced by the relative distance between any pair of agents in the formation.

We evaluate the energy costs for each one of such scenarios when the agents are arrenged in a line, a square and a cube (which happen to be basic sets in R, R² and R³, respectively) and we found the scalability constraints for such cases.

In addition to this, the maximum network size is found, as a function of the energy requirements for the agents in the network.

The slides of the talk given in the 2005 IEEE International Conference in Networking, Sensing and Control are available here.

Back                        Home