 |
 |
||||||||
|
|||||||||
|
|
|||||||||
|
||
|
|
|
|
|
Coverage is one of the fundamental problems that arise in wireless ad hoc sensor networks . In general, coverage can be considered as the measure of quality of service (QoS) of a sensor network. Nevertheless, identifying how much of a sensor deployed area is in the sensing and transmission range of sensors is defined as coverage problem. Collecting data by querying the specified parts of the sensor deployed area in different time periods can help energy saving of sensor nodes. In this way, the sensor nodes out of the monitoring area sleep and do not consume power. In this thesis two problems that occur in wireless sensor and actor networks when collecting data by querying are defined. One is the Unrelated-Node-Join problem and it appears when the sensor nodes out of the monitoring area join the dynamically constructed sensor network. The events, which happen out of the monitoring area, are also transmitted as if they happened in the monitoring area, and as a result of this, the collected data becomes inconsistent and unnecessary energy consumption of outer sensor nodes arises . On the other way, the sensor nodes in the monitoring area should join the dynamic networks without leaving uncovered holes in the queried region. The case of remaining uncovered partitions in the queried region is named as Uncovered-Monitoring area problem. In this thesis, Recursive Convex Hull Algorithms are proposed to solve the problems mentioned above. The algorithms create many different sensor networks, which are rooted by the actor nodes in the monitoring area. The actor nodes are already connected to each other since they have wider transmission ranges. As a result, one bigger, connected and combined network inside the monitoring area is expected to realize. |
|
|
|
|
||
 |
|
|
||||||||||||||||||
| |||||||||||||||||||
|
|
|
|