Obstacle based Anchor-FreeNodeLocalization in Under-Water Wireless Sensor Networks

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
AI-generated summary by claude@2026-07, 2026-07-16

This paper proposes a dynamic anchor-free AUV-based algorithm to overcome obstacles and improve underwater sensor localization accuracy while minimizing energy consumption.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

AI-generated deep summary by claude@2026-07, 2026-07-16 · read from full text

This preprint studies anchor-free node localization in underwater wireless sensor networks, focusing on how an autonomous underwater vehicle (AUV) can plan a path to improve localization accuracy while reducing energy use. The authors propose a dynamic anchor-free AUV-based (DAFA) algorithm that detects obstacles and changes the AUV path accordingly, using observed sensor-node locations to minimize localization error and maximize the number of localized nodes. They report that simulations of DAFA outperform traditional algorithms. A major limitation explicitly noted is that the work is a preprint and not peer reviewed. The paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Abstract Settle on the position of unknown sensors node called as localization process which is a serious concern in underwater wireless sensor network(UWSN) as it engross for different applications. As the anchor-based technique is expensive as well as very diminutive life-time researchers propose for anchor-free localization algorithms specially by designing a path for an Autonomous Underwater Vehicle (AUV) to maximize the location of accuracy as well as to reduce energy consumption. Many path planning proposals degrade their performance when there exist obstacles in the pathway of AUV. Hence, in this article we proposed a dynamic anchor free AUV based (DAFA) algorithm which determine the obstacle dynamically and change its path in accordance and the observed location of sensors node with accuracy in minimization of error, maximize the nodes settled and with minimum energy consumption. The simulation of the proposed model outperforms better than available traditional algorithms.
Full text 8,992 characters · extracted from preprint-html · click to expand
Obstacle based Anchor-FreeNodeLocalization in Under-Water Wireless Sensor Networks | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Obstacle based Anchor-FreeNodeLocalization in Under-Water Wireless Sensor Networks Ashish Kumar Dass This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-2445310/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Settle on the position of unknown sensors node called as localization process which is a serious concern in underwater wireless sensor network(UWSN) as it engross for different applications. As the anchor-based technique is expensive as well as very diminutive life-time researchers propose for anchor-free localization algorithms specially by designing a path for an Autonomous Underwater Vehicle (AUV) to maximize the location of accuracy as well as to reduce energy consumption. Many path planning proposals degrade their performance when there exist obstacles in the pathway of AUV. Hence, in this article we proposed a dynamic anchor free AUV based (DAFA) algorithm which determine the obstacle dynamically and change its path in accordance and the observed location of sensors node with accuracy in minimization of error, maximize the nodes settled and with minimum energy consumption. The simulation of the proposed model outperforms better than available traditional algorithms. Systems and Networking Node Localization UWSN AUV Path planning Model DAFA Full Text Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-2445310","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":165181749,"identity":"1c344ee5-6629-4828-94ab-f142d1bdb1ef","order_by":0,"name":"Ashish Kumar Dass","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABAElEQVRIie3OMWrDMBTG8WcEmuR4FWjIFQSBLC69SCdhiCeXQsCzwfCmQFdDoLlCQy9gI+gknNUlHVp6gQQvDjhQN1MptdNsHfQHgYb3gw/AZvuPcSchkJ++sntXQE9/+ncy647JOQLwnWiAc2S8TNP6zugbb6nX+6bd3I68TQ67WPcS+VqgyCodZeVsLlzczikPwMnKAcIVErbTUWKYFE6yVcgJEBf7yThTaf1FVoZNDk1bKvQ0kOMAgUolgnXDHg2bckZzhRAAcQaIrBQKZsJobWjsuxh0wwJZLMpwYFj4UbNnP3ow5Omlaa/V6r54f2tiv3/Yr+UX3ttsNpvtR58kBVvKYijcxQAAAABJRU5ErkJggg==","orcid":"","institution":"BPUT, Rourkela, Odisha, India 769004","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Ashish","middleName":"Kumar","lastName":"Dass","suffix":""}],"badges":[],"createdAt":"2023-01-05 06:42:27","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-2445310/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-2445310/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":31166825,"identity":"2374308a-487b-4b23-87f3-cd0cc23b84ca","added_by":"auto","created_at":"2023-01-05 15:30:40","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":389434,"visible":true,"origin":"","legend":"","description":"","filename":"NewFinalSubforJournal.pdf","url":"https://assets-eu.researchsquare.com/files/rs-2445310/v1_covered.pdf"}],"financialInterests":"","formattedTitle":"\u003cp\u003eObstacle based Anchor-FreeNodeLocalization in Under-Water Wireless Sensor Networks\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"Not Applicable","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Node Localization, UWSN, AUV, Path planning Model, DAFA","lastPublishedDoi":"10.21203/rs.3.rs-2445310/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-2445310/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eSettle on the position of unknown sensors node called as localization process which is a serious concern in underwater wireless sensor network(UWSN) as it engross for different applications. As the anchor-based technique is expensive as well as very diminutive life-time researchers propose for anchor-free localization algorithms specially by designing a path for an Autonomous Underwater Vehicle (AUV) to maximize the location of accuracy as well as to reduce energy consumption. Many path planning proposals degrade their performance when there exist obstacles in the pathway of AUV. Hence, in this article we proposed a dynamic anchor free AUV based (DAFA) algorithm which determine the obstacle dynamically and change its path in accordance and the observed location of sensors node with accuracy in minimization of error, maximize the nodes settled and with minimum energy consumption. The simulation of the proposed model outperforms better than available traditional algorithms.\u003c/p\u003e","manuscriptTitle":"Obstacle based Anchor-FreeNodeLocalization in Under-Water Wireless Sensor Networks","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2023-01-05 15:30:31","doi":"10.21203/rs.3.rs-2445310/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"3c0fffd0-b306-4257-a95b-a12224352774","owner":[],"postedDate":"January 5th, 2023","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":18163571,"name":"Systems and Networking"}],"tags":[],"updatedAt":"2023-01-05T15:30:31+00:00","versionOfRecord":[],"versionCreatedAt":"2023-01-05 15:30:31","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-2445310","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-2445310","identity":"rs-2445310","version":["v1"]},"buildId":"cBFmMYwuxLRRLfASyISRj","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-06-06T02:00:05.402940+00:00
License: CC-BY-4.0