Abstract

Lifetime maximization is a key challenge in the design of sensor-network-based tracking applications. In this paper, formation of optimal coalitions of nodes is investigated for data acquisition in bearings-only target localization such that the average sleep times allocated to the nodes are maximized. Cooperative game theory is utilized as a tool to devise a distributed dynamic coalition formation algorithm in which nodes autonomously decide which coalition to join, while maximizing their feasible sleep times. If each node follows the proposed algorithm, the average sleep time for the entire network eventually converges to its maximum feasible value conditional on the pre-defined localization accuracy. This algorithm can also be employed in tracking slow moving targets.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.