The Sector Cover and Transmission Weighted Greedy Algorithm for Connected Target Coverage in Directional Sensor Networks
| Autor: | Wei-Fu Lu, Yu-Fang Jian |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
020203 distributed computing
Cover (telecommunications) Computer science Real-time computing 02 engineering and technology Construct (python library) 021001 nanoscience & nanotechnology Scheduling (computing) Important research Transmission (telecommunications) 0202 electrical engineering electronic engineering information engineering 0210 nano-technology Greedy algorithm Wireless sensor network |
| Zdroj: | 2020 The 9th International Conference on Networks, Communication and Computing. |
| DOI: | 10.1145/3447654.3447672 |
| Popis: | The directional connected target coverage (DCTC) problem that schedules directional sensors to cover all targets and forward target information back to the sink to maximize system lifetime is still an important research issue in directional sensor networks. In this paper, a Sector Cover and Transmission Weighted Greedy Algorithm (SCTW-greedy algorithm) is proposed to construct the scheduling of sensors for the DCTC problem. The directional sensor nodes used in the previous works are composed of fixed number of sensors, and the orientations of sensors are fixed. This paper considers the directional sensors with arbitrary sensing orientations. To evaluate the performance of the proposed algorithm, several simulations are conducted. Experimental results show that our algorithm can contribute to extending the network lifetime than previous algorithms. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|