Optimum Temporal Coverage with Rotating Directional Sensors

摘要: Advances in directional sensors technology and impressive development of wireless sensor networks, created a new class networks called networks. According to the nature nodes, coverage problem is substantial. The measurement network can be positional or temporal. In temporal coverage, periodically repeat rotating around themselves. Therefore each period time, targets that exist radius nodes are covered interval time. this model, when target has not been by any it said remained dark. Temporal model defined minimizing dark time for all targets. This paper presents two solutions solving problem. first solution formulates as an integer linear programming (ILP) optimization By using method, optimal achieved Due NP-Hardness since ILP centralized we develop heuristics solution, namely distributed initial orientation algorithm (DIOA). uses local information tries near-optimal. Simulation results show ILP, have up 14.19% reduction on average sum DIOA 6.74%. Additionally, number perfect (0-dark time) method improves 69.29% 25.23% improvements compared related algorithms.