Abstract
In this work, we develop a target coverage-aware clustering algorithm for directional sensor networks, namely,,,, TRACE, that enhances the network lifetime. The TRACE nodes exploit single-hop neighborhood information only to elect cluster heads (CHs) and gateways. Thus, the TRACE is a fully distributed and light-weight clustering algorithm. The TRACE CHs greedily maximize the number of targets covered by as minimum number of sensor nodes as possible. The performances of the proposed TRACE system are studied on Network Simulator version 3 (ns- 3), and the results show that, it outperforms a state-of-the-art- work.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have