Abstract

Malicious anchor node is a serious issue in underwater sensor networks. This problem gets compounded under sparse deployment scenario. To overcome this issue, the authors present a compressed sensing theorem (abbreviated as CS-MC Theorem) which would be applicable to underwater localization. To counter malicious node behavior, CS-MC Theorem is justified through three lemmas. For underwater acoustic propagation, a specific L1-norm minimization method is derived. It describes the condition for unique localization of target by discretizing the target search space. Malicious node is identified by inserting the anchor nodes into the discretized grid. An insertion vector concept is introduced to determine the extent of node metastasis. Derivations are performed to prove the mathematical basis of the proposed algorithm under acoustically stratified and unstratified scenarios. Numerical results establish the feasibility of CS-MC algorithm for sparse underwater acoustic sensor network.

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.