| Abstract: |
| Coverage problem is one of the fundamental issues in Wireless Sensor Networks (WSNs), since it demonstrates the sensing quality of WSNs. In this talk, we look at the coverage problem mainly from a geometric perspective. Specifically, we formulate the coverage problem as space tessellation, and design localized algorithms to drive the autonomous deployment of sensor nodes. Furthermore, we extend the paradigm of coverage to design a frequency allocation algorithm for multi-channel WSNs. In more details, we ``tessellate`` the sensor nodes in a unified virtual space consisting of sensor locations and frequencies, to enable the co-existence of ZigBee and WiFi with performance guaranteed in terms of both transmission throughput and quality. |
|