๐ป self_localization_iot_noisy_anchor_positions_rssi_2021.html
html ยท 2812 lines ยท โฌ๏ธ Download
<!DOCTYPE html>
<html lang="en" >
<head >
<meta charset="UTF-8" />
<meta http-equiv="X-UA-Compatible" content="IE=edge" />
<meta name="HandheldFriendly" content="True" />
<meta name="MobileOptimized" content="320" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<link rel="stylesheet" href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/base_style-BxRs1iOp.css" />
<script type="module" crossorigin="" src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/base_style-D-jH62-1.js"></script>
<link rel="stylesheet" href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/article_style-B67IZFds.css" />
<link rel="stylesheet" href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/style-D77LS1kY.css" />
<script type="module" crossorigin="" src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/article_style-CTAd1LmM.js"></script>
<style>
@media screen and (min-width: 64em) {
div.pmc-wm {
background: repeat-y;
background-image: url("data:image/svg+xml,%3Csvg xmlns='http://www.w3.org/2000/svg' width='20' height='350' xmlns:xlink='http://www.w3.org/1999/xlink'%3E%3Cdefs%3E%3Cfilter x='-.02' y='0' width='1.05' height='1' id='c'%3E%3CfeFlood flood-color='%23FFF'/%3E%3CfeComposite in='SourceGraphic'/%3E%3C/filter%3E%3Ctext id='b' font-family='Helvetica' font-size='11pt' style='opacity:1;fill:%23005ea2;stroke:none;text-anchor:middle' x='175' y='14'%3E%3C/text%3E%3Cpath id='a' style='fill:%23005ea2' d='M0 8h350v3H0z'/%3E%3C/defs%3E%3Cuse xlink:href='%23a' transform='rotate(90 10 10)'/%3E%3Cuse xlink:href='%23b' transform='rotate(90 10 10)' filter='url(%23c)'/%3E%3C/svg%3E");
padding-left: 3rem;
}
}
</style>
<link rel="apple-touch-icon"
sizes="180x180"
href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/favicons/apple-touch-icon.png" />
<link rel="icon"
type="image/png"
sizes="48x48"
href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/favicons/favicon-48x48.png" />
<link rel="icon"
type="image/png"
sizes="32x32"
href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/favicons/favicon-32x32.png" />
<link rel="icon"
type="image/png"
sizes="16x16"
href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/favicons/favicon-16x16.png" />
<link rel="manifest" href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/favicons/site.webmanifest" />
<link rel="mask-icon"
href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/favicons/safari-pinned-tab.svg"
color="#0071bc" />
<meta name="msapplication-config"
content="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/favicons/browserconfig.xml" />
<meta name="theme-color" content="#ffffff" />
<title>
Self-Localization of IoT Devices Using Noisy Anchor Positions and RSSI Measurements - PMC
</title>
<meta name="ncbi_app" content="cloudpmc-viewer" />
<meta name="ncbi_db" content="pmc" />
<meta name="ncbi_phid" content="321F5BDD9E0AE7C30E5BDD00131D07EA.m_1" />
<meta name="ncbi_pinger_stat_url" content="https://pmc.ncbi.nlm.nih.gov/stat" />
<meta name="ncbi_pdid" content="article" />
<link rel="preconnect" href="https://www.google-analytics.com" />
<link rel="preconnect" href="https://cdn.ncbi.nlm.nih.gov" />
<script src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/uswds-init.js"></script>
<meta name="ncbi_domain" content="phenaturepg">
<meta name="ncbi_type" content="fulltext">
<meta name="ncbi_pcid" content="journal">
<link rel="canonical" href="https://pmc.ncbi.nlm.nih.gov/articles/PMC8636071/">
<meta name="robots" content="INDEX,NOFOLLOW,NOARCHIVE">
<meta name="citation_journal_title" content="Wireless Personal Communications">
<meta name="citation_title" content="Self-Localization of IoT Devices Using Noisy Anchor Positions and RSSI Measurements">
<meta name="citation_author" content="Vikram Kumar">
<meta name="citation_author_institution" content="IIIT Una, Una, India">
<meta name="citation_author" content="Reza Arablouei">
<meta name="citation_author_institution" content="Data61, CSIRO, Pullenvale, QLD 4069 Australia">
<meta name="citation_publication_date" content="2021 Dec 2">
<meta name="citation_volume" content="124">
<meta name="citation_issue" content="2">
<meta name="citation_firstpage" content="1623">
<meta name="citation_doi" content="10.1007/s11277-021-09423-x">
<meta name="citation_pmid" content="34873380">
<meta name="citation_abstract_html_url" content="https://pmc.ncbi.nlm.nih.gov/articles/PMC8636071/">
<meta name="citation_fulltext_html_url" content="https://pmc.ncbi.nlm.nih.gov/articles/PMC8636071/">
<meta name="citation_pdf_url" content="https://pmc.ncbi.nlm.nih.gov/articles/PMC8636071/pdf/11277_2021_Article_9423.pdf">
<meta name="description" content="Location-enabled Internet of things (IoT) has attracted much attention from the scientific and industrial communities given its high relevance in application domains such as agriculture, wildlife management, and infectious disease control. The ...">
<meta name="og:title" content="Self-Localization of IoT Devices Using Noisy Anchor Positions and RSSI Measurements">
<meta name="og:type" content="article">
<meta name="og:site_name" content="PubMed Central (PMC)">
<meta name="og:description" content="Location-enabled Internet of things (IoT) has attracted much attention from the scientific and industrial communities given its high relevance in application domains such as agriculture, wildlife management, and infectious disease control. The ...">
<meta name="og:url" content="https://pmc.ncbi.nlm.nih.gov/articles/PMC8636071/">
<meta name="og:image" content="https://cdn.ncbi.nlm.nih.gov/pmc/cms/images/pmc-card-share.jpg?_=0">
<meta name="twitter:card" content="summary_large_image">
<meta name="twitter:site" content="@ncbi">
</head>
<body >
<a class="usa-skipnav " href="#main-content">
Skip to main content
</a>
<section class="usa-banner " aria-label="Official website of the United States government" >
<div class="usa-accordion">
<header class="usa-banner__header">
<div class="usa-banner__inner">
<div class="grid-col-auto">
<img aria-hidden="true"
class="usa-banner__header-flag"
src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/us_flag.svg"
alt="" />
</div>
<div class="grid-col-fill tablet:grid-col-auto" aria-hidden="true">
<p class="usa-banner__header-text">
An official website of the United States government
</p>
<span class="usa-banner__header-action">Here's how you know</span>
</div>
<button
type="button"
class="usa-accordion__button usa-banner__button
"
aria-expanded="false"
aria-controls="gov-banner-default"
data-testid="storybook-django-banner"
>
<span class="usa-banner__button-text">Here's how you know</span>
</button>
</div>
</header>
<div class="usa-banner__content usa-accordion__content"
id="gov-banner-default"
hidden>
<div class="grid-row grid-gap-lg">
<div class="usa-banner__guidance tablet:grid-col-6">
<img class="usa-banner__icon usa-media-block__img"
src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/icon-dot-gov.svg"
alt=""
aria-hidden="true" />
<div class="usa-media-block__body">
<p>
<strong>Official websites use .gov</strong>
<br />
A
<strong>.gov</strong> website belongs to an official
government organization in the United States.
</p>
</div>
</div>
<div class="usa-banner__guidance tablet:grid-col-6">
<img class="usa-banner__icon usa-media-block__img"
src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/icon-https.svg"
alt=""
aria-hidden="true" />
<div class="usa-media-block__body">
<p>
<strong>Secure .gov websites use HTTPS</strong>
<br />
A <strong>lock</strong> (
<span class="icon-lock">
<svg xmlns="http://www.w3.org/2000/svg"
width="52"
height="64"
viewBox="0 0 52 64"
class="usa-banner__lock-image"
role="graphics-symbol"
aria-labelledby="banner-lock-description"
focusable="false">
<title id="banner-lock-title">Lock</title>
<desc id="banner-lock-description">
Locked padlock icon
</desc>
<path fill="#000000"
fill-rule="evenodd"
d="M26 0c10.493 0 19 8.507 19 19v9h3a4 4 0 0 1 4 4v28a4 4 0 0 1-4 4H4a4 4 0 0 1-4-4V32a4 4 0 0 1 4-4h3v-9C7 8.507 15.507 0 26 0zm0 8c-5.979 0-10.843 4.77-10.996 10.712L15 19v9h22v-9c0-6.075-4.925-11-11-11z" />
</svg>
</span>) or <strong>https://</strong> means you've safely
connected to the .gov website. Share sensitive
information only on official, secure websites.
</p>
</div>
</div>
</div>
</div>
</div>
</section>
<div class="usa-overlay">
</div>
<header class="usa-header usa-header--extended usa-header--wide" data-header data-testid="header" >
<div class="ncbi-header">
<div class="ncbi-header__container">
<a class="ncbi-header__logo-container"
href="https://www.ncbi.nlm.nih.gov/">
<img alt="NCBI home page"
class="ncbi-header__logo-image"
src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/ncbi-logos/nih-nlm-ncbi--white.svg"
width="410"
height="100" />
</a>
<button
type="button"
class="usa-menu-btn ncbi-header__hamburger-button
"
aria-label="Show menu"
data-testid="navMenuButton"
>
<svg aria-hidden="true"
class="ncbi-hamburger-icon"
fill="none"
focusable="false"
height="21"
viewBox="0 0 31 21"
width="31"
xmlns="http://www.w3.org/2000/svg">
<path clip-rule="evenodd"
d="M0.125 20.75H30.875V17.3333H0.125V20.75ZM0.125 12.2083H30.875V8.79167H0.125V12.2083ZM0.125 0.25V3.66667H30.875V0.25H0.125Z"
fill="#F1F1F1"
fill-rule="evenodd" />
</svg>
</button>
<div class="ncbi-header__desktop-buttons">
<button
type="button"
class="usa-button
usa-button--unstyled ncbi-header__desktop-button
"
aria-expanded="false"
aria-controls="search-field-desktop-navigation"
aria-label="Show search overlay"
data-testid="toggleSearchPanelButton"
data-toggle-search-panel-button
>
<img
src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/search.svg"
class="usa-icon "
aria-hidden="true"
/>
Search
</button>
<div class="ncbi-header__login-dropdown">
<button
type="button"
class="usa-button
usa-button--unstyled ncbi-header__desktop-button ncbi-header__login-dropdown-button
"
aria-expanded="false"
aria-controls="login-dropdown-menu"
aria-label="Show login menu"
data-testid="toggleLoginMenuDropdown"
data-desktop-login-button
>
<img
src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/person.svg"
class="usa-icon "
aria-hidden="true"
/>
<span data-login-dropdown-text>Log in</span>
<img
src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/expand_less.svg"
class="usa-icon ncbi-header__login-dropdown-icon ncbi-header__login-dropdown-icon--expand-less ncbi-header__login-dropdown-icon--hidden"
aria-hidden="true"
data-login-dropdown-up-arrow
/>
<img
src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/expand_more.svg"
class="usa-icon ncbi-header__login-dropdown-icon ncbi-header__login-dropdown-icon--expand-more ncbi-header__login-dropdown-icon--hidden"
aria-hidden="true"
data-login-dropdown-down-arrow
/>
</button>
<ul class="usa-nav__submenu ncbi-header__login-dropdown-menu"
id="login-dropdown-menu"
data-desktop-login-menu-dropdown
hidden>
<li class="usa-nav__submenu-item">
<a href="https://www.ncbi.nlm.nih.gov/myncbi/" class="usa-link " >
Dashboard
</a>
</li>
<li class="usa-nav__submenu-item">
<a href="https://www.ncbi.nlm.nih.gov/myncbi/collections/bibliography/" class="usa-link " >
Publications
</a>
</li>
<li class="usa-nav__submenu-item">
<a href="https://www.ncbi.nlm.nih.gov/account/settings/" class="usa-link " >
Account settings
</a>
</li>
<li class="usa-nav__submenu-item">
<button
type="button"
class="usa-button
usa-button--outline ncbi-header__login-dropdown-logout-button
"
data-testid="desktopLogoutButton"
data-desktop-logout-button
>
Log out
</button>
</li>
</ul>
</div>
</div>
</div>
</div>
<div class="ncbi-search-panel ncbi--show-only-at-desktop"
data-header-search-panel
hidden>
<div class="ncbi-search-panel__container">
<form action="https://www.ncbi.nlm.nih.gov/search/all/"
autocomplete="off"
class="usa-search usa-search--big ncbi-search-panel__form"
data-testid="desktop-navigation-search-form"
method="GET"
role="search">
<label class="usa-sr-only" for="search-field-desktop-navigation">
Searchโฆ
</label>
<input class="usa-input"
id="search-field-desktop-navigation"
name="term"
placeholder="Search NCBI"
type="search"
value="" />
<button
type="submit"
class="usa-button
"
>
<span class="usa-search__submit-text">
Search NCBI
</span>
</button>
</form>
</div>
</div>
<nav aria-label="Primary navigation" class="usa-nav">
<p class="usa-sr-only" id="primary-navigation-sr-only-title">
Primary site navigation
</p>
<button
type="button"
class="usa-nav__close ncbi-nav__close-button
"
aria-label="Close navigation menu"
data-testid="navCloseButton"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/usa-icons/close.svg" alt="Close" />
</button>
<form class="usa-search usa-search--small ncbi--hide-at-desktop"
action="https://www.ncbi.nlm.nih.gov/search/all/"
autocomplete="off"
data-testid="mobile-navigation-search-form"
method="GET"
role="search">
<label class="usa-sr-only" for="search-field-mobile-navigation">
Search
</label>
<input class="usa-input"
id="search-field-mobile-navigation"
type="search"
placeholder="Search NCBI"
name="term" />
<button
type="submit"
class="usa-button
"
>
<img src="data:image/svg+xml;base64,PHN2ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciIGhlaWdodD0iMjQiIHZpZXdCb3g9IjAgMCAyNCAyNCIgd2lkdGg9IjI0Ij48cGF0aCBkPSJNMCAwaDI0djI0SDB6IiBmaWxsPSJub25lIi8+PHBhdGggZmlsbD0iI2ZmZiIgZD0iTTE1LjUgMTRoLS43OWwtLjI4LS4yN0E2LjQ3MSA2LjQ3MSAwIDAgMCAxNiA5LjUgNi41IDYuNSAwIDEgMCA5LjUgMTZjMS42MSAwIDMuMDktLjU5IDQuMjMtMS41N2wuMjcuMjh2Ljc5bDUgNC45OUwyMC40OSAxOWwtNC45OS01em0tNiAwQzcuMDEgMTQgNSAxMS45OSA1IDkuNVM3LjAxIDUgOS41IDUgMTQgNy4wMSAxNCA5LjUgMTEuOTkgMTQgOS41IDE0eiIvPjwvc3ZnPg=="
class="usa-search__submit-icon"
alt="Search" />
</button>
</form>
<div class="ncbi-nav__mobile-login-menu ncbi--hide-at-desktop"
data-mobile-login-menu
hidden>
<p class="ncbi-nav__mobile-login-menu-status">
Logged in as:
<strong class="ncbi-nav__mobile-login-menu-email"
data-mobile-login-email-text></strong>
</p>
<ul class="usa-nav__primary usa-accordion">
<li class="usa-nav__primary-item">
<a href="https://www.ncbi.nlm.nih.gov/myncbi/" class="usa-link " >
Dashboard
</a>
</li>
<li class="usa-nav__primary-item">
<a href="https://www.ncbi.nlm.nih.gov/myncbi/collections/bibliography/" class="usa-link " >
Publications
</a>
</li>
<li class="usa-nav__primary-item">
<a href="https://www.ncbi.nlm.nih.gov/account/settings/" class="usa-link " >
Account settings
</a>
</li>
</ul>
</div>
<button
type="button"
class="usa-button
ncbi-nav__mobile-login-button ncbi--hide-at-desktop
"
data-testid="mobileLoginButton"
data-mobile-login-button
>
Log in
</button>
</nav>
</header>
<section class="pmc-header pmc-header--basic" aria-label="PMC Header with search box">
<div class="pmc-nav-container">
<div class="pmc-header__bar">
<div class="pmc-header__logo">
<a href="/" title="Home" aria-label="PMC Home"></a>
</div>
<button
type="button"
class="usa-button usa-button--unstyled pmc-header__search__button"
aria-label="Open search"
data-ga-category="search"
data-ga-action="PMC"
data-ga-label="pmc_search_panel_mobile"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/search.svg" alt="PMC search open icon" aria-hidden="true" class="usa-icon usa-icon--size-4 pmc-icon__open" />
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/close.svg" alt="PMC search close ison" aria-hidden="true" class="usa-icon usa-icon--size-4 pmc-icon__close" />
</button>
</div>
<div class="pmc-header__search">
<form class="usa-search usa-search--extra usa-search--article-right-column pmc-header__search__form" id="pmc-search-form" autocomplete="off" role="search">
<label class="usa-sr-only" for="pmc-search">Search PMC Full-Text Archive</label>
<span class="autoComplete_wrapper flex-1">
<input class="usa-input width-full maxw-none" required="required" placeholder="Search PMC Full-Text Archive" id="pmc-search" type="search" name="term" data-autocomplete-url="https://pmc.ncbi.nlm.nih.gov/autocomp/search/autocomp/"/>
</span>
<button
class="usa-button"
type="submit"
formaction="https://pmc.ncbi.nlm.nih.gov/search/"
data-ga-category="search"
data-ga-action="PMC"
data-ga-label="PMC_search_button"
>
<span class="usa-search__submit-text">Search in PMC</span>
<img
src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/usa-icons-bg/search--white.svg"
class="usa-search__submit-icon"
alt="Search"
/>
</button>
</form>
<div class="display-flex flex-column tablet:flex-row tablet:flex-justify flex-justify-center flex-align-center width-full desktop:maxw-44">
<ul class="pmc-header__search__menu">
<li>
<a class="usa-link" href="/journals/" data-ga-action="featured_link" data-ga-label="journal list">
Journal List
</a>
</li>
<li>
<a class="usa-link" href="/about/userguide/" data-ga-action="featured_link"
data-ga-label="user guide">
User Guide
</a>
</li>
</ul>
</div>
</div>
</div>
</section>
<div class="usa-section padding-top-0 desktop:padding-top-6 pmc-article-section" data-article-db="pmc" data-article-id="8636071">
<div class="grid-container pmc-actions-bar" aria-label="Actions bar" role="complementary">
<div class="grid-row">
<div class="grid-col-fill display-flex">
<div class="display-flex">
<ul class="usa-list usa-list--unstyled usa-list--horizontal">
<li class="margin-right-2 mobile-lg:margin-right-4 display-flex mob">
<button
type="button"
class="usa-button pmc-sidenav__container__open usa-button--unstyled width-auto display-flex"
aria-label="Open resources"
data-extra-class="is-visible-resources"
data-ga-category="resources_accordion"
data-ga-action="click"
data-ga-label="mobile_icon"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/more_vert.svg" alt="Open resources icon" class="usa-icon usa-icon--size-4 usa-icon--link" />
</button>
</li>
<li class="margin-right-2 mobile-lg:margin-right-4 display-flex mob">
<a
href="https://doi.org/10.1007/s11277-021-09423-x"
class="usa-link display-flex usa-tooltip"
role="button"
target="_blank"
rel="noreferrer noopener"
title="View on publisher site"
data-position="bottom"
aria-label="View on publisher site"
data-ga-category="actions"
data-ga-action="click"
data-ga-label="publisher_link_mobile"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/launch.svg" alt="View on publisher site icon" class="usa-icon usa-icon--size-4 usa-icon--link" />
</a>
</li>
<li class="margin-right-2 mobile-lg:margin-right-4 display-flex">
<a
href="pdf/11277_2021_Article_9423.pdf"
class="usa-link display-flex usa-tooltip"
role="button"
title="Download PDF"
data-position="bottom"
aria-label="Download PDF"
data-ga-category="actions"
data-ga-action="click"
data-ga-label="pdf_download_mobile"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/file_download.svg" alt="Download PDF icon" aria-hidden="true" class="usa-icon usa-icon--size-4 usa-icon--link" />
</a>
</li>
<li class="margin-right-2 mobile-lg:margin-right-4 display-flex">
<button
class="usa-button usa-button--unstyled usa-tooltip collections-dialog-trigger collections-button display-flex collections-button-empty"
title="Add to Collections"
data-position="bottom"
aria-label="Save article in MyNCBI collections."
data-ga-category="actions"
data-ga-action="click"
data-ga-label="collections_button_mobile"
data-collections-open-dialog-enabled="false"
data-collections-open-dialog-url="https://account.ncbi.nlm.nih.gov/?back_url=https%3A%2F%2Fpmc.ncbi.nlm.nih.gov%2Farticles%2FPMC8636071%2F%23open-collections-dialog"
data-in-collections="false"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/action-bookmark-full.svg" alt="Collections icon" aria-hidden="true" class="usa-icon usa-icon--size-4 usa-icon--link usa-icon--bookmark-full" />
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/action-bookmark-empty.svg" alt="Collections icon" aria-hidden="true" class="usa-icon usa-icon--size-4 usa-icon--link usa-icon--bookmark-empty" />
</button>
</li>
<li class="margin-right-2 mobile-lg:margin-right-4 display-flex">
<button role="button" class="usa-button usa-button--unstyled usa-tooltip citation-dialog-trigger display-flex"
aria-label="Open dialog with citation text in different styles"
title="Cite"
data-position="bottom"
data-ga-category="actions"
data-ga-action="open"
data-ga-label="cite_mobile"
data-all-citations-url="/resources/citations/8636071/"
data-citation-style="nlm"
data-download-format-link="/resources/citations/8636071/export/"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/format_quote.svg" alt="Cite icon" aria-hidden="true" class="usa-icon usa-icon--size-4 usa-icon--link" />
</button>
</li>
<li class="pmc-permalink display-flex" >
<button
type="button"
title="Permalink"
data-position="bottom"
class="usa-button usa-button--unstyled display-flex usa-tooltip"
aria-label="Show article permalink"
aria-expanded="false"
aria-haspopup="true"
data-ga-category="actions"
data-ga-action="open"
data-ga-label="permalink_mobile"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/share.svg" alt="Show article permalink icon" aria-hidden="true" class="usa-icon usa-icon--size-4 usa-icon--link" />
</button>
<div class="pmc-permalink__dropdown" hidden>
<div class="pmc-permalink__dropdown__container">
<h2 class="usa-modal__heading margin-top-0 margin-bottom-2 text-uppercase font-sans-xs">PERMALINK</h2>
<div class="pmc-permalink__dropdown__content">
<input type="text" class="usa-input" value="https://pmc.ncbi.nlm.nih.gov/articles/PMC8636071/" aria-label="Article permalink">
<button class="usa-button display-inline-flex pmc-permalink__dropdown__copy__btn margin-right-0" title="Copy article permalink" data-ga-category="save_share" data-ga-action="link" data-ga-label="copy_link">
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/content_copy.svg" alt="Copy icon" aria-hidden="true" class="usa-icon usa-icon--white" />
<span class="margin-left-1">Copy</span>
</button>
</div>
</div>
</div>
</li>
</ul>
</div>
<button
type="button"
class="usa-button pmc-sidenav__container__open usa-button--unstyled width-auto display-flex"
aria-label="Open article navigation"
data-extra-class="is-visible-in-page"
data-ga-category="actions"
data-ga-action="open"
data-ga-label="article_nav_mobile"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/list.svg" alt="Open article navigation icon" aria-hidden="true" class="usa-icon usa-icon--size-4 usa-icon--link" />
</button>
</div>
</div>
</div>
<div class="grid-container desktop:padding-left-6">
<div id="article-container" class="grid-row grid-gap">
<div class="grid-col-12 desktop:grid-col-8 order-2 pmc-layout__content">
<div class="grid-container padding-left-0 padding-right-0">
<div class="grid-row desktop:margin-left-neg-6">
<div class="grid-col-12">
<div class="pmc-layout__disclaimer" role="complementary" aria-label="Disclaimer note">
As a library, NLM provides access to scientific literature. Inclusion in an NLM database does not imply endorsement of, or agreement with,
the contents by NLM or the National Institutes of Health.<br/>
Learn more:
<a class="usa-link" data-ga-category="Link click" data-ga-action="Disclaimer" data-ga-label="New disclaimer box" href="/about/disclaimer/">PMC Disclaimer</a>
|
<a class="usa-link" data-ga-category="Link click" data-ga-action="PMC Copyright Notice" data-ga-label="New disclaimer box" href="/about/copyright/">
PMC Copyright Notice
</a>
</div>
</div>
</div>
<div class="grid-row pmc-wm desktop:margin-left-neg-6">
<main
id="main-content"
class="usa-layout-docs__main usa-layout-docs grid-col-12 pmc-layout pmc-prose padding-0"
>
<section class="pmc-journal-banner text-center line-height-none" aria-label="Journal banner"><img src="https://cdn.ncbi.nlm.nih.gov/pmc/banners/logo-phenaturepg.png" alt="Springer Nature - PMC COVID-19 Collection logo" usemap="#pmc-banner-imagemap" width="500" height="75"><map name="pmc-banner-imagemap"><area alt="Link to Springer Nature - PMC COVID-19 Collection" title="Link to Springer Nature - PMC COVID-19 Collection" shape="default" href="https://www.ncbi.nlm.nih.gov/pmc/about/covid-19/" target="_blank" rel="noopener noreferrer"></map></section><article lang="en"><section aria-label="Article citation and metadata"><section class="pmc-layout__citation font-secondary font-xs"><div>
<div class="display-inline-block"><button type="button" class="cursor-pointer text-no-underline bg-transparent border-0 padding-0 text-left margin-0 text-normal text-primary" aria-controls="journal_context_menu">Wirel Pers Commun</button></div>. 2021 Dec 2;124(2):1623โ1644. doi: <a href="https://doi.org/10.1007/s11277-021-09423-x" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">10.1007/s11277-021-09423-x</a>
</div>
<nav id="journal_context_menu" hidden="hidden"><ul class="menu-list font-family-ui" role="menu">
<li role="presentation"><a href='https://pmc.ncbi.nlm.nih.gov/search/?term="Wirel%20Pers%20Commun"[jour]' class="usa-link" role="menuitem">Search in PMC</a></li>
<li role="presentation"><a href='https://pubmed.ncbi.nlm.nih.gov/?term="Wirel%20Pers%20Commun"[jour]' lang="en" class="usa-link" role="menuitem">Search in PubMed</a></li>
<li role="presentation"><a href='https://www.ncbi.nlm.nih.gov/nlmcatalog?term="Wirel%20Pers%20Commun"[Title%20Abbreviation]' class="usa-link" role="menuitem">View in NLM Catalog</a></li>
<li role="presentation"><a href='?term="Wirel%20Pers%20Commun"[jour]' class="usa-link" role="menuitem" data-add-to-search="true">Add to search</a></li>
</ul></nav></section><section class="front-matter"><div class="ameta p font-secondary font-xs">
<hgroup><h1>Self-Localization of IoT Devices Using Noisy Anchor Positions and RSSI Measurements</h1></hgroup><div class="cg p">
<a href='https://pubmed.ncbi.nlm.nih.gov/?term="Kumar%20V"[Author]' class="usa-link" aria-describedby="id1"><span class="name western">Vikram Kumar</span></a><div hidden="hidden" id="id1">
<h3><span class="name western">Vikram Kumar</span></h3>
<div class="p">
<sup>1</sup>IIIT Una, Una, India </div>
<div class="p">Find articles by <a href='https://pubmed.ncbi.nlm.nih.gov/?term="Kumar%20V"[Author]' class="usa-link"><span class="name western">Vikram Kumar</span></a>
</div>
</div>
<sup>1,</sup><sup>โ</sup>, <a href='https://pubmed.ncbi.nlm.nih.gov/?term="Arablouei%20R"[Author]' class="usa-link" aria-describedby="id2"><span class="name western">Reza Arablouei</span></a><div hidden="hidden" id="id2">
<h3><span class="name western">Reza Arablouei</span></h3>
<div class="p">
<sup>2</sup>Data61, CSIRO, Pullenvale, QLD 4069 Australia </div>
<div class="p">Find articles by <a href='https://pubmed.ncbi.nlm.nih.gov/?term="Arablouei%20R"[Author]' class="usa-link"><span class="name western">Reza Arablouei</span></a>
</div>
</div>
<sup>2</sup>
</div>
<ul class="d-buttons inline-list">
<li><button class="d-button" aria-controls="aip_a" aria-expanded="false">Author information</button></li>
<li><button class="d-button" aria-controls="anp_a" aria-expanded="false">Article notes</button></li>
<li><button class="d-button" aria-controls="clp_a" aria-expanded="false">Copyright and License information</button></li>
</ul>
<div class="d-panels font-secondary-light">
<div id="aip_a" class="d-panel p" style="display: none">
<div class="p" id="Aff1">
<sup>1</sup>IIIT Una, Una, India </div>
<div id="Aff2">
<sup>2</sup>Data61, CSIRO, Pullenvale, QLD 4069 Australia </div>
<div class="author-notes p"><div class="fn" id="_fncrsp93pmc__">
<sup>โ</sup><p class="display-inline">Corresponding author.</p>
</div></div>
</div>
<div id="anp_a" class="d-panel p" style="display: none"><div class="notes p"><section id="historyarticle-meta1" class="history"><p>Accepted 2021 Nov 14; Issue date 2022.</p></section></div></div>
<div id="clp_a" class="d-panel p" style="display: none">
<div>ยฉ The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021</div>
<p>This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic.</p>
<div class="p"><a href="/about/copyright/" class="usa-link">PMC Copyright notice</a></div>
</div>
</div>
<div>PMCID: PMC8636071ย ย PMID: <a href="https://pubmed.ncbi.nlm.nih.gov/34873380/" class="usa-link">34873380</a>
</div>
</div></section></section><section aria-label="Article content"><section class="body main-article-body"><section class="abstract" id="Abs1"><h2>Abstract</h2>
<p id="Par3">Location-enabled Internet of things (IoT) has attracted much attention from the scientific and industrial communities given its high relevance in application domains such as agriculture, wildlife management, and infectious disease control. The frequency and accuracy of location information plays an important role in the success of these applications. However, frequent and accurate self-localization of IoT devices is challenging due to their resource-constrained nature. In this paper, we propose a new algorithm for self-localization of IoT devices using noisy received signal strength indicator (RSSI) measurements and perturbed anchor node position estimates. In the proposed algorithm, we minimize a weighted sum-square-distance-error cost function in an iterative fashion utilizing the gradient-descent method. We calculate the weights using the statistical properties of the perturbations in the measurements. We assume log-normal distribution for the RSSI-induced distance estimates due to considering the log-distance path-loss model with normally-distributed perturbations for the RSSI measurements in the logarithmic scale. We also assume normally-distributed perturbation in the anchor position estimates. We compare the performance of the proposed algorithm with that of an existing algorithm that takes a similar approach but only accounts for the perturbations in the RSSI measurements. Our simulation results show that by taking into account the error in the anchor positions, a significant improvement in the localization accuracy can be achieved. The proposed algorithm uses only a single measurement of RSSI and one estimate of each anchor position. This makes the proposed algorithm suitable for frequent and accurate localization of IoT devices.</p>
<section id="kwd-group1" lang="en" class="kwd-group"><p><strong>Keywords:</strong> IoT, Multilateration, RSSI, Self-localization, Weighted least-squares</p></section></section><section id="Sec1"><h2 class="pmc_sec_title">Introduction</h2>
<p id="Par4">The location information plays an important role in the success of various IoT-based applications related to, for example, healthcare, agriculture, and disaster management [<a href="#CR1" class="usa-link" aria-describedby="CR1">1</a>โ<a href="#CR8" class="usa-link" aria-describedby="CR8">8</a>]. The contact-tracing applications, which have emerged as helpful tools to contain the spread of COVID-19 pandemic, are also based on accurate and frequent location and distance information [<a href="#CR9" class="usa-link" aria-describedby="CR9">9</a>โ<a href="#CR11" class="usa-link" aria-describedby="CR11">11</a>]. However, the self-localization of IoT devices is still challenging due to inherent characteristics of the pertinent applications such as the use of low-grade sensors, environmental disturbances, and lack of line of sight (LoS).</p>
<p id="Par5">Global navigation satellite system (GNSS) receivers are generally used in IoT devices to obtain location information. However, these receivers are known for being power hungry and poor performance in indoor and dense outdoor areas such as forests and cities [<a href="#CR12" class="usa-link" aria-describedby="CR12">12</a>โ<a href="#CR15" class="usa-link" aria-describedby="CR15">15</a>]. In addition, equipping each node with a GNSS receiver in mass IoT deployments may also be infeasible due to cost constraints. A number of alternative technologies such as cooperative localization (based on different ranging methods), use of environmental signals (magnetic, air pressure, etc.), and use of micro-electromechanical systems (MEMS) sensors have been proposed in the literature to address various issues around localization of resource-constrained devices [<a href="#CR16" class="usa-link" aria-describedby="CR16">16</a>โ<a href="#CR19" class="usa-link" aria-describedby="CR19">19</a>].</p>
<p id="Par6">In mass deployment scenario such as large-scale agriculture or wildlife monitoring, centimeter-level accuracy is often not required. Therefore, the alternative localization technologies such as cooperative localization using received signal strength indicator (RSSI) measurements have emerged as effective methods for localizing groups of battery-operated mobile nodes. They reduce the energy consumption by minimizing the use of expensive localization methods such as GNSS [<a href="#CR20" class="usa-link" aria-describedby="CR20">20</a>, <a href="#CR21" class="usa-link" aria-describedby="CR21">21</a>]. In cooperative localization, any node interested in estimating its own position, referred to as the โblind nodeโ, receives position and distance information from its neighboring nodes, called the โanchor nodesโ, and estimates its position through multilateration.</p>
<p id="Par7">In multilateration, a blind node requires the position of the anchor nodes and the distances to them in order to calculate its position. Given accurate anchor node positions and distances, the blind node position is the intersection of the circles with the origins located at the anchor node positions and the radii equal to the corresponding distances. The left plot in Fig. <a href="#Fig1" class="usa-link">1</a> shows three anchor nodes A, B, C with their positions given by coordinates (<em>x</em>1,ย <em>y</em>1),ย (<em>x</em>2,ย <em>y</em>2),ย (<em>x</em>3,ย <em>y</em>3), which are known exactly, and one blind node D with unknown position coordinate (<em>x</em>,ย <em>y</em>). The exact distances between the anchor nodes and the blind node are represented as <em>d</em>1,ย <em>d</em>2,ย <em>d</em>3. Given the exact distances and anchor node positions, the blind node position can be calculated by intersecting the mentioned circles.</p>
<figure class="fig xbox font-sm" id="Fig1"><h3 class="obj_head">Fig. 1.</h3>
<p class="img-box line-height-none margin-x-neg-2 tablet:margin-x-0 text-center"><a class="tileshop" target="_blank" href="https://www.ncbi.nlm.nih.gov/core/lw/2.0/html/tileshop_pmc/tileshop_pmc_inline.html?title=Click%20on%20image%20to%20zoom&p=PMC3&id=8636071_11277_2021_9423_Fig1_HTML.jpg"><img class="graphic zoom-in" src="https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0617/8636071/66fd7723406d/11277_2021_9423_Fig1_HTML.jpg" loading="lazy" id="MO1" height="350" width="707" alt="Fig. 1"></a></p>
<div class="p text-right font-secondary"><a href="figure/Fig1/" class="usa-link" target="_blank" rel="noopener noreferrer">Open in a new tab</a></div>
<figcaption><p>Left: multilateration given the perfect knowledge of anchor positions and distances. Right: multilateration when both anchor positions and distance measurements are perturbed</p></figcaption></figure><p id="Par8">In real life, neither the distance estimates nor the anchor positions are error-free as the RSSI measurements are subject to perturbations arising from model inaccuracy, thermal noise, and measurement error while anchor node position information is usually corrupted by noise or error, especially when it is the product of a previous estimation process including the GNSS. Therefore, in practice, the left-hand side plot of Fig. <a href="#Fig1" class="usa-link">1</a> turns into the one on the right-hand side, where the intersection of circles has uncertainty. The solution to the blind node position estimation problem depends upon the nature of the perturbations assumed in the distance and anchor node position estimates.</p>
<p id="Par9">The problem of coping with the adverse effects of perturbations in the RSSI measurements [<a href="#CR9" class="usa-link" aria-describedby="CR9">9</a>, <a href="#CR22" class="usa-link" aria-describedby="CR22">22</a>โ<a href="#CR27" class="usa-link" aria-describedby="CR27">27</a>] and the anchor node position information [<a href="#CR28" class="usa-link" aria-describedby="CR28">28</a>โ<a href="#CR39" class="usa-link" aria-describedby="CR39">39</a>] has received significant attention from the research communities. Most of the existing proposed solutions rely on complex optimization techniques such as semidefinite programming (SDP) or second-order cone programming (SOCP) to mitigate the adverse effects of perturbations. However, SDP and SOCP-based methods are computational expensive and generally unsuitable for localization of resource-constrained devices.</p>
<p id="Par10">In this paper, we propose a self-localization algorithm suitable for resource-constrained IoT devices given perturbed anchor position information and noisy RSSI-based distance estimates. We tackle the considered self-localization problem by formulating a weighted least-squares cost function, which we minimize using the gradient-descent method. Each term in the cost function is the weighted square of the difference between the distance inferred from an RSSI measurement and the Euclidean distance between the blind node and the anchor node to which the RSSI measurement corresponds. We weight the square-error terms by their variances, which are estimated by taking into account perturbations in both RSSI measurements and anchor node position information. We use the well-known log-normal shadowing path-loss model as the radio propagation model. Therefore, we assume that the RSSI measurements in the logarithmic (dBm) scale are affected by normally-distributed perturbation and consequently the distance estimates inferred from the RSSI measurements have log-normal distribution.</p>
<p id="Par11">We compare the performance of the proposed algorithm with that of an existing WLS-based algorithm [<a href="#CR25" class="usa-link" aria-describedby="CR25">25</a>] that only takes into account the perturbations in the RSSI measurements and has similar computational requirements. Our simulation-based evaluations reveal that significant improvement in location accuracy can be achieved by accounting for anchor position errors in the weight calculations. The proposed algorithm uses only a single RSSI measurement and position estimate corresponding to each anchor node. This makes the proposed algorithm suitable for frequent and accurate self-localization of IoT devices.</p>
<p id="Par12">This paper is an extension of our previous work presented in [<a href="#CR40" class="usa-link" aria-describedby="CR40">40</a>]. The major additions to [<a href="#CR40" class="usa-link" aria-describedby="CR40">40</a>] are as follows: </p>
<ol class="list" style="list-style-type:decimal">
<li><p id="Par13">In this paper, we investigate the performance of the proposed algorithm in both cases of anchor node position perturbations being homogeneous and heterogeneous.</p></li>
<li><p id="Par14">We derive the Cramer-Rao lower bound (CRLB) for the problem in hand.</p></li>
<li><p id="Par15">We investigate the impact of the perturbations in anchor node positions and RSSI measurements on the best achievable localization accuracy.</p></li>
<li><p id="Par16">The experiments presented in this paper are more extensive and are entirely different from those in [<a href="#CR40" class="usa-link" aria-describedby="CR40">40</a>].</p></li>
<li><p id="Par17">There are other substantial enhancements in various parts of the paper including introduction, literature review, algorithm description, and the general narrative.</p></li>
</ol></section><section id="Sec2"><h2 class="pmc_sec_title">Related Work</h2>
<p id="Par18">In this paper, we are interested in self-localization by a resource-constrained mobile node. Some example related applications are proximity services, mobile phone users tracking, and animal tracking [<a href="#CR41" class="usa-link" aria-describedby="CR41">41</a>]. The considered problem has the following distinct features compared to other localization problems, such as self-localization by a static blind node, target localization, and joint multiple blind and anchor node localization, considered in [<a href="#CR22" class="usa-link" aria-describedby="CR22">22</a>, <a href="#CR30" class="usa-link" aria-describedby="CR30">30</a>, <a href="#CR34" class="usa-link" aria-describedby="CR34">34</a>, <a href="#CR35" class="usa-link" aria-describedby="CR35">35</a>, <a href="#CR42" class="usa-link" aria-describedby="CR42">42</a>โ<a href="#CR46" class="usa-link" aria-describedby="CR46">46</a>]:</p>
<ul class="list" style="list-style-type:disc">
<li><p id="Par19">Unlike in target localization, the anchor nodes are not required to be in the communication range of each other.</p></li>
<li><p id="Par20">Limited resources entail the need for avoiding complex algorithms in performing multi-source or joint localization.</p></li>
<li><p id="Par21">The autonomous mobile nature of the nodes may lead to temporary grouping behaviors. The grouping interval sometimes may not be enough to receive or share the results of joint localization.</p></li>
</ul>
<p>Substantial research efforts have been dedicated to developing localization algorithms that can compensate for the adverse effects of perturbations in the RSSI measurements and the anchor node position information [<a href="#CR29" class="usa-link" aria-describedby="CR29">29</a>, <a href="#CR31" class="usa-link" aria-describedby="CR31">31</a>, <a href="#CR32" class="usa-link" aria-describedby="CR32">32</a>, <a href="#CR34" class="usa-link" aria-describedby="CR34">34</a>, <a href="#CR35" class="usa-link" aria-describedby="CR35">35</a>]. Most of the proposed algorithms that can cope with perturbations in both RSSI measurements and anchor node position information assume zero-mean Gaussian perturbation in the distance measurements and use computationally demanding optimization techniques such as SDP or SOCP.</p>
<p id="Par22">In [<a href="#CR47" class="usa-link" aria-describedby="CR47">47</a>โ<a href="#CR49" class="usa-link" aria-describedby="CR49">49</a>], the authors propose an RSSI-based solution for location estimation of a source and multiple anchor nodes. They also provide the theoretical bounds for their solution as well as an interpretation of the theoretical bounds. The nature of the perturbations considered in [<a href="#CR47" class="usa-link" aria-describedby="CR47">47</a>โ<a href="#CR49" class="usa-link" aria-describedby="CR49">49</a>] is the same as what we consider in this paper. However, their approach is based on using multiple RSSI and anchor position measurements. Nonetheless, our work is focused on energy-efficient outdoor localization of mobile nodes where the GNSS is the main source of anchor position information while being responsible for the majority of energy consumed. Therefore, the requirement of multiple measurements of a anchor position is not in line with our goal of energy/resource-efficient localization.</p>
<p id="Par23">In [<a href="#CR50" class="usa-link" aria-describedby="CR50">50</a>], the authors explore the concept of collaborative GNSS duty cycling using Wi-Fi ad-hoc connectivity while ensuring application-specific error bounds. Whenever a node approaches the error bound, it first requests another (hopefully better) position estimate from its neighborhood and awaits for a response within a certain timeframe. In the case of a positive response, the node updates its position estimate. Otherwise, it acquires its own GNSS position coordinates and broadcasts them.</p>
<p id="Par24">In [<a href="#CR50" class="usa-link" aria-describedby="CR50">50</a>], the authors present an algorithm for self-localization in resource-constrained environments but their main aim is to minimize the energy consumption. They do not consider any perturbation in distance estimates or neighborhood position information. In [<a href="#CR51" class="usa-link" aria-describedby="CR51">51</a>], the authors aim at improving the Wi-Fi positioning in indoor environments by using the RSSI-based distances among neighbors. They calculate confidence scores as weights in deciding the positions of the neighbors. The confidence of the Wi-Fi-based position is a function of the standard deviation of the multiple Wi-Fi scans for the same point. A lower standard deviation means higher confidence on position and vice-versa. Similarly, the confidence score of the Bluetooth is assigned by RSSI modeling in different settings of the indoor environment. Lastly, game theory is used to determine the final position of the nodes. Similar to others, this work only considers the error in the RSSI measurements. A simple subspace-based algorithm for single mobile node positioning using time of arrival (TOA) measurements from three or more anchors with exact position information is given in [<a href="#CR52" class="usa-link" aria-describedby="CR52">52</a>].</p>
<p id="Par25">In [<a href="#CR25" class="usa-link" aria-describedby="CR25">25</a>], the authors propose two WLS-based algorithms, called hyperbolic and circular, to localize a node in the presence of log-normal perturbations in the RSSI-based distance measurements. The hyperbolic algorithm linearizes the problem and solves it using the WLS method. The circular algorithm minimize the weighted approximation of the original non-linear sum-square-error cost function using the gradient-descent method. The circular algorithm performs better than the hyperbolic algorithm due to minimization of the original cost function by an iterative approach. The proposed algorithms match the low computational requirement of our applications of interest but do not consider perturbations in the anchor node positions. Our proposed algorithm is based on a similar approach and is of non-linear WLS type but assumes perturbations in the anchor positions as well.</p>
<p id="Par26">In summary, the existing relevant works either assume the perturbations in both RSSI-based distance measurements and anchor positions to have normal distribution, which is not realistic given that the RSSI-based distance measurements follow log-normal distribution [<a href="#CR53" class="usa-link" aria-describedby="CR53">53</a>], or propose solutions that are based on complex optimization techniques such as SDP or SOCP. The applications of our interest fall into a category where a resource-constrained mobile node has access to perturbed anchor node positions and RSSI measurements and is interested in localizing itself in a resource-efficient way. We consider a more realistic log-normal perturbation for the RSSI-based distance measurements and normal distribution for anchor position perturbations. To meet the resource-efficiency requirement, we find a weighted nonlinear least-squares solution for the considered location estimation problem by minimizing a weighted sum-square error cost function using the gradient-descent method.</p>
<p id="Par27"><em>Notations</em>: The symbol <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq1"><math id="M2"><msup><mrow><mi mathvariant="double-struck">N</mi></mrow><mo>+</mo></msup></math></span> denotes the set of positive integers and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq2"><math id="M4"><mi mathvariant="double-struck">R</mi></math></span> denotes the set of real numbers. A lower-case letter, e.g., <em>x</em>, represents a scalar variable; a lower-case bold letter, e.g., <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq3"><math id="M6"><mi mathvariant="bold">r</mi></math></span>, represents a vector; and an upper-case bold letter, e.g., <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq4"><math id="M8"><mi mathvariant="bold">F</mi></math></span>, represents a matrix. The superscript <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq5"><math id="M10"><msup><mrow><mo stretchy="false">(</mo><mo>.</mo><mo stretchy="false">)</mo></mrow><mi>T</mi></msup></math></span> denotes the vector/matrix transpose and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq6"><math id="M12"><msup><mrow><mo stretchy="false">(</mo><mo>.</mo><mo stretchy="false">)</mo></mrow><mrow><mo>-</mo><mn>1</mn></mrow></msup></math></span> denotes the matrix inverse. A letter with a tilde accent, e.g., <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq7"><math id="M14"><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></math></span>, represents the noisy observation of the original variable, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq8"><math id="M16"><msub><mi>x</mi><mi>i</mi></msub></math></span>; a letter with a hat accent, e.g., <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq9"><math id="M18"><mover accent="true"><mi>x</mi><mo stretchy="false">^</mo></mover></math></span>, represents an estimated value; and a letter with an overbar, e.g., <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq10"><math id="M20"><mover accent="true"><mrow><mi>e</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover></math></span>, represents an approximate value. The operator <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq11"><math id="M22"><mfrac><mrow><mi>โ</mi><mo stretchy="false">(</mo><mo>.</mo><mo stretchy="false">)</mo></mrow><mrow><mi>โ</mi><mi>v</mi></mrow></mfrac></math></span> is the partial derivative with respect to the variable <em>v</em>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq12"><math id="M24"><mrow><mi mathvariant="normal">Var</mi><mo stretchy="false">(</mo><mo>.</mo><mo stretchy="false">)</mo></mrow></math></span> returns the variance of a scalar, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq13"><math id="M26"><mrow><mi mathvariant="normal">Cov</mi><mo stretchy="false">(</mo><mo>.</mo><mo stretchy="false">)</mo></mrow></math></span> returns the covariance matrix of its vector argument, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq14"><math id="M28"><mrow><mi mathvariant="double-struck">E</mi><mo stretchy="false">[</mo><mo>.</mo><mo stretchy="false">]</mo></mrow></math></span> is the expectation operator, and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq15"><math id="M30"><mrow><mi mathvariant="normal">Tr</mi><mo stretchy="false">{</mo><mo>.</mo><mo stretchy="false">}</mo></mrow></math></span> is the matrix trace operator. The symbol <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq16"><math id="M32"><mrow><mi mathvariant="script">N</mi><mfenced close=")" open="("><mi>ฮผ</mi><mo>,</mo><mi>ฯ</mi></mfenced></mrow></math></span> represents the normal (Gaussian) distribution with mean <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq17"><math id="M34"><mi>ฮผ</mi></math></span> and standard deviation <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq18"><math id="M36"><mi>ฯ</mi></math></span>.</p></section><section id="Sec3"><h2 class="pmc_sec_title">Problem Statement</h2>
<p id="Par28">We consider the problem of self-localization by a single node, referred to as the blind node, on a two-dimensional Cartesian plane. The blind node is interested in obtaining an estimate of its true position, denoted by <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq19"><math id="M38"><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>b</mi></msub><mo>,</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow></math></span>. There are <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq20"><math id="M40"><mrow><mi>M</mi><mo>โฅ</mo><mn>3</mn></mrow></math></span> nodes, referred to as the anchor nodes, arbitrarily distributed within the communication range of the blind node at locations <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq21"><math id="M42"><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>,</mo><msub><mi>y</mi><mi>i</mi></msub><mo stretchy="false">)</mo></mrow></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq22"><math id="M44"><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><mi>M</mi></mrow></math></span>. The locations of the anchor nodes are known to the blind node only approximately as they are corrupted by random perturbations. The blind node estimates its distance from the anchor nodes using available RSSI measurements that are also subject to random perturbations. We denote the perturbed knowledge of the anchor node positions at the blind node by <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq23"><math id="M46"><mrow><mo stretchy="false">(</mo><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>,</mo><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo stretchy="false">)</mo></mrow></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq24"><math id="M48"><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><mi>M</mi></mrow></math></span>, and the corresponding perturbed RSSI measurements by <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq25"><math id="M50"><mover accent="true"><msub><mi>p</mi><mi>i</mi></msub><mo stretchy="false">~</mo></mover></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq26"><math id="M52"><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><mi>M</mi></mrow></math></span>, in the linear (mW) scale and by <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq27"><math id="M54"><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mrow><mi>i</mi><mtext>(dBm)</mtext></mrow></msub></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq28"><math id="M56"><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><mi>M</mi></mrow></math></span>, in the logarithmic (dBm) scale.</p>
<p id="Par29">We adopt the following common assumptions:</p>
<p id="Par30"><em>A1</em>: The available knowledge of the position of the <em>i</em>th anchor node on <em>x</em> and <em>y</em> axes are corrupted by independent additive zero-mean Gaussian perturbations with standard deviation <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq29"><math id="M58"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span>. The perturbations of different anchor node positions are independent of each other and the values of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq30"><math id="M60"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> may not be the same for different anchor nodes. Therefore, we have</p>
<table class="disp-formula p" id="Equ1"><tr>
<td class="formula"><math id="M62" display="block"><mrow><mtable><mtr><mtd></mtd><mtd columnalign="left"><mrow><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>=</mo><msub><mi>x</mi><mi>i</mi></msub><mo>+</mo><msub><mi>n</mi><msub><mi>x</mi><mi>i</mi></msub></msub></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">1</td>
</tr></table>
<table class="disp-formula p" id="Equ2"><tr>
<td class="formula"><math id="M64" display="block"><mrow><mtable><mtr><mtd></mtd><mtd columnalign="left"><mrow><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>=</mo><msub><mi>y</mi><mi>i</mi></msub><mo>+</mo><msub><mi>n</mi><msub><mi>y</mi><mi>i</mi></msub></msub></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">2</td>
</tr></table>
<table class="disp-formula p" id="Equ3"><tr>
<td class="formula"><math id="M66" display="block"><mrow><mtable><mtr><mtd></mtd><mtd columnalign="left"><mrow><msub><mi>n</mi><msub><mi>x</mi><mi>i</mi></msub></msub><mo>,</mo><msub><mi>n</mi><msub><mi>y</mi><mi>i</mi></msub></msub><mo>โผ</mo><mi mathvariant="script">N</mi><mrow><mo stretchy="false">(</mo><mn>0</mn><mo>,</mo><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo stretchy="false">)</mo></mrow><mo>.</mo></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">3</td>
</tr></table>
<p><em>A2</em>: The path-loss model for the radio signal propagation is the log-normal shadowing model. Therefore, the RSSI measurement of the signal transmitted from the <em>i</em>th anchor node and received at the blind node has a nominal value of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq31"><math id="M68"><msub><mover accent="true"><mrow><mi>p</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mrow><mi>i</mi><mtext>(dBm)</mtext></mrow></msub></math></span> in the logarithmic (dBm) domain. However, the actual measured value is a realization of the nominal value corrupted by a zero-mean Gaussian perturbation with standard deviation <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq32"><math id="M70"><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub></math></span>, i.e.,</p>
<table class="disp-formula p" id="Equ4"><tr>
<td class="formula"><math id="M72" display="block"><mrow><mtable><mtr><mtd></mtd><mtd columnalign="left"><mrow><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mrow><mi>i</mi><mtext>(dBm)</mtext></mrow></msub><mo>=</mo><msub><mover accent="true"><mrow><mi>p</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mrow><mi>i</mi><mtext>(dBm)</mtext></mrow></msub><mo>+</mo><msub><mi>n</mi><msub><mi>p</mi><mi>i</mi></msub></msub></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">4</td>
</tr></table>
<table class="disp-formula p" id="Equ5"><tr>
<td class="formula"><math id="M74" display="block"><mrow><mtable><mtr><mtd></mtd><mtd columnalign="left"><mrow><msub><mi>n</mi><msub><mi>p</mi><mi>i</mi></msub></msub><mo>โผ</mo><mi mathvariant="script">N</mi><mfenced close=")" open="("><mn>0</mn><mo>,</mo><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub></mfenced><mo>.</mo></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">5</td>
</tr></table>
<p>According to the shadowing path-loss model, we have</p>
<table class="disp-formula p" id="Equ6"><tr>
<td class="formula"><math id="M76" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mover accent="true"><mrow><mi>p</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mrow><mi>i</mi><mtext>(dBm)</mtext></mrow></msub><mo>=</mo><msub><mi>p</mi><mrow><mn>0</mn><mtext>(dBm)</mtext></mrow></msub><mo>-</mo><mn>10</mn><mi>ฮท</mi><mo>ln</mo><mfrac><msub><mi>d</mi><mi>i</mi></msub><msub><mi>d</mi><mn>0</mn></msub></mfrac></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">6</td>
</tr></table>
<p>where</p>
<table class="disp-formula p" id="Equ7"><tr>
<td class="formula"><math id="M78" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mi>d</mi><mi>i</mi></msub><mo>=</mo><msqrt><mrow><msup><mfenced close=")" open="("><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub></mfenced><mn>2</mn></msup><mo>+</mo><msup><mfenced close=")" open="("><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub></mfenced><mn>2</mn></msup></mrow></msqrt></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">7</td>
</tr></table>
<p>is the distance between the blind node and the <em>i</em>th anchor node. In addition, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq33"><math id="M80"><msub><mi>d</mi><mn>0</mn></msub></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq34"><math id="M82"><msub><mi>p</mi><mrow><mn>0</mn><mtext>(dBm)</mtext></mrow></msub></math></span>, and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq35"><math id="M84"><mi>ฮท</mi></math></span>, are the reference distance, the received power at the reference distance, and the path-loss exponent, respectively. Therefore, given the perturbed value <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq36"><math id="M86"><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mrow><mi>i</mi><mtext>(dBm)</mtext></mrow></msub></math></span>, the RSSI-induced estimate for the distance between the blind node and the <em>i</em>th anchor node, denoted by <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq37"><math id="M88"><msub><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></math></span>, is given by</p>
<table class="disp-formula p" id="Equ8"><tr>
<td class="formula"><math id="M90" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>=</mo><msub><mi>d</mi><mn>0</mn></msub><msup><mn>10</mn><mfrac><mrow><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mrow><mi>i</mi><mtext>(dBm)</mtext></mrow></msub><mo>-</mo><msub><mi>p</mi><mrow><mn>0</mn><mtext>(dBm)</mtext></mrow></msub></mrow><mrow><mn>10</mn><mi>ฮท</mi></mrow></mfrac></msup></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">8</td>
</tr></table>
<p>Furthermore, we assume that the blind node and the anchor nodes have limited computational and energy resources. Hence, at any particular instance of localization, only one RSSI measurement and position estimate from each anchor node is available to the blind node.</p></section><section id="Sec4"><h2 class="pmc_sec_title">Proposed Algorithm</h2>
<p id="Par31">One can estimate the position of the blind node by minimizing the following sum-square-error cost function</p>
<table class="disp-formula p" id="Equ9"><tr>
<td class="formula"><math id="M92" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mi>c</mi><mrow><mo stretchy="false">(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><munderover><mo>โ</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>M</mi></munderover><msup><mrow><msub><mi>e</mi><mi>i</mi></msub></mrow><mn>2</mn></msup><mrow><mo stretchy="false">(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo stretchy="false">)</mo></mrow></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">9</td>
</tr></table>
<p>where</p>
<table class="disp-formula p" id="Equ10"><tr>
<td class="formula"><math id="M94" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mi>e</mi><mi>i</mi></msub><mrow><mo stretchy="false">(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><msub><mi>ฮด</mi><mi>i</mi></msub><mo>-</mo><msub><mi>d</mi><mi>i</mi></msub></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">10</td>
</tr></table>
<p>and</p>
<table class="disp-formula p" id="Equ11"><tr>
<td class="formula"><math id="M96" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mi>ฮด</mi><mi>i</mi></msub><mo>=</mo><msqrt><mrow><msup><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><mi>x</mi><mo stretchy="false">)</mo></mrow><mn>2</mn></msup><mo>+</mo><msup><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><mi>y</mi><mo stretchy="false">)</mo></mrow><mn>2</mn></msup></mrow></msqrt><mo>.</mo></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">11</td>
</tr></table>
<p>Given an initial estimate, the blind nodeโs position can be estimated using a gradient-descent method as follows:</p>
<table class="disp-formula p" id="Equ12"><tr>
<td class="formula"><math id="M98" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mtable><mtr><mtd></mtd><mtd columnalign="left"><mrow><msubsup><mover accent="true"><mi>x</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo>+</mo><mn>1</mn><mo stretchy="false">)</mo></mrow></msubsup><mo>=</mo><msubsup><mover accent="true"><mi>x</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup><mo>-</mo><mi>ฮฑ</mi><mfrac><mrow><mi>โ</mi><mi>c</mi></mrow><mrow><mi>โ</mi><mi>x</mi></mrow></mfrac><msub><mrow><mo maxsize="1.623em" minsize="1.623em" stretchy="true">|</mo></mrow><mrow><mi>x</mi><mo>=</mo><msubsup><mover accent="true"><mi>x</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mrow></msub></mrow></mtd></mtr><mtr><mtd columnalign="right"><mrow></mrow></mtd><mtd columnalign="left"><mrow><msubsup><mover accent="true"><mi>y</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo>+</mo><mn>1</mn><mo stretchy="false">)</mo></mrow></msubsup><mo>=</mo><msubsup><mover accent="true"><mi>y</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup><mo>-</mo><mi>ฮฑ</mi><mfrac><mrow><mi>โ</mi><mi>c</mi></mrow><mrow><mi>โ</mi><mi>y</mi></mrow></mfrac><msub><mrow><mo maxsize="1.623em" minsize="1.623em" stretchy="true">|</mo></mrow><mrow><mi>y</mi><mo>=</mo><msubsup><mover accent="true"><mi>y</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mrow></msub></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">12</td>
</tr></table>
<p>where <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq38"><math id="M100"><mrow><mi>ฮฑ</mi><mo>></mo><mn>0</mn></mrow></math></span> is the step-size parameter and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq39"><math id="M102"><msubsup><mover accent="true"><mi>x</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></math></span> and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq40"><math id="M104"><msubsup><mover accent="true"><mi>y</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></math></span> are the estimate of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq41"><math id="M106"><msub><mi>x</mi><mi>b</mi></msub></math></span> and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq42"><math id="M108"><msub><mi>y</mi><mi>b</mi></msub></math></span> at iteration <em>k</em>, respectively.</p>
<p id="Par32">However, we do not have access to the unperturbed values <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq43"><math id="M110"><msub><mi>x</mi><mi>i</mi></msub></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq44"><math id="M112"><msub><mi>y</mi><mi>i</mi></msub></math></span>, and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq45"><math id="M114"><msub><mi>d</mi><mi>i</mi></msub></math></span>. Hence, we replace them with their corresponding perturbed observations <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq46"><math id="M116"><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq47"><math id="M118"><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></math></span>, and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq48"><math id="M120"><msub><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></math></span> and approximate the <em>i</em>th error term with</p>
<table class="disp-formula p" id="Equ13"><tr>
<td class="formula"><math id="M122" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mover accent="true"><mrow><mi>e</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mi>i</mi></msub><mrow><mo stretchy="false">(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><msub><mover accent="true"><mi>ฮด</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>-</mo><msub><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">13</td>
</tr></table>
<p>where</p>
<table class="disp-formula p" id="Equ14"><tr>
<td class="formula"><math id="M124" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mover accent="true"><mi>ฮด</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>=</mo><msqrt><mrow><msup><mrow><mo stretchy="false">(</mo><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>-</mo><mi>x</mi><mo stretchy="false">)</mo></mrow><mn>2</mn></msup><mo>+</mo><msup><mrow><mo stretchy="false">(</mo><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>-</mo><mi>y</mi><mo stretchy="false">)</mo></mrow><mn>2</mn></msup></mrow></msqrt></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">14</td>
</tr></table>
<p>In addition, to factor in the difference in the scale and statistical properties of the values associated with different anchor nodes, we weight each error term with the inverse of its standard deviation. Therefore, we minimize the following WLS cost function</p>
<table class="disp-formula p" id="Equ15"><tr>
<td class="formula"><math id="M126" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mover accent="true"><mrow><mi>c</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mrow><mo stretchy="false">(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><munderover><mo>โ</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>M</mi></munderover><mfrac><msup><mover accent="true"><mrow><msub><mi>e</mi><mi>i</mi></msub></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mn>2</mn></msup><mrow><mi mathvariant="normal">Var</mi><mo stretchy="false">(</mo><msub><mover accent="true"><mrow><mi>e</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mi>i</mi></msub><mo stretchy="false">)</mo></mrow></mfrac></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">15</td>
</tr></table>
<p>Since the perturbations of the anchor positions and RSSI-induced distances are independent of each other, each variance term <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq49"><math id="M128"><mrow><mi mathvariant="normal">Var</mi><mo stretchy="false">(</mo><mover accent="true"><mrow><msub><mi>e</mi><mi>i</mi></msub></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mo stretchy="false">)</mo></mrow></math></span> can be calculated as</p>
<table class="disp-formula p" id="Equ16"><tr>
<td class="formula"><math id="M130" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mi mathvariant="normal">Var</mi><mrow><mo stretchy="false">(</mo><mover accent="true"><mrow><msub><mi>e</mi><mi>i</mi></msub></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mo stretchy="false">)</mo></mrow><mo>=</mo><mi mathvariant="normal">Var</mi><mrow><mo stretchy="false">(</mo><msub><mover accent="true"><mi>ฮด</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo stretchy="false">)</mo></mrow><mo>+</mo><mi mathvariant="normal">Var</mi><mrow><mo stretchy="false">(</mo><mover accent="true"><msub><mi>d</mi><mi>i</mi></msub><mo stretchy="false">~</mo></mover><mo stretchy="false">)</mo></mrow></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">16</td>
</tr></table>
<p>To calculate the first term on the right-hand side of (<a href="#Equ16" class="usa-link">16</a>), we note that <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq50"><math id="M132"><msub><mover accent="true"><mi>ฮด</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></math></span> is the Euclidean distance of the points (<em>x</em>,ย <em>y</em>) and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq51"><math id="M134"><mrow><mo stretchy="false">(</mo><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>,</mo><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo stretchy="false">)</mo></mrow></math></span> where <em>x</em> and <em>y</em> are deterministic variables and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq52"><math id="M136"><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></math></span> and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq53"><math id="M138"><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></math></span> are independent stochastic variables that have Gaussian distributions with means <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq54"><math id="M140"><msub><mi>x</mi><mi>i</mi></msub></math></span> and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq55"><math id="M142"><msub><mi>y</mi><mi>i</mi></msub></math></span>, respectively, and the same variance <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq56"><math id="M144"><msubsup><mi>ฯ</mi><mrow><msub><mi>a</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup></math></span>. Therefore, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq57"><math id="M146"><msub><mover accent="true"><mi>ฮด</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></math></span> has a Rice distribution [<a href="#CR54" class="usa-link" aria-describedby="CR54">54</a>] with the variance</p>
<table class="disp-formula p" id="Equ17"><tr>
<td class="formula"><math id="M148" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mi mathvariant="normal">Var</mi><mrow><mo stretchy="false">(</mo><msub><mover accent="true"><mi>ฮด</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo stretchy="false">)</mo></mrow><mo>=</mo><msubsup><mi>ฮด</mi><mi>i</mi><mn>2</mn></msubsup><mo>+</mo><mn>2</mn><msubsup><mi>ฯ</mi><mrow><msub><mi>a</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup><mo>-</mo><mfrac><mrow><mi>ฯ</mi><msubsup><mi>ฯ</mi><mrow><msub><mi>a</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup></mrow><mn>2</mn></mfrac><msubsup><mi>L</mi><mrow><mn>1</mn><mo stretchy="false">/</mo><mn>2</mn></mrow><mn>2</mn></msubsup><mfenced close=")" open="("><mo>-</mo><mfrac><msubsup><mi>ฮด</mi><mi>i</mi><mn>2</mn></msubsup><mrow><mn>2</mn><msubsup><mi>ฯ</mi><mrow><msub><mi>a</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup></mrow></mfrac></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">17</td>
</tr></table>
<p>where</p>
<table class="disp-formula p" id="Equ18"><tr>
<td class="formula"><math id="M150" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mi>ฮด</mi><mi>i</mi></msub><mo>=</mo><msqrt><mrow><msup><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><mi>x</mi><mo stretchy="false">)</mo></mrow><mn>2</mn></msup><mo>+</mo><msup><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><mi>y</mi><mo stretchy="false">)</mo></mrow><mn>2</mn></msup></mrow></msqrt></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">18</td>
</tr></table>
<p>and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq58"><math id="M152"><mrow><msub><mi>L</mi><mrow><mn>1</mn><mo stretchy="false">/</mo><mn>2</mn></mrow></msub><mrow><mo stretchy="false">(</mo><mo>.</mo><mo stretchy="false">)</mo></mrow></mrow></math></span> is a Laguerre polynomial expressed as</p>
<table class="disp-formula p" id="Equ19"><tr>
<td class="formula"><math id="M154" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mi>L</mi><mrow><mn>1</mn><mo stretchy="false">/</mo><mn>2</mn></mrow></msub><mrow><mo stretchy="false">(</mo><mi>z</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><mo>exp</mo><mfenced close=")" open="("><mi>z</mi><mo stretchy="false">/</mo><mn>2</mn></mfenced><mfenced close="]" open="["><mfenced close=")" open="("><mn>1</mn><mo>-</mo><mi>z</mi></mfenced><msub><mi>I</mi><mn>0</mn></msub><mfenced close=")" open="("><mo>-</mo><mfrac><mi>z</mi><mn>2</mn></mfrac></mfenced><mo>-</mo><mi>z</mi><msub><mi>I</mi><mn>1</mn></msub><mfenced close=")" open="("><mo>-</mo><mfrac><mi>z</mi><mn>2</mn></mfrac></mfenced></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">19</td>
</tr></table>
<p>with <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq59"><math id="M156"><mrow><msub><mi>I</mi><mn>0</mn></msub><mrow><mo stretchy="false">(</mo><mo>.</mo><mo stretchy="false">)</mo></mrow></mrow></math></span> and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq60"><math id="M158"><mrow><msub><mi>I</mi><mn>1</mn></msub><mrow><mo stretchy="false">(</mo><mo>.</mo><mo stretchy="false">)</mo></mrow></mrow></math></span> being the modified Bessel functions of the first kind with order zero and one, respectively. The Laguerre polynomial <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq61"><math id="M160"><mrow><msub><mi>L</mi><mi>n</mi></msub><mrow><mo stretchy="false">(</mo><mi>z</mi><mo stretchy="false">)</mo></mrow><mo>,</mo><mi>n</mi><mo>โฅ</mo><mn>0</mn></mrow></math></span>, is the solution of the following second-order linear differential Eq. [<a href="#CR55" class="usa-link" aria-describedby="CR55">55</a>, <a href="#CR56" class="usa-link" aria-describedby="CR56">56</a>]</p>
<table class="disp-formula p" id="Equ20"><tr>
<td class="formula"><math id="M162" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mi>z</mi><msup><mi>p</mi><mrow><mo>โฒ</mo><mo>โฒ</mo></mrow></msup><mrow><mo stretchy="false">(</mo><mi>z</mi><mo stretchy="false">)</mo></mrow><mo>+</mo><mrow><mo stretchy="false">(</mo><mn>1</mn><mo>-</mo><mi>z</mi><mo stretchy="false">)</mo></mrow><msup><mi>p</mi><mo>โฒ</mo></msup><mrow><mo stretchy="false">(</mo><mi>z</mi><mo stretchy="false">)</mo></mrow><mo>+</mo><mi>n</mi><mi>p</mi><mrow><mo stretchy="false">(</mo><mi>z</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><mn>0</mn><mo>.</mo></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">20</td>
</tr></table>
<p>Considering the assumption <em>A2</em>, the second term on the right-hand side of (<a href="#Equ16" class="usa-link">16</a>) is calculated as [<a href="#CR25" class="usa-link" aria-describedby="CR25">25</a>]</p>
<table class="disp-formula p" id="Equ21"><tr>
<td class="formula"><math id="M164" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mi mathvariant="normal">Var</mi><mrow><mo stretchy="false">(</mo><mover accent="true"><msub><mi>d</mi><mi>i</mi></msub><mo stretchy="false">~</mo></mover><mo stretchy="false">)</mo></mrow><mo>=</mo><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><mfenced close="]" open="["><mo>exp</mo><mfenced close=")" open="("><mrow><mn>2</mn><msubsup><mi>ฯ</mi><mrow><msub><mi>d</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup></mrow></mfenced><mo>-</mo><mo>exp</mo><mfenced close=")" open="("><msubsup><mi>ฯ</mi><mrow><msub><mi>d</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup></mfenced></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">21</td>
</tr></table>
<p>where</p>
<table class="disp-formula p" id="Equ22"><tr>
<td class="formula"><math id="M166" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mi>ฯ</mi><msub><mi>d</mi><mi>i</mi></msub></msub><mo>=</mo><mfrac><mrow><mo>ln</mo><mn>10</mn></mrow><mrow><mn>10</mn><mi>ฮท</mi></mrow></mfrac><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub><mo>.</mo></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">22</td>
</tr></table>
<p>We estimate the blind node position by minimizing the formulated cost function (<a href="#Equ15" class="usa-link">15</a>) in an iterative manner using the gradient-descent method. Since the unperturbed anchor positions <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq62"><math id="M168"><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>,</mo><msub><mi>y</mi><mi>i</mi></msub><mo stretchy="false">)</mo></mrow></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq63"><math id="M170"><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><mi>M</mi></mrow></math></span>, are unknown, we replace <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq64"><math id="M172"><msub><mi>ฮด</mi><mi>i</mi></msub></math></span> in (<a href="#Equ17" class="usa-link">17</a>) with its approximate value of</p>
<table class="disp-formula p" id="Equ23"><tr>
<td class="formula"><math id="M174" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msubsup><mover accent="true"><mrow><mi>ฮด</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mi>i</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup><mo>=</mo><msqrt><mrow><msup><mfenced close=")" open="("><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>-</mo><msubsup><mover accent="true"><mi>x</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mfenced><mn>2</mn></msup><mo>+</mo><msup><mfenced close=")" open="("><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>-</mo><msubsup><mover accent="true"><mi>y</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mfenced><mn>2</mn></msup></mrow></msqrt></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">23</td>
</tr></table>
<p>where <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq65"><math id="M176"><mfenced close=")" open="("><msubsup><mover accent="true"><mi>x</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup><mo>,</mo><msubsup><mover accent="true"><mi>y</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mfenced></math></span> is the most recent estimate of the blind node location. In addition, we replace the unknown values of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq66"><math id="M178"><msub><mi>d</mi><mi>i</mi></msub></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq67"><math id="M180"><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><mi>M</mi></mrow></math></span> in (<a href="#Equ21" class="usa-link">21</a>) with their available approximate values <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq68"><math id="M182"><msub><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq69"><math id="M184"><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><mi>M</mi></mrow></math></span>. Therefore, we calculate the gradients as</p>
<table class="disp-formula p" id="Equ24"><tr>
<td class="formula"><math id="M186" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><mi>โ</mi><mover accent="true"><mrow><mi>c</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover></mrow><mrow><mi>โ</mi><mi>x</mi></mrow></mfrac><msub><mrow><mo maxsize="1.623em" minsize="1.623em" stretchy="true">|</mo></mrow><mrow><mi>x</mi><mo>=</mo><msubsup><mover accent="true"><mi>x</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mrow></msub><mo>=</mo><mo>-</mo><mn>2</mn><munderover><mo>โ</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>M</mi></munderover><mfrac><mrow><mfenced close=")" open="("><msubsup><mover accent="true"><mrow><mi>ฮด</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mi>i</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup><mo>-</mo><msub><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></mfenced><mfenced close=")" open="("><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>-</mo><msubsup><mrow><mover accent="true"><mi>x</mi><mo stretchy="false">^</mo></mover></mrow><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mfenced></mrow><mrow><msubsup><mi>w</mi><mi>i</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup><msubsup><mover accent="true"><mrow><mi>ฮด</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mi>i</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mrow></mfrac></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">24</td>
</tr></table>
<p>and</p>
<table class="disp-formula p" id="Equ25"><tr>
<td class="formula"><math id="M188" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><mi>โ</mi><mover accent="true"><mrow><mi>c</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover></mrow><mrow><mi>โ</mi><mi>y</mi></mrow></mfrac><msub><mrow><mo maxsize="1.623em" minsize="1.623em" stretchy="true">|</mo></mrow><mrow><mi>y</mi><mo>=</mo><msubsup><mover accent="true"><mi>y</mi><mo stretchy="false">^</mo></mover><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mrow></msub><mo>=</mo><mo>-</mo><mn>2</mn><munderover><mo>โ</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>M</mi></munderover><mfrac><mrow><mfenced close=")" open="("><msubsup><mover accent="true"><mrow><mi>ฮด</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mi>i</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup><mo>-</mo><msub><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></mfenced><mfenced close=")" open="("><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>-</mo><msubsup><mrow><mover accent="true"><mi>y</mi><mo stretchy="false">^</mo></mover></mrow><mi>b</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mfenced></mrow><mrow><msubsup><mi>w</mi><mi>i</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup><msubsup><mover accent="true"><mrow><mi>ฮด</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mi>i</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mrow></mfrac></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">25</td>
</tr></table>
<p>where the weight <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq70"><math id="M190"><msubsup><mi>w</mi><mi>i</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></math></span> that is an estimate of the variance of the error due to the measurements related to the <em>i</em>th anchor node is calculated at the <em>k</em>th iteration as</p>
<table class="disp-formula p" id="Equ26"><tr>
<td class="formula"><math id="M192" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mtable><mtr><mtd columnalign="right"><msubsup><mi>w</mi><mi>i</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mtd><mtd columnalign="left"><mrow><mo>=</mo><msup><mfenced close=")" open="("><msubsup><mover accent="true"><mrow><mi>ฮด</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mi>i</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mfenced><mn>2</mn></msup><mo>+</mo><mn>2</mn><msubsup><mi>ฯ</mi><mrow><msub><mi>a</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup><mo>-</mo><mfrac><mrow><mi>ฯ</mi><msubsup><mi>ฯ</mi><mrow><msub><mi>a</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup></mrow><mn>2</mn></mfrac><msubsup><mi>L</mi><mrow><mn>1</mn><mo stretchy="false">/</mo><mn>2</mn></mrow><mn>2</mn></msubsup><mfenced close=")" open="("><mo>-</mo><mfrac><msup><mfenced close=")" open="("><msubsup><mover accent="true"><mrow><mi>ฮด</mi></mrow><mrow><mo stretchy="false">ยฏ</mo></mrow></mover><mi>i</mi><mrow><mo stretchy="false">(</mo><mi>k</mi><mo stretchy="false">)</mo></mrow></msubsup></mfenced><mn>2</mn></msup><mrow><mn>2</mn><msubsup><mi>ฯ</mi><mrow><msub><mi>a</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup></mrow></mfrac></mfenced></mrow></mtd></mtr><mtr><mtd columnalign="right"><mrow></mrow></mtd><mtd columnalign="left"><mrow><mo>+</mo><msubsup><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi><mn>2</mn></msubsup><mfenced close="]" open="["><mo>exp</mo><mfenced close=")" open="("><mrow><mn>2</mn><msubsup><mi>ฯ</mi><mrow><msub><mi>d</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup></mrow></mfenced><mo>-</mo><mo>exp</mo><mfenced close=")" open="("><msubsup><mi>ฯ</mi><mrow><msub><mi>d</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup></mfenced></mfenced></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">26</td>
</tr></table>
<section id="Sec5"><h3 class="pmc_sec_title">Computational Complexity</h3>
<p id="Par33">At each iteration, the proposed algorithm requires 16<em>M</em> multiplications and 4<em>M</em> divisions as well as <em>M</em> square-root and 4<em>M</em> exponentiation operations where <em>M</em> is the number of anchor nodes. Note that the required computations do not involve any complex number and are performed on real numbers. The required Bessel function values can be obtained using look-up tables, which only incur some extra storage requirement. Therefore, the proposed algorithm has a computational complexity of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq71"><math id="M194"><mrow><mtext>O</mtext><mrow><mo maxsize="1.2em" minsize="1.2em" stretchy="true">(</mo></mrow><mi>I</mi><mi>M</mi><mrow><mo maxsize="1.2em" minsize="1.2em" stretchy="true">)</mo></mrow></mrow></math></span> where <em>I</em> is the total number of iterations needed for convergence.</p></section></section><section id="Sec6"><h2 class="pmc_sec_title">Cramer-Rao Lower Bound</h2>
<p id="Par34">Given an observation vector <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq72"><math id="M196"><mi mathvariant="bold">w</mi></math></span> in relation to an unknown parameter vector <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq73"><math id="M198"><mrow><mi mathvariant="bold">ฮธ</mi></mrow></math></span>, the Cramer-Rao lower bound (CRLB) sets a lower bound on the covariance of any unbiased non-Bayesian estimator of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq74"><math id="M200"><mrow><mi mathvariant="bold">ฮธ</mi></mrow></math></span>. The CRLB is the inverse of the Fisher information matrix (FIM), denoted by <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq75"><math id="M202"><mrow><mi mathvariant="bold">F</mi><mo stretchy="false">(</mo><mrow><mi mathvariant="bold">ฮธ</mi></mrow><mo stretchy="false">)</mo></mrow></math></span>. Therefore, we have</p>
<table class="disp-formula p" id="Equ27"><tr>
<td class="formula"><math id="M204" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mi mathvariant="normal">cov</mi><mrow><mo stretchy="false">(</mo><mover accent="true"><mrow><mi mathvariant="bold">ฮธ</mi></mrow><mo stretchy="false">^</mo></mover><mo stretchy="false">)</mo></mrow><mo>โฅ</mo><msup><mrow><mi mathvariant="bold">F</mi></mrow><mrow><mo>-</mo><mn>1</mn></mrow></msup><mrow><mo stretchy="false">(</mo><mrow><mi mathvariant="bold">ฮธ</mi></mrow><mo stretchy="false">)</mo></mrow></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">27</td>
</tr></table>
<p>The FIM represents the information provided by the observation <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq76"><math id="M206"><mi mathvariant="bold">w</mi></math></span> about the unobserved parameter vector <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq77"><math id="M208"><mrow><mi mathvariant="bold">ฮธ</mi></mrow></math></span> and is calculated as</p>
<table class="disp-formula p" id="Equ28"><tr>
<td class="formula"><math id="M210" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mi mathvariant="bold">F</mi><mrow><mo stretchy="false">(</mo><mrow><mi mathvariant="bold">ฮธ</mi></mrow><mo stretchy="false">)</mo></mrow><mo>=</mo><mo>-</mo><mi mathvariant="double-struck">E</mi><mfenced close="]" open="["><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mi>l</mi><mrow><mo stretchy="false">(</mo><mrow><mi mathvariant="bold">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi><mo stretchy="false">)</mo></mrow></mrow><mrow><mi>โ</mi><mrow><mi mathvariant="bold">ฮธ</mi></mrow><mi>โ</mi><msup><mrow><mi mathvariant="bold">ฮธ</mi></mrow><mo>โบ</mo></msup></mrow></mfrac></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">28</td>
</tr></table>
<p>where <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq78"><math id="M212"><mrow><mi>l</mi><mo stretchy="false">(</mo><mrow><mi mathvariant="bold">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi><mo stretchy="false">)</mo></mrow></math></span> is the log-likelihood function of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq79"><math id="M214"><mrow><mi mathvariant="bold">ฮธ</mi></mrow></math></span> given <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq80"><math id="M216"><mi mathvariant="bold">w</mi></math></span>.</p>
<p id="Par35">In our self-localization problem, the observation vector <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq81"><math id="M218"><mi mathvariant="bold">w</mi></math></span> contains the perturbed anchor positions <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq82"><math id="M220"><mrow><mo stretchy="false">(</mo><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>,</mo><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo stretchy="false">)</mo></mrow></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq83"><math id="M222"><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><mi>M</mi></mrow></math></span>, and the perturbed RSSI measurements <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq84"><math id="M224"><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq85"><math id="M226"><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><mi>M</mi></mrow></math></span>. Therefore, it can be written as</p>
<table class="disp-formula p" id="Equ29"><tr>
<td class="formula"><math id="M228" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mi mathvariant="bold">w</mi><mo>=</mo><msup><mfenced close="]" open="["><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mn>1</mn></msub><mo>,</mo><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mn>1</mn></msub><mo>,</mo><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mn>1</mn></msub><mo>,</mo><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mn>2</mn></msub><mo>,</mo><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mn>2</mn></msub><mo>,</mo><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mn>2</mn></msub><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mi>M</mi></msub><mo>,</mo><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>M</mi></msub><mo>,</mo><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>M</mi></msub></mfenced><mo>โบ</mo></msup></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">29</td>
</tr></table>
<p>Given (<a href="#Equ4" class="usa-link">4</a><a href="#Equ5" class="usa-link">5</a>) and (<a href="#Equ6" class="usa-link">6</a>), the probability density function (pdf) of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq86"><math id="M230"><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></math></span> is expressed as [<a href="#CR23" class="usa-link" aria-describedby="CR23">23</a>]</p>
<table class="disp-formula p" id="Equ30"><tr>
<td class="formula"><math id="M232" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mi>f</mi><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></msub><mfenced close=")" open="("><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></mfenced><mo>=</mo><mfrac><mrow><mn>10</mn><mo stretchy="false">/</mo><mo>ln</mo><mn>10</mn></mrow><mrow><msqrt><mrow><mn>2</mn><mi>ฯ</mi><msubsup><mi>ฯ</mi><mrow><msub><mi>p</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup></mrow></msqrt><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></mrow></mfrac><mo>exp</mo><mfenced close="]" open="["><mo>-</mo><mfrac><msub><mi>b</mi><mi>i</mi></msub><mn>8</mn></mfrac><msup><mfenced close=")" open="("><mo>ln</mo><mfrac><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><msubsup><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi><mn>2</mn></msubsup></mfrac></mfenced><mn>2</mn></msup></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">30</td>
</tr></table>
<p>where</p>
<table class="disp-formula p" id="Equ31"><tr>
<td class="formula"><math id="M234" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mi>b</mi><mi>i</mi></msub><mo>=</mo><msup><mfenced close=")" open="("><mfrac><mrow><mn>10</mn><mi>ฮท</mi></mrow><mrow><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub><mo>ln</mo><mn>10</mn></mrow></mfrac></mfenced><mn>2</mn></msup></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">31</td>
</tr></table>
<p>Our unknown parameters of interest are the position coordinates of the blind node <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq87"><math id="M236"><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>b</mi></msub><mo>,</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow></math></span>. However, since the RSSI values are functions of the unknown unperturbed anchor positions, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq88"><math id="M238"><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>,</mo><msub><mi>y</mi><mi>i</mi></msub><mo stretchy="false">)</mo></mrow></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq89"><math id="M240"><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><mi>M</mi></mrow></math></span>, we include the unperturbed anchor positions as the nuisance parameters. Hence, the unknown parameter vector <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq90"><math id="M242"><mrow><mi mathvariant="bold">ฮธ</mi></mrow></math></span> is</p>
<table class="disp-formula p" id="Equ32"><tr>
<td class="formula"><math id="M244" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mrow><mi mathvariant="bold">ฮธ</mi></mrow><mo>=</mo><msup><mfenced close="]" open="["><msub><mi>x</mi><mi>b</mi></msub><mo>,</mo><msub><mi>y</mi><mi>b</mi></msub><mo>,</mo><msub><mi>x</mi><mn>1</mn></msub><mo>,</mo><msub><mi>y</mi><mn>1</mn></msub><mo>,</mo><msub><mi>x</mi><mn>2</mn></msub><mo>,</mo><msub><mi>y</mi><mn>2</mn></msub><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><msub><mi>x</mi><mi>M</mi></msub><mo>,</mo><msub><mi>y</mi><mi>M</mi></msub></mfenced><mo>โบ</mo></msup></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">32</td>
</tr></table>
<p>The perturbed anchor node positions <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq91"><math id="M246"><mrow><mo stretchy="false">(</mo><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>,</mo><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo stretchy="false">)</mo></mrow></math></span>, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq92"><math id="M248"><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><mi>M</mi></mrow></math></span>, are statistically independent of each other as well as the RSSI values. Therefore, the log-likelihood function can be written as</p>
<table class="disp-formula p" id="Equ33"><tr>
<td class="formula"><math id="M250" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><munderover><mo>โ</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>M</mi></munderover><mo>ln</mo><msub><mi>f</mi><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></msub><mfenced close=")" open="("><msub><mover accent="true"><mi>p</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>โฃ</mo><msub><mi>x</mi><mi>b</mi></msub><mo>,</mo><msub><mi>y</mi><mi>b</mi></msub><mo>,</mo><msub><mi>x</mi><mi>i</mi></msub><mo>,</mo><msub><mi>y</mi><mi>i</mi></msub></mfenced></mrow></mtd></mtr><mtr><mtd columnalign="right"><mrow></mrow></mtd><mtd columnalign="left"><mrow><mo>+</mo><munderover><mo>โ</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>M</mi></munderover><mo>ln</mo><msub><mi>f</mi><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></msub><mfenced close=")" open="("><msub><mover accent="true"><mi>x</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>โฃ</mo><msub><mi>x</mi><mi>i</mi></msub></mfenced><mo>+</mo><munderover><mo>โ</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>M</mi></munderover><mo>ln</mo><msub><mi>f</mi><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub></msub><mfenced close=")" open="("><msub><mover accent="true"><mi>y</mi><mo stretchy="false">~</mo></mover><mi>i</mi></msub><mo>โฃ</mo><msub><mi>y</mi><mi>i</mi></msub></mfenced></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">33</td>
</tr></table>
<p>We derive the second-order partial derivatives of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq93"><math id="M252"><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></math></span> with respective to the entries of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq94"><math id="M254"><mrow><mi mathvariant="bold">ฮธ</mi></mrow></math></span>, required for the calculation of the FIM, in the "<a href="#Sec12" class="usa-link">Appendix</a>". Using [<a href="#CR23" class="usa-link" aria-describedby="CR23">23</a>]</p>
<table class="disp-formula p" id="Equ34"><tr>
<td class="formula"><math id="M256" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mi mathvariant="double-struck">E</mi><mfenced close="]" open="["><mo>ln</mo><mfenced close=")" open="("><mfrac><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><msubsup><mrow><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover></mrow><mi>i</mi><mn>2</mn></msubsup></mfrac></mfenced></mfenced><mo>=</mo><mn>0</mn></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">34</td>
</tr></table>
<p>together with the results in the "<a href="#Sec12" class="usa-link">Appendix</a>", we can express the FIM as</p>
<table class="disp-formula p" id="Equ35"><tr>
<td class="formula"><math id="M258" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mi mathvariant="bold">F</mi><mrow><mo stretchy="false">(</mo><mrow><mi mathvariant="bold">ฮธ</mi></mrow><mo stretchy="false">)</mo></mrow><mo>=</mo><mfenced close="]" open="["><mrow><mtable><mtr><mtd><msub><mi mathvariant="bold">F</mi><mn>11</mn></msub></mtd><mtd><mrow><mrow></mrow><msub><mi mathvariant="bold">F</mi><mn>12</mn></msub></mrow></mtd></mtr><mtr><mtd><mrow><mrow></mrow><msubsup><mi mathvariant="bold">F</mi><mrow><mn>12</mn></mrow><mo>โบ</mo></msubsup></mrow></mtd><mtd><mrow><mrow></mrow><msub><mi mathvariant="bold">F</mi><mn>22</mn></msub></mrow></mtd></mtr></mtable></mrow></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">35</td>
</tr></table>
<p>where</p>
<table class="disp-formula p" id="Equ36"><tr>
<td class="formula"><math id="M260" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mi mathvariant="bold">F</mi><mn>11</mn></msub><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><munderover><mo>โ</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>M</mi></munderover><mfrac><msub><mi>b</mi><mi>i</mi></msub><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><msub><mi mathvariant="bold">H</mi><mi>i</mi></msub><mo>,</mo></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">36</td>
</tr></table>
<table class="disp-formula p" id="Equ37"><tr>
<td class="formula"><math id="M262" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msub><mi mathvariant="bold">F</mi><mn>12</mn></msub><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><mo>-</mo><mfenced close="]" open="["><mrow><mtable><mtr><mtd><mrow><mfrac><msub><mi>b</mi><mn>1</mn></msub><msubsup><mi>d</mi><mn>1</mn><mn>4</mn></msubsup></mfrac><msub><mi mathvariant="bold">H</mi><mn>1</mn></msub><mo>,</mo><mo>โฏ</mo><mo>,</mo><mfrac><msub><mi>b</mi><mi>M</mi></msub><msubsup><mi>d</mi><mi>M</mi><mn>4</mn></msubsup></mfrac><msub><mi mathvariant="bold">H</mi><mi>M</mi></msub></mrow></mtd></mtr></mtable></mrow></mfenced><mo>,</mo></mrow></mtd></mtr><mtr><mtd columnalign="right"><mrow><mrow></mrow><msub><mi mathvariant="bold">F</mi><mn>22</mn></msub><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><mi mathvariant="normal">blockdiag</mi><mfenced close="}" open="{"><mfrac><msub><mi>b</mi><mn>1</mn></msub><msubsup><mi>d</mi><mn>1</mn><mn>4</mn></msubsup></mfrac><msub><mi mathvariant="bold">H</mi><mn>1</mn></msub><mo>+</mo><mfrac><mn>1</mn><msubsup><mi>ฯ</mi><mrow><msub><mi>a</mi><mn>1</mn></msub></mrow><mn>2</mn></msubsup></mfrac><msub><mi mathvariant="bold">I</mi><mn>2</mn></msub><mo>,</mo><mo>โฏ</mo><mo>,</mo><mfrac><msub><mi>b</mi><mi>M</mi></msub><msubsup><mi>d</mi><mi>M</mi><mn>4</mn></msubsup></mfrac><msub><mi mathvariant="bold">H</mi><mi>M</mi></msub><mo>+</mo><mfrac><mn>1</mn><msubsup><mi>ฯ</mi><mrow><msub><mi>a</mi><mi>M</mi></msub></mrow><mn>2</mn></msubsup></mfrac><msub><mi mathvariant="bold">I</mi><mn>2</mn></msub></mfenced><mo>,</mo></mrow></mtd></mtr><mtr><mtd columnalign="right"><mrow><mrow></mrow><msub><mi mathvariant="bold">H</mi><mi>i</mi></msub><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><mfenced close="]" open="["><mrow><mtable><mtr><mtd><msup><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup></mtd><mtd><mrow><mrow></mrow><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow></mrow></mtd></mtr><mtr><mtd><mrow><mrow></mrow><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow></mrow></mtd><mtd><mrow><mrow></mrow><msup><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup></mrow></mtd></mtr></mtable></mrow></mfenced><mo>,</mo></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">37</td>
</tr></table>
<p>and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq95"><math id="M264"><msub><mi mathvariant="bold">I</mi><mn>2</mn></msub></math></span> is the <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq96"><math id="M266"><mrow><mn>2</mn><mo>ร</mo><mn>2</mn></mrow></math></span> identity matrix. Consequently, we obtain a lower bound on the localization root-mean-square error (RMSE) of any unbiased estimator of the blind node location as below</p>
<table class="disp-formula p" id="Equ49"><tr><td class="formula"><math id="M268" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><msqrt><mrow><mi mathvariant="double-struck">E</mi><mfenced close="]" open="["><msup><mfenced close=")" open="("><msub><mover accent="true"><mi>x</mi><mo stretchy="false">^</mo></mover><mi>b</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub></mfenced><mn>2</mn></msup><mo>+</mo><msup><mfenced close=")" open="("><msub><mover accent="true"><mi>y</mi><mo stretchy="false">^</mo></mover><mi>b</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub></mfenced><mn>2</mn></msup></mfenced></mrow></msqrt><mo>โฅ</mo><msqrt><mrow><mi mathvariant="normal">tr</mi><mfenced close="}" open="{"><msup><mfenced close=")" open="("><msub><mi mathvariant="bold">F</mi><mn>11</mn></msub><mo>-</mo><msub><mi mathvariant="bold">F</mi><mn>12</mn></msub><msubsup><mi mathvariant="bold">F</mi><mrow><mn>22</mn></mrow><mrow><mo>-</mo><mn>1</mn></mrow></msubsup><msubsup><mi mathvariant="bold">F</mi><mrow><mn>12</mn></mrow><mo>โบ</mo></msubsup></mfenced><mrow><mo>-</mo><mn>1</mn></mrow></msup></mfenced></mrow></msqrt></mrow></mtd></mtr></mtable></mrow></math></td></tr></table></section><section id="Sec7"><h2 class="pmc_sec_title">Performance Evaluation</h2>
<p id="Par36">This section is focused on performance evaluation of the proposed algorithm. We first describe the algorithm in comparison followed by the results of some experiments performed to find the minimum number of anchor nodes required to obtain a satisfactory localization accuracy in the presence of perturbations. Then, we describe the simulation setup and different scenarios simulated to evaluate the performance. Lastly, we present the simulation results and our key observations.</p>
<section id="Sec8"><h3 class="pmc_sec_title">Algorithm in Comparison</h3>
<p id="Par37">The performance of the purposed algorithm is compared with the weighted circular algorithm proposed in [<a href="#CR25" class="usa-link" aria-describedby="CR25">25</a>]. Similar to our assumptions, the authors of [<a href="#CR25" class="usa-link" aria-describedby="CR25">25</a>] assume the presence of log-normally distributed perturbations in the RSSI-induced distance estimates. However, they assume the availability of noise-free anchor position information. They also rely on minimizing a weighted sum-square-distance-error cost function in an iterative fashion using the gradient-descent method. However, their weight calculation only considers the perturbations in the RSSI measurements. The high level of similarity in assumptions and approach to solve the problem in hand makes the algorithm proposed in [<a href="#CR25" class="usa-link" aria-describedby="CR25">25</a>] a suitable candidate for algorithm in comparison. Moreover, to the best of our knowledge it is the only relevant algorithm in the literature that has a computational complexity comparable to that of the proposed algorithm.</p></section><section id="Sec9"><h3 class="pmc_sec_title">Cramer-Rao Lower Bound Experimental Insights</h3>
<p id="Par38">The number of anchor nodes required to perform self-localization by a blind node in a group of resource-constrained nodes is an important factor for determining the usefulness of any localization algorithm. This is because the anchor nodes may also be resource-constrained in nature and frequent use of their positioning sensors, such as the GNSS receiver, will drain the battery quickly. This defeats the major purpose of energy-efficient self-localization for resource-constrained devices.</p>
<p id="Par39">In a perturbation-free environment, we require at least three anchor nodes to localize a blind node in 2D. However, three anchor nodes may not be sufficient to achieve the required level of accuracy in the presence of perturbations. Therefore, we perform some experiments to find the minimum number of nodes required to achieve a reasonable localization accuracy in the presence of perturbations in both anchor positions and RSSI measurements.</p>
<p id="Par40">In the first experiment, we simulate a scenario in which initially only three anchor nodes and one blind node are present in a <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq97"><math id="M270"><mrow><mn>35</mn><mtext>m</mtext><mo>ร</mo><mn>35</mn><mtext>m</mtext></mrow></math></span> region. The three sub-figures in Fig. <a href="#Fig2" class="usa-link">2</a>a show three different node placement arrangements selected for evaluation. The three anchor nodes and one blind node used in this experiment are labelled as โanchor 1-3โ and โblind nodeโ, respectively. For now, let us ignore the anchor nodes labeled as โanchor 4-6โ and โanchor 7-12โ. We consider the standard deviation of the perturbation in the anchor position <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq98"><math id="M272"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> to be equal to 1m, 3m, and 5m. We vary the standard deviation of the RSSI perturbations <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq99"><math id="M274"><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub></math></span> between 1dB and 10dB. We evaluate the CRLB for two different perturbation scenarios, i.e., when the perturbations are only present in the RSSI measurements and when the perturbations are present in both RSSI measurements and anchor position information. For the former, we use the CRLB derived in [<a href="#CR23" class="usa-link" aria-describedby="CR23">23</a>] and label the results as โCRLB-R-1,3,5mโ. For the latter, we use the CRLB derived in Section <a href="#Sec6" class="usa-link">5</a> while โCRLB-RP-1mโ, โCRLB-RP-3mโ, and โCRLB-RP-5mโ represent the results when <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq100"><math id="M276"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> is equal to 1m, 3m, and 5m, respectively.</p>
<figure class="fig xbox font-sm" id="Fig2"><h4 class="obj_head">Fig. 2.</h4>
<p class="img-box line-height-none margin-x-neg-2 tablet:margin-x-0 text-center"><a class="tileshop" target="_blank" href="https://www.ncbi.nlm.nih.gov/core/lw/2.0/html/tileshop_pmc/tileshop_pmc_inline.html?title=Click%20on%20image%20to%20zoom&p=PMC3&id=8636071_11277_2021_9423_Fig2_HTML.jpg"><img class="graphic zoom-in" src="https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0617/8636071/266058402eff/11277_2021_9423_Fig2_HTML.jpg" loading="lazy" id="MO40" height="830" width="709" alt="Fig. 2"></a></p>
<div class="p text-right font-secondary"><a href="figure/Fig2/" class="usa-link" target="_blank" rel="noopener noreferrer">Open in a new tab</a></div>
<figcaption><p>(<strong>a</strong>) Three stages of the network used in three experiments with a fixed blind node position (the green dot). The first experiment consists of three anchors represented by squares, the triangles represent the added three anchors in the second experiment, and the stars represent the six anchors added in the third experiment; (<strong>b</strong>) the CRLB of localization RMSE of the network simulated in the first experiment; (<strong>c</strong>) the CRLB of localization RMSE of the network simulated in the second experiment; (<strong>d</strong>) the CRLB of localization RMSE of the network simulated in the third experiment</p></figcaption></figure><p id="Par41">The three sub-figures of Fig. <a href="#Fig2" class="usa-link">2</a>b present the results for the three corresponding node placements given in Fig. <a href="#Fig2" class="usa-link">2</a>a. The following observations are made from Fig. <a href="#Fig2" class="usa-link">2</a>b:</p>
<ul class="list" style="list-style-type:disc">
<li><p id="Par42">As expected โCRLB-R-1,3,5mโ do not vary with the level of perturbation in the anchor position information.</p></li>
<li><p id="Par43">The presence of perturbation in anchor position information as <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq101"><math id="M278"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>1</mn><mtext>m</mtext></mrow></math></span> represented by โCRLB-RP-1mโ does not increase the CRLB noticeably compared to โCRLB-R-1,3,5mโ. This is possibly due to the perturbation in RSSI dominating the localization accuracy. Hence, both algorithms (proposed and the algorithm in comparison) perform similarly in such perturbation scenarios.</p></li>
<li><p id="Par44">For <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq102"><math id="M280"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> being equal to 3m and 5m, the CRLB rises to 25m, which is considerably high for any practical purpose. Hence, we conclude that three anchor nodes are not sufficient to have a reasonably good localization estimate in the presence of perturbations.</p></li>
</ul>
<p>In the second experiment, we keep everything the same as the previous experiment except for adding three more anchor nodes to the scenario. The newly added anchor nodes in this experiment are shown as โanchor 4โ6โ in <a href="#Fig2" class="usa-link">2</a>a. Let us ignore the anchor nodes labeled as โanchor 7โ12โ for now. Therefore, in this experiment, the blind node receives the RSSI and anchor position information from six anchor nodes compared to three in the first experiment. The three sub-figures of Fig. <a href="#Fig2" class="usa-link">2</a>c present the results for the corresponding three node placements shown in Fig. <a href="#Fig2" class="usa-link">2</a>a. The following observations are made from Fig. <a href="#Fig2" class="usa-link">2</a>c:</p>
<ul class="list" style="list-style-type:disc">
<li><p id="Par45">The addition of three anchor nodes reduces the CRLB drastically compared to the CRLB values in <a href="#Fig2" class="usa-link">2</a>b.</p></li>
<li><p id="Par46">The upper limit of the CRLB in all the three sub-figures is only around 10m.</p></li>
</ul>
<p>In the third experiment, we keep everything the same as the second experiment except for adding six more anchor nodes to the scenario. Therefore, the blind node receives the RSSI and anchor position information from twelve anchor nodes compared to six in the second experiment. The anchor nodes added in this experiment are labeled as โanchor 7-12โ). The three sub-figures of Fig. <a href="#Fig2" class="usa-link">2</a>d present the results for the corresponding three node placements shown in Fig. <a href="#Fig2" class="usa-link">2</a>a. The following observations are made from Fig. <a href="#Fig2" class="usa-link">2</a>d:</p>
<ul class="list" style="list-style-type:disc">
<li><p id="Par47">The CRLB using twelve nodes is considerably low compared to using three anchor nodes.</p></li>
<li><p id="Par48">The CRLB gap using six and twelve anchor nodes has a maximum value around 20% in all the cases, whereas from an energy consumption perspective, the latter case requires about twice the energy. A similar observation of insignificant performance improvement by adding more anchor nodes has been made in [<a href="#CR26" class="usa-link" aria-describedby="CR26">26</a>].</p></li>
</ul>
<p>In light of the above observations, we use six anchor nodes in all our experiments, described in the next section, to evaluate the performance of the proposed algorithm.</p></section><section id="Sec10"><h3 class="pmc_sec_title">Simulation Details and Results</h3>
<p id="Par49">We simulate a scenario where six anchor nodes and one blind node are present in a <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq123"><math id="M322"><mrow><mn>35</mn><mtext>m</mtext><mo>ร</mo><mn>35</mn><mtext>m</mtext></mrow></math></span> area. We vary the RSSI measurement errors, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq124"><math id="M324"><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub></math></span>, ranging from 0dBm to 5dBm in all the simulations. We use <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq125"><math id="M326"><mrow><msub><mi>d</mi><mn>0</mn></msub><mo>=</mo><mn>1</mn></mrow></math></span>m, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq126"><math id="M328"><mrow><msub><mi>p</mi><mrow><mn>0</mn><mo stretchy="false">(</mo><mtext>dBm</mtext><mo stretchy="false">)</mo></mrow></msub><mo>=</mo><mo>-</mo><mn>33.44</mn></mrow></math></span>, and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq127"><math id="M330"><mrow><mi>ฮท</mi><mo>=</mo><mn>3.567</mn></mrow></math></span> in our simulations, which are based on the results reported in [<a href="#CR57" class="usa-link" aria-describedby="CR57">57</a>]. We tune the step-size parameter of the gradient-descent algorithm to obtain convergence within 300 iterations. We use the same step-size and maximum number of iterations in the implementation of both algorithms.</p>
<p id="Par50">We use the root mean square error (RMSE) as the performance criterion. The results presented are averaged over 1000 independent trials for each simulation. We also compare our results to the CRLB values, when appropriate, as the estimates of both algorithms may have bias in some scenarios due to the nature of the perturbations. We perform multiple simulations varying the anchor position errors <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq128"><math id="M332"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> and the arrangement of the nodes to evaluate the proposed algorithm as described next.</p>
<p id="Par51">First, we simulate a scenario in which the position error, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq129"><math id="M334"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span>, is the same for all anchor nodes. Figure <a href="#Fig3" class="usa-link">3</a> shows the results for <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq130"><math id="M336"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> being equal to 1, 3 and 5m in an arbitrary node arrangement as in Fig. <a href="#Fig3" class="usa-link">3</a>a. The performance of the proposed algorithm is comparable to that of the existing algorithm for low perturbation levels the in anchor position information, i.e., <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq131"><math id="M338"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> being 1 or 3m. However, for <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq132"><math id="M340"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>5</mn></mrow></math></span>m, the proposed algorithm performed considerably better than the existing algorithm when the perturbation level in the RSSI measurements is moderate, i.e., when <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq133"><math id="M342"><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub></math></span> is in the range of 1dBm to 3dBm. Note that the CRLB values in Fig. <a href="#Fig3" class="usa-link">3</a>d for <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq134"><math id="M344"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>5</mn></mrow></math></span>m are higher than the corresponding RMSE values in Fig. <a href="#Fig3" class="usa-link">3</a>c. This can be justified considering the fact that the estimates produced by both proposed and existing algorithms may be biased. We make a similar observation for another arbitrary node arrangement given in Fig. <a href="#Fig4" class="usa-link">4</a>a.</p>
<figure class="fig xbox font-sm" id="Fig3"><h4 class="obj_head">Fig. 3.</h4>
<p class="img-box line-height-none margin-x-neg-2 tablet:margin-x-0 text-center"><a class="tileshop" target="_blank" href="https://www.ncbi.nlm.nih.gov/core/lw/2.0/html/tileshop_pmc/tileshop_pmc_inline.html?title=Click%20on%20image%20to%20zoom&p=PMC3&id=8636071_11277_2021_9423_Fig3_HTML.jpg"><img class="graphic zoom-in" src="https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0617/8636071/de86b3250376/11277_2021_9423_Fig3_HTML.jpg" loading="lazy" id="MO41" height="208" width="709" alt="Fig. 3"></a></p>
<div class="p text-right font-secondary"><a href="figure/Fig3/" class="usa-link" target="_blank" rel="noopener noreferrer">Open in a new tab</a></div>
<figcaption><p>Homogeneous <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq103"><math id="M282"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> and fixed nodes; (<strong>a</strong>) the network topology: the stars are the anchor nodes, the circle is the true position of the blind node, the triangle is the initial estimate for the blind node position; (<strong>b</strong>) the RMSE of the existing algorithm for different values of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq104"><math id="M284"><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub></math></span> and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq105"><math id="M286"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span>; (<strong>c</strong>) the RMSE of the proposed algorithm for different values of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq106"><math id="M288"><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub></math></span> and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq107"><math id="M290"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span>; (<strong>d</strong>) the corresponding CRLB values</p></figcaption></figure><figure class="fig xbox font-sm" id="Fig4"><h4 class="obj_head">Fig. 4.</h4>
<p class="img-box line-height-none margin-x-neg-2 tablet:margin-x-0 text-center"><a class="tileshop" target="_blank" href="https://www.ncbi.nlm.nih.gov/core/lw/2.0/html/tileshop_pmc/tileshop_pmc_inline.html?title=Click%20on%20image%20to%20zoom&p=PMC3&id=8636071_11277_2021_9423_Fig4_HTML.jpg"><img class="graphic zoom-in" src="https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0617/8636071/707d1c8c5994/11277_2021_9423_Fig4_HTML.jpg" loading="lazy" id="MO42" height="208" width="705" alt="Fig. 4"></a></p>
<div class="p text-right font-secondary"><a href="figure/Fig4/" class="usa-link" target="_blank" rel="noopener noreferrer">Open in a new tab</a></div>
<figcaption><p>Homogeneous <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq108"><math id="M292"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> and fixed nodes; (<strong>a</strong>) the network topology: the stars are the anchor nodes, the circle is the true position of the blind node, the triangle is the initial estimate for the blind node position; (<strong>b</strong>) the RMSE of the existing algorithm for different values of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq109"><math id="M294"><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub></math></span> and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq110"><math id="M296"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span>; (<strong>c</strong>) the RMSE of the proposed algorithm for different values of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq111"><math id="M298"><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub></math></span> and <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq112"><math id="M300"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span>; (<strong>d</strong>) the corresponding CRLB values</p></figcaption></figure><p id="Par52">In practise, different anchor nodes may have different values of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq135"><math id="M346"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> based on the quality of their GNSS receivers or their location affecting the number of visible satellites at the time of positioning. Hence, we simulate a scenario in which half of the anchor nodes have one value for <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq136"><math id="M348"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> and the other half have another value for <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq137"><math id="M350"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span>. The evaluation results of this scenario for two arbitrarily selected node arrangements are presented in Figs. <a href="#Fig5" class="usa-link">5</a> and <a href="#Fig6" class="usa-link">6</a>. In this scenario, the proposed algorithm results in significantly (up to 30%) lower values of RMSE compared to the existing algorithm. The error profile of the proposed algorithm is also better than that of the existing algorithm as shown in Figs. <a href="#Fig5" class="usa-link">5</a>c and <a href="#Fig6" class="usa-link">6</a>c.</p>
<figure class="fig xbox font-sm" id="Fig5"><h4 class="obj_head">Fig. 5.</h4>
<p class="img-box line-height-none margin-x-neg-2 tablet:margin-x-0 text-center"><a class="tileshop" target="_blank" href="https://www.ncbi.nlm.nih.gov/core/lw/2.0/html/tileshop_pmc/tileshop_pmc_inline.html?title=Click%20on%20image%20to%20zoom&p=PMC3&id=8636071_11277_2021_9423_Fig5_HTML.jpg"><img class="graphic zoom-in" src="https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0617/8636071/60bf263db97d/11277_2021_9423_Fig5_HTML.jpg" loading="lazy" id="MO43" height="247" width="709" alt="Fig. 5"></a></p>
<div class="p text-right font-secondary"><a href="figure/Fig5/" class="usa-link" target="_blank" rel="noopener noreferrer">Open in a new tab</a></div>
<figcaption><p>Heterogeneous <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq113"><math id="M302"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> and fixed nodes; (<strong>a</strong>) the network topology: the stars are the anchor nodes with <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq114"><math id="M304"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>6</mn></mrow></math></span>m, the squares are the anchor nodes with <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq115"><math id="M306"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>3</mn></mrow></math></span>m, the circle is the true position of the blind node, the triangle is the initial estimate for the blind node position; (<strong>b</strong>) the RMSE of the proposed and existing algorithms as well as the corresponding CRLB for different values of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq116"><math id="M308"><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub></math></span>; (<strong>c</strong>) the localization error histograms of the proposed and existing algorithms when <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq117"><math id="M310"><mrow><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub><mo>=</mo><mn>2</mn></mrow></math></span>dBm</p></figcaption></figure><figure class="fig xbox font-sm" id="Fig6"><h4 class="obj_head">Fig. 6.</h4>
<p class="img-box line-height-none margin-x-neg-2 tablet:margin-x-0 text-center"><a class="tileshop" target="_blank" href="https://www.ncbi.nlm.nih.gov/core/lw/2.0/html/tileshop_pmc/tileshop_pmc_inline.html?title=Click%20on%20image%20to%20zoom&p=PMC3&id=8636071_11277_2021_9423_Fig6_HTML.jpg"><img class="graphic zoom-in" src="https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0617/8636071/eabd17e804a8/11277_2021_9423_Fig6_HTML.jpg" loading="lazy" id="MO44" height="247" width="709" alt="Fig. 6"></a></p>
<div class="p text-right font-secondary"><a href="figure/Fig6/" class="usa-link" target="_blank" rel="noopener noreferrer">Open in a new tab</a></div>
<figcaption><p>Heterogeneous <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq118"><math id="M312"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> and fixed nodes; (<strong>a</strong>) the network topology: the stars are the anchor nodes with <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq119"><math id="M314"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>4</mn></mrow></math></span>m, the squares are the anchor nodes with <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq120"><math id="M316"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>2</mn></mrow></math></span>m, the circle is the true position of the blind node, the triangle is the initial estimate for the blind node position; (<strong>b</strong>) the RMSE of the proposed and existing algorithms as well as the corresponding CRLB for different values of <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq121"><math id="M318"><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub></math></span>; (<strong>c</strong>) the localization error histograms of the proposed and existing algorithms when <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq122"><math id="M320"><mrow><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub><mo>=</mo><mn>2</mn></mrow></math></span>dBm</p></figcaption></figure><p id="Par53">It is known that the performance of the RSSI-based localization highly depends on the network geometry [<a href="#CR49" class="usa-link" aria-describedby="CR49">49</a>, <a href="#CR58" class="usa-link" aria-describedby="CR58">58</a>]. To generalise the applicability of the evaluation results to a wider range of physical node arrangements, we simulate a scenario in which we assign an independent region for the physical location of the anchor nodes, the true position of the blind node, and the initial estimate of the blind node position. This means that in each simulation run (total 1000 runs), the physical node arrangement and the initial estimate of the blind node position change while they were fixed in the previous simulations.</p>
<p id="Par54">Same as earlier, we first simulate a scenario in which all the anchor nodes have the same value for their position error <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq148"><math id="M372"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span>. The two considered arbitrary region-based node arrangements are shown in Figs. <a href="#Fig7" class="usa-link">7</a>a and <a href="#Fig8" class="usa-link">8</a>a. In the former arrangement, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq149"><math id="M374"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> is 5m for all anchor nodes and in the latter one, <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq150"><math id="M376"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> is 3m. The superior performance of the proposed algorithm in terms of lower RMSE is noticeable in both considered arrangements.</p>
<figure class="fig xbox font-sm" id="Fig7"><h4 class="obj_head">Fig. 7.</h4>
<p class="img-box line-height-none margin-x-neg-2 tablet:margin-x-0 text-center"><a class="tileshop" target="_blank" href="https://www.ncbi.nlm.nih.gov/core/lw/2.0/html/tileshop_pmc/tileshop_pmc_inline.html?title=Click%20on%20image%20to%20zoom&p=PMC3&id=8636071_11277_2021_9423_Fig7_HTML.jpg"><img class="graphic zoom-in" src="https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0617/8636071/d8bfc9902f6f/11277_2021_9423_Fig7_HTML.jpg" loading="lazy" id="MO45" height="247" width="709" alt="Fig. 7"></a></p>
<div class="p text-right font-secondary"><a href="figure/Fig7/" class="usa-link" target="_blank" rel="noopener noreferrer">Open in a new tab</a></div>
<figcaption><p>Homogeneous <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq138"><math id="M352"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> and region-based random node placement; (<strong>a</strong>) the network topology: the grey rectangles contain the anchor nodes with <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq139"><math id="M354"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>5</mn></mrow></math></span>m, the green rectangle contains the true position of the blind node, the yellow rectangle contains the initial estimate for the blind node position; (<strong>b</strong>) the RMSE of the proposed and existing algorithms; (<strong>c</strong>) the localization error histograms of the proposed and existing algorithms when <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq140"><math id="M356"><mrow><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub><mo>=</mo><mn>3</mn></mrow></math></span>dBm</p></figcaption></figure><figure class="fig xbox font-sm" id="Fig8"><h4 class="obj_head">Fig. 8.</h4>
<p class="img-box line-height-none margin-x-neg-2 tablet:margin-x-0 text-center"><a class="tileshop" target="_blank" href="https://www.ncbi.nlm.nih.gov/core/lw/2.0/html/tileshop_pmc/tileshop_pmc_inline.html?title=Click%20on%20image%20to%20zoom&p=PMC3&id=8636071_11277_2021_9423_Fig8_HTML.jpg"><img class="graphic zoom-in" src="https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0617/8636071/7d05b23aaa38/11277_2021_9423_Fig8_HTML.jpg" loading="lazy" id="MO46" height="251" width="709" alt="Fig. 8"></a></p>
<div class="p text-right font-secondary"><a href="figure/Fig8/" class="usa-link" target="_blank" rel="noopener noreferrer">Open in a new tab</a></div>
<figcaption><p>Homogeneous <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq141"><math id="M358"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> and region-based random node placement; (<strong>a</strong>) the network topology: the grey rectangles contain the anchor nodes with <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq142"><math id="M360"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>3</mn></mrow></math></span>m , the green rectangle contains the true position of the blind node, the yellow rectangle contains the initial estimate for the blind node position; (<strong>b</strong>) the RMSE of the proposed and existing algorithms; (<strong>c</strong>) the localization error histograms of the proposed and existing algorithms when <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq143"><math id="M362"><mrow><msub><mi>ฯ</mi><mi>p</mi></msub><mo>=</mo><mn>3</mn></mrow></math></span>dBm</p></figcaption></figure><p id="Par55">Lastly, we simulate a scenario in which the anchor nodes in one region have one value for <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq151"><math id="M378"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> and the anchor nodes in another region have another value for <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq152"><math id="M380"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span>. The results for this scenario are given in Figs. <a href="#Fig9" class="usa-link">9</a> and <a href="#Fig10" class="usa-link">10</a>. The proposed algorithm achieves up to <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq153"><math id="M382"><mrow><mn>25</mn><mo>%</mo></mrow></math></span> lower RMSE compared to the algorithm in comparison. The error histogram of the proposed algorithm for <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq154"><math id="M384"><mrow><msub><mi>ฯ</mi><msub><mi>p</mi><mi>i</mi></msub></msub><mo>=</mo><mn>3</mn></mrow></math></span>dBm is also more compact than that of the algorithm in comparison.</p>
<figure class="fig xbox font-sm" id="Fig9"><h4 class="obj_head">Fig. 9.</h4>
<p class="img-box line-height-none margin-x-neg-2 tablet:margin-x-0 text-center"><a class="tileshop" target="_blank" href="https://www.ncbi.nlm.nih.gov/core/lw/2.0/html/tileshop_pmc/tileshop_pmc_inline.html?title=Click%20on%20image%20to%20zoom&p=PMC3&id=8636071_11277_2021_9423_Fig9_HTML.jpg"><img class="graphic zoom-in" src="https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0617/8636071/9f3174187e2b/11277_2021_9423_Fig9_HTML.jpg" loading="lazy" id="MO47" height="251" width="709" alt="Fig. 9"></a></p>
<div class="p text-right font-secondary"><a href="figure/Fig9/" class="usa-link" target="_blank" rel="noopener noreferrer">Open in a new tab</a></div>
<figcaption><p>Heterogeneous <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq144"><math id="M364"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> and region-based random node placement; (<strong>a</strong>) the network topology: the grey rectangle contains the anchor nodes with <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq145"><math id="M366"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>5</mn></mrow></math></span>m, the blue rectangle contains the anchor nodes with <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq146"><math id="M368"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>1</mn></mrow></math></span>m, the green rectangle contains the true position of the blind node, the yellow rectangle contains the initial estimate for the blind node position; (<strong>b</strong>) the RMSE of the proposed and existing algorithms; (<strong>c</strong>) the localization error histograms of the proposed and existing algorithms when <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq147"><math id="M370"><mrow><msub><mi>ฯ</mi><mi>p</mi></msub><mo>=</mo><mn>3</mn></mrow></math></span>dBm</p></figcaption></figure><figure class="fig xbox font-sm" id="Fig10"><h4 class="obj_head">Fig. 10.</h4>
<p class="img-box line-height-none margin-x-neg-2 tablet:margin-x-0 text-center"><a class="tileshop" target="_blank" href="https://www.ncbi.nlm.nih.gov/core/lw/2.0/html/tileshop_pmc/tileshop_pmc_inline.html?title=Click%20on%20image%20to%20zoom&p=PMC3&id=8636071_11277_2021_9423_Fig10_HTML.jpg"><img class="graphic zoom-in" src="https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0617/8636071/cb56d032c39a/11277_2021_9423_Fig10_HTML.jpg" loading="lazy" id="MO48" height="256" width="709" alt="Fig. 10"></a></p>
<div class="p text-right font-secondary"><a href="figure/Fig10/" class="usa-link" target="_blank" rel="noopener noreferrer">Open in a new tab</a></div>
<figcaption><p>Heterogeneous <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq155"><math id="M386"><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub></math></span> and region-based random node placement; (<strong>a</strong>) network topology: the grey rectangles contain the anchor nodes with <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq156"><math id="M388"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>4</mn></mrow></math></span>m, the blue rectangle contains the anchor nodes with <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq157"><math id="M390"><mrow><msub><mi>ฯ</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>=</mo><mn>1</mn></mrow></math></span>m, green rectangle contains the true position of the blind node, the yellow rectangle contains the initial estimate for the blind node position; (<strong>b</strong>) the RMSE of the proposed and existing algorithms; (<strong>c</strong>) the localization error histograms of the proposed and existing algorithms when <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq158"><math id="M392"><mrow><msub><mi>ฯ</mi><mi>p</mi></msub><mo>=</mo><mn>3</mn></mrow></math></span>dBm</p></figcaption></figure><p id="Par56">In summary, the proposed algorithm offers significant improvements over the existing algorithm in the realistic scenario of heterogeneous GNSS error. However, its advantages when the GNSS error is homogeneous are less pronounced.</p></section></section><section id="Sec11"><h2 class="pmc_sec_title">Conclusion</h2>
<p id="Par57">We investigated the problem of self-localization of resource-constrained IoT devices given noisy anchor position information and imperfect RSSI-based distance estimates. We experimentally analysed the values of CRLB in different situations to gain insights into the impacts of anchor position errors and the number of anchors on the localization accuracy. We showed that the presence of perturbation in anchor position information in addition to the perturbations in the RSSI measurements can severely degrade the self-localization accuracy of the blind node. Our analysis also revealed that the presence of noisy anchor nodes beyond a certain number may not improve the localization accuracy. We proposed a self-localization algorithm that can localize an IoT device in the presence of perturbations in both anchor positions and RSSI measurements. Our simulation results show that the proposed algorithm can yield significantly lower localization error compared to an existing related algorithm.</p></section><section id="_bios93_" lang="en"><h2 class="pmc_sec_title">Biographies</h2>
<section id="bio1" class="bio"><h3 class="pmc_sec_title">Vikram Kumar</h3>
<p id="Par1">received the Bachelor of Technology degree in Information Technology from the University Institute of Information Technology, Himachal Pradesh University, India in 2006. He received his PhD degree from The University of Queensland, Australia in 2018. Currently, he is working as Assistant Professor in Indian Institute of Information Technology Una, India. Mailing address: School of Computing, Indian Institute of Information Technology, Una, India<img class="graphic" src="https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0617/8636071/9f3c3b626b1a/11277_2021_9423_Figa_HTML.jpg" loading="lazy" id="MO60" height="590" width="447" alt="graphic file with name 11277_2021_9423_Figa_HTML.jpg"></p></section><section id="bio2" class="bio"><h3 class="pmc_sec_title">Reza Arablouei</h3>
<p id="Par2">received his PhD degree in telecommunications engineering from the University of South Australia in 2013. He is currently a research scientist at the Commonwealth Scientific and Industrial Research Organisation. His current research interest are in machine learning and statistical signal processing. Mailing address: CSIROโs Data61, Pullenvale QLD 4069, Australia<img class="graphic" src="https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0617/8636071/104461e2082f/11277_2021_9423_Figb_HTML.jpg" loading="lazy" id="MO61" height="590" width="447" alt="graphic file with name 11277_2021_9423_Figb_HTML.jpg"></p></section></section><section id="App1" class="app"><section id="Sec12"><h3 class="pmc_sec_title">Appendix</h3>
<p id="Par58">The second-order partial derivatives of the log-likelihood function <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq159"><math id="M394"><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></math></span> with respect to the entries of its argument <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq160"><math id="M396"><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow></math></span>, which are required for the calculation of the FIM, are computed as in the following</p>
<table class="disp-formula p" id="Equ38"><tr>
<td class="formula"><math id="M398" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msup><mrow><msub><mi>x</mi><mi>b</mi></msub></mrow><mn>2</mn></msup></mrow></mfrac><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><munderover><mo>โ</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>M</mi></munderover><mrow><mo maxsize="2.470em" minsize="2.470em" stretchy="true">{</mo></mrow><mo>-</mo><mfrac><mrow><msub><mi>b</mi><mi>i</mi></msub><msup><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup></mrow><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mo>+</mo><msub><mi>b</mi><mi>i</mi></msub><mo>ln</mo><mfenced close=")" open="("><mfrac><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><msubsup><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi><mn>2</mn></msubsup></mfrac></mfenced><mfenced close="]" open="["><mfrac><msup><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mo>-</mo><mfrac><mn>1</mn><mrow><mn>2</mn><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup></mrow></mfrac></mfenced><mrow><mo maxsize="2.470em" minsize="2.470em" stretchy="true">}</mo></mrow></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">38</td>
</tr></table>
<table class="disp-formula p" id="Equ39"><tr>
<td class="formula"><math id="M400" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msup><mrow><msub><mi>y</mi><mi>b</mi></msub></mrow><mn>2</mn></msup></mrow></mfrac><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><munderover><mo>โ</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>M</mi></munderover><mrow><mo maxsize="2.470em" minsize="2.470em" stretchy="true">{</mo></mrow><mo>-</mo><mfrac><mrow><msub><mi>b</mi><mi>i</mi></msub><msup><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup></mrow><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mo>+</mo><msub><mi>b</mi><mi>i</mi></msub><mo>ln</mo><mfenced close=")" open="("><mfrac><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><msubsup><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi><mn>2</mn></msubsup></mfrac></mfenced><mfenced close="]" open="["><mfrac><msup><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mo>-</mo><mfrac><mn>1</mn><mrow><mn>2</mn><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup></mrow></mfrac></mfenced><mrow><mo maxsize="2.470em" minsize="2.470em" stretchy="true">}</mo></mrow></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">39</td>
</tr></table>
<table class="disp-formula p" id="Equ40"><tr>
<td class="formula"><math id="M402" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msub><mi>x</mi><mi>b</mi></msub><mi>โ</mi><msub><mi>y</mi><mi>b</mi></msub></mrow></mfrac><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><munderover><mo>โ</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>M</mi></munderover><mfenced close="}" open="{"><mfrac><mrow><msub><mi>b</mi><mi>i</mi></msub><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow></mrow><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mfenced close="]" open="["><mo>ln</mo><mfenced close=")" open="("><mfrac><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><msubsup><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi><mn>2</mn></msubsup></mfrac></mfenced><mo>-</mo><mn>1</mn></mfenced></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">40</td>
</tr></table>
<table class="disp-formula p" id="Equ41"><tr>
<td class="formula"><math id="M404" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msub><mi>x</mi><mi>b</mi></msub><mi>โ</mi><msub><mi>x</mi><mi>i</mi></msub></mrow></mfrac><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><mfrac><mrow><msub><mi>b</mi><mi>i</mi></msub><msup><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup></mrow><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mo>-</mo><msub><mi>b</mi><mi>i</mi></msub><mo>ln</mo><mfenced close=")" open="("><mfrac><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><msubsup><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi><mn>2</mn></msubsup></mfrac></mfenced><mfenced close="]" open="["><mfrac><msup><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mo>-</mo><mfrac><mn>1</mn><mrow><mn>2</mn><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup></mrow></mfrac></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">41</td>
</tr></table>
<table class="disp-formula p" id="Equ42"><tr>
<td class="formula"><math id="M406" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msub><mi>x</mi><mi>b</mi></msub><mi>โ</mi><msub><mi>y</mi><mi>i</mi></msub></mrow></mfrac><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><mfrac><mrow><msub><mi>b</mi><mi>i</mi></msub><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow></mrow><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mfenced close="]" open="["><mn>1</mn><mo>-</mo><mo>ln</mo><mfenced close=")" open="("><mfrac><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><msubsup><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi><mn>2</mn></msubsup></mfrac></mfenced></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">42</td>
</tr></table>
<table class="disp-formula p" id="Equ43"><tr>
<td class="formula"><math id="M408" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msub><mi>y</mi><mi>b</mi></msub><mi>โ</mi><msub><mi>x</mi><mi>i</mi></msub></mrow></mfrac><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><mfrac><mrow><msub><mi>b</mi><mi>i</mi></msub><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow></mrow><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mfenced close="]" open="["><mn>1</mn><mo>-</mo><mo>ln</mo><mfenced close=")" open="("><mfrac><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><msubsup><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi><mn>2</mn></msubsup></mfrac></mfenced></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">43</td>
</tr></table>
<table class="disp-formula p" id="Equ44"><tr>
<td class="formula"><math id="M410" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msub><mi>y</mi><mi>b</mi></msub><mi>โ</mi><msub><mi>y</mi><mi>i</mi></msub></mrow></mfrac><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><mfrac><mrow><msub><mi>b</mi><mi>i</mi></msub><msup><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup></mrow><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mo>-</mo><msub><mi>b</mi><mi>i</mi></msub><mo>ln</mo><mfenced close=")" open="("><mfrac><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><msubsup><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi><mn>2</mn></msubsup></mfrac></mfenced><mfenced close="]" open="["><mfrac><msup><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mo>-</mo><mfrac><mn>1</mn><mrow><mn>2</mn><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup></mrow></mfrac></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">44</td>
</tr></table>
<p>for <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq161"><math id="M412"><mrow><mi>i</mi><mo>=</mo><mi>j</mi></mrow></math></span>:</p>
<table class="disp-formula p" id="Equ45"><tr>
<td class="formula"><math id="M414" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msub><mi>x</mi><mi>i</mi></msub><mi>โ</mi><msub><mi>x</mi><mi>j</mi></msub></mrow></mfrac><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><mo>-</mo><mfrac><mrow><msub><mi>b</mi><mi>i</mi></msub><msup><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup></mrow><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mo>-</mo><mfrac><mn>1</mn><msubsup><mi>ฯ</mi><mrow><msub><mi>a</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup></mfrac><mo>+</mo><msub><mi>b</mi><mi>i</mi></msub><mo>ln</mo><mfenced close=")" open="("><mfrac><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><msubsup><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi><mn>2</mn></msubsup></mfrac></mfenced><mfenced close="]" open="["><mfrac><msup><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mo>-</mo><mfrac><mn>1</mn><mrow><mn>2</mn><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup></mrow></mfrac></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">45</td>
</tr></table>
<table class="disp-formula p" id="Equ46"><tr>
<td class="formula"><math id="M416" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msub><mi>y</mi><mi>i</mi></msub><mi>โ</mi><msub><mi>y</mi><mi>j</mi></msub></mrow></mfrac><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><mfrac><mrow><msub><mi>b</mi><mi>i</mi></msub><msup><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup></mrow><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mo>-</mo><mfrac><mn>1</mn><msubsup><mi>ฯ</mi><mrow><msub><mi>a</mi><mi>i</mi></msub></mrow><mn>2</mn></msubsup></mfrac><mo>+</mo><msub><mi>b</mi><mi>i</mi></msub><mo>ln</mo><mfenced close=")" open="("><mfrac><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><msubsup><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi><mn>2</mn></msubsup></mfrac></mfenced><mfenced close="]" open="["><mfrac><msup><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mn>2</mn></msup><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mo>-</mo><mfrac><mn>1</mn><mrow><mn>2</mn><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup></mrow></mfrac></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">46</td>
</tr></table>
<table class="disp-formula p" id="Equ47"><tr>
<td class="formula"><math id="M418" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msub><mi>x</mi><mi>i</mi></msub><mi>โ</mi><msub><mi>y</mi><mi>j</mi></msub></mrow></mfrac><mo>=</mo></mrow></mtd><mtd columnalign="left"><mrow><mrow></mrow><mfrac><msub><mi>b</mi><mi>i</mi></msub><msubsup><mi>d</mi><mi>i</mi><mn>4</mn></msubsup></mfrac><mrow><mo stretchy="false">(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>-</mo><msub><mi>x</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mrow><mo stretchy="false">(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><msub><mi>y</mi><mi>b</mi></msub><mo stretchy="false">)</mo></mrow><mfenced close="]" open="["><mo>ln</mo><mfenced close=")" open="("><mfrac><msubsup><mi>d</mi><mi>i</mi><mn>2</mn></msubsup><msubsup><mover accent="true"><mi>d</mi><mo stretchy="false">~</mo></mover><mi>i</mi><mn>2</mn></msubsup></mfrac></mfenced><mo>-</mo><mn>1</mn></mfenced></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">47</td>
</tr></table>
<p>for <span xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IEq162"><math id="M420"><mrow><mi>i</mi><mo>โ </mo><mi>j</mi></mrow></math></span>:</p>
<table class="disp-formula p" id="Equ48"><tr>
<td class="formula"><math id="M422" display="block"><mrow><mtable><mtr><mtd columnalign="right"><mrow><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msub><mi>x</mi><mi>i</mi></msub><mi>โ</mi><msub><mi>x</mi><mi>j</mi></msub></mrow></mfrac><mo>=</mo><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msub><mi>y</mi><mi>i</mi></msub><mi>โ</mi><msub><mi>y</mi><mi>j</mi></msub></mrow></mfrac><mo>=</mo><mfrac><mrow><msup><mi>โ</mi><mn>2</mn></msup><mrow><mi>l</mi><mfenced close=")" open="("><mrow><mi mathvariant="bold-italic">ฮธ</mi></mrow><mo>โฃ</mo><mi mathvariant="bold">w</mi></mfenced></mrow></mrow><mrow><mi>โ</mi><msub><mi>x</mi><mi>i</mi></msub><mi>โ</mi><msub><mi>y</mi><mi>j</mi></msub></mrow></mfrac><mo>=</mo><mn>0</mn><mo>.</mo></mrow></mtd></mtr></mtable></mrow></math></td>
<td class="label">48</td>
</tr></table></section></section><section id="fn-group1" class="fn-group"><h2 class="pmc_sec_title">Footnotes</h2>
<div class="fn-group p font-secondary-light font-sm"><div class="fn p" id="fn1">
<p><strong>Publisher's Note</strong></p>
<p>Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.</p>
</div></div></section><section id="_ci93_" lang="en" class="contrib-info"><h2 class="pmc_sec_title">Contributor Information</h2>
<p>Vikram Kumar, Email: vikram@iiitu.ac.in, Email: er.vikram14@yahoo.com.</p>
<p>Reza Arablouei, Email: reza.arablouei@csiro.au, Email: rezaa219@yahoo.com.</p></section><section id="Bib1" class="ref-list"><h2 class="pmc_sec_title">References</h2>
<section id="Bib1_sec2"><ul class="ref-list font-sm" style="list-style-type:none">
<li id="CR1">
<span class="label">1.</span><cite>Nguyen, T.N., Le, V.V., Chu, S.I., Liu, B.H., & Hsu, Y.C. (2021). Secure localization algorithms against localization attacks in wireless sensor networks.<em> Wireless Personal Communications</em>, <em>17</em>, 1โ26.</cite>
</li>
<li id="CR2">
<span class="label">2.</span><cite>Valsalan P, Baomar TAB, Baabood AHO. IoT based health monitoring system. Journal of Critical Reviews. 2020;7(4):739โ743.</cite> [<a href="https://scholar.google.com/scholar_lookup?journal=Journal%20of%20Critical%20Reviews&title=IoT%20based%20health%20monitoring%20system&author=P%20Valsalan&author=TAB%20Baomar&author=AHO%20Baabood&volume=7&issue=4&publication_year=2020&pages=739-743&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR3">
<span class="label">3.</span><cite>Zamanifar, A. (2021). Remote patient monitoring: Health status detection and prediction in IoT-Based health care. In<em> IoT in Healthcare and Ambient Assisted Living</em>, Springer, pp 89โ102.</cite>
</li>
<li id="CR4">
<span class="label">4.</span><cite>Kaur, N., & Deep, G. (2021). IoT-Based brinjal crop monitoring system. In<em> Smart Sensors for Industrial Internet of Things</em>, Springer, pp 231โ247.</cite>
</li>
<li id="CR5">
<span class="label">5.</span><cite>Tao Z. Advanced wavelet sampling algorithm for IoT based environmental monitoring and management. Computer Communications. 2020;150:547โ555. doi: 10.1016/j.comcom.2019.12.006.</cite> [<a href="https://doi.org/10.1016/j.comcom.2019.12.006" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=Computer%20Communications&title=Advanced%20wavelet%20sampling%20algorithm%20for%20IoT%20based%20environmental%20monitoring%20and%20management&author=Z%20Tao&volume=150&publication_year=2020&pages=547-555&doi=10.1016/j.comcom.2019.12.006&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR6">
<span class="label">6.</span><cite>Ali Z, Shah MA, Almogren A, Ud Din I, Maple C, Khattak HA. Named data networking for efficient IoT-based disaster management in a smart campus. Sustainability. 2020;12(8):3088. doi: 10.3390/su12083088.</cite> [<a href="https://doi.org/10.3390/su12083088" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=Sustainability&title=Named%20data%20networking%20for%20efficient%20IoT-based%20disaster%20management%20in%20a%20smart%20campus&author=Z%20Ali&author=MA%20Shah&author=A%20Almogren&author=I%20Ud%20Din&author=C%20Maple&volume=12&issue=8&publication_year=2020&pages=3088&doi=10.3390/su12083088&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR7">
<span class="label">7.</span><cite>Kumar, V., Arablouei, R., Jurdak, R., Kusy, B., & Bergmann, N.W. (2017). Multi-mode tracking of a group of mobile agents. In <em>2017 20th International Symposium on Wireless Personal Multimedia Communications (WPMC)</em>, pp 161โ166, 10.1109/WPMC.2017.8301801</cite>
</li>
<li id="CR8">
<span class="label">8.</span><cite>Wang, Y., Shang, Y., Tao, W., & Yu, Y. (2021). Target positioning algorithm based on RSS fingerprints of SVM of fuzzy kernel clustering.<em> Wireless Personal Communications</em> pp 1โ19.</cite>
</li>
<li id="CR9">
<span class="label">9.</span><cite>Clark L, Papalia A, Carvalho JT, Mastrostefano L, Krishnamachari B. Inter-mobile-device distance estimation using network localization algorithms for digital contact logging applications. Smart Health. 2021;19(100):168.</cite> [<a href="https://scholar.google.com/scholar_lookup?journal=Smart%20Health&title=Inter-mobile-device%20distance%20estimation%20using%20network%20localization%20algorithms%20for%20digital%20contact%20logging%20applications&author=L%20Clark&author=A%20Papalia&author=JT%20Carvalho&author=L%20Mastrostefano&author=B%20Krishnamachari&volume=19&issue=100&publication_year=2021&pages=168&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR10">
<span class="label">10.</span><cite>Kindt, P.H., Chakraborty, T., Chakraborty, S. (2020). How reliable is smartphone-based electronic contact tracing for COVID-19? <a href="http://arxiv.org/abs/arXiv:2005.05625" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">http://arxiv.org/abs/arXiv:2005.05625</a>.</cite>
</li>
<li id="CR11">
<span class="label">11.</span><cite>Siriwardhana Y, De Alwis C, Gur G, Ylianttila M, Liyanage M. The Fight against COVID-19 Pandemic with 5G Technologies. IEEE Engineering Management Review. 2020;48-3:72โ84. doi: 10.1109/EMR.2020.3017451.</cite> [<a href="https://doi.org/10.1109/EMR.2020.3017451" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Engineering%20Management%20Review&title=The%20Fight%20against%20COVID-19%20Pandemic%20with%205G%20Technologies&author=Y%20Siriwardhana&author=C%20De%20Alwis&author=G%20Gur&author=M%20Ylianttila&author=M%20Liyanage&volume=48-3&publication_year=2020&pages=72-84&doi=10.1109/EMR.2020.3017451&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR12">
<span class="label">12.</span><cite>Specht C, Szot T, Dabrowski P, Specht M. Testing GNSS receiver accuracy in samsung galaxy series mobile phones at a sports stadium. Measurement Science and Technology. 2020;31(6):064006. doi: 10.1088/1361-6501/ab75b2.</cite> [<a href="https://doi.org/10.1088/1361-6501/ab75b2" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=Measurement%20Science%20and%20Technology&title=Testing%20GNSS%20receiver%20accuracy%20in%20samsung%20galaxy%20series%20mobile%20phones%20at%20a%20sports%20stadium&author=C%20Specht&author=T%20Szot&author=P%20Dabrowski&author=M%20Specht&volume=31&issue=6&publication_year=2020&pages=064006&doi=10.1088/1361-6501/ab75b2&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR13">
<span class="label">13.</span><cite>Vallina-Rodriguez N, Crowcroft J. When assistance becomes dependence: Characterizing the costs and inefficiencies of A-GPS. ACM SIGMOBILE Mobile Computing and Communications Review. 2013;17(4):3โ14. doi: 10.1145/2557968.2557970.</cite> [<a href="https://doi.org/10.1145/2557968.2557970" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=ACM%20SIGMOBILE%20Mobile%20Computing%20and%20Communications%20Review&title=When%20assistance%20becomes%20dependence:%20Characterizing%20the%20costs%20and%20inefficiencies%20of%20A-GPS&author=N%20Vallina-Rodriguez&author=J%20Crowcroft&volume=17&issue=4&publication_year=2013&pages=3-14&doi=10.1145/2557968.2557970&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR14">
<span class="label">14.</span><cite>Constandache, I., Gaonkar, S., Sayler, M., Choudhury, R.R., & Cox, L. (2009). Enloc: Energy-efficient localization for mobile phones. In<em> INFOCOM</em> 2009, IEEE, IEEE, pp 2716โ2720.</cite>
</li>
<li id="CR15">
<span class="label">15.</span><cite>Kumar, V., Bergmann, N.W., Ahmad, I., Jurdak, R., & Kusy, B. (2016). Cluster-based position tracking of mobile sensors. In<em> 2016 IEEE Conference on Wireless Sensors (ICWiSE)</em>, IEEE, pp 7โ14</cite>
</li>
<li id="CR16">
<span class="label">16.</span><cite>Gao Z, Li Y, Zhuang Y, Yang H, Pan Y, Zhang H. Robust Kalman filter aided GEO/IGSO/GPS raw-PPP/INS tight integration. Sensors. 2019;19(2):417. doi: 10.3390/s19020417.</cite> [<a href="https://doi.org/10.3390/s19020417" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="/articles/PMC6359615/" class="usa-link">PMC free article</a>] [<a href="https://pubmed.ncbi.nlm.nih.gov/30669595/" class="usa-link">PubMed</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=Sensors&title=Robust%20Kalman%20filter%20aided%20GEO/IGSO/GPS%20raw-PPP/INS%20tight%20integration&author=Z%20Gao&author=Y%20Li&author=Y%20Zhuang&author=H%20Yang&author=Y%20Pan&volume=19&issue=2&publication_year=2019&pages=417&pmid=30669595&doi=10.3390/s19020417&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR17">
<span class="label">17.</span><cite>Solin A, Kok M, Wahlstrรถm N, Schรถn TB, Sรคrkkรค S. Modeling and interpolation of the ambient magnetic field by gaussian processes. IEEE Transactions on Robotics. 2018;34(4):1112โ1127. doi: 10.1109/TRO.2018.2830326.</cite> [<a href="https://doi.org/10.1109/TRO.2018.2830326" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Transactions%20on%20Robotics&title=Modeling%20and%20interpolation%20of%20the%20ambient%20magnetic%20field%20by%20gaussian%20processes&author=A%20Solin&author=M%20Kok&author=N%20Wahlstr%C3%B6m&author=TB%20Sch%C3%B6n&author=S%20S%C3%A4rkk%C3%A4&volume=34&issue=4&publication_year=2018&pages=1112-1127&doi=10.1109/TRO.2018.2830326&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR18">
<span class="label">18.</span><cite>Wang M, Qin H, Jin T. Massive terminal positioning system with snapshot positioning technique. GPS Solutions. 2019;23(2):1โ14.</cite> [<a href="https://scholar.google.com/scholar_lookup?journal=GPS%20Solutions&title=Massive%20terminal%20positioning%20system%20with%20snapshot%20positioning%20technique&author=M%20Wang&author=H%20Qin&author=T%20Jin&volume=23&issue=2&publication_year=2019&pages=1-14&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR19">
<span class="label">19.</span><cite>Pandey, A., Rajan, A., Nandi, A., & Balas, V.E. (2021). Lifetime enhancement of sensor networks by the moth flame optimization.<em> Wireless Personal Communications</em> pp 1โ14.</cite>
</li>
<li id="CR20">
<span class="label">20.</span><cite>Lee, Y., Ju, Y., Min, C., Kang, S., Hwang, I., & Song, J. (2012). Comon: Cooperative ambience monitoring platform with continuity and benefit awareness. In <em>Proceedings of the 10th international conference on Mobile systems, applications, and services</em>, ACM, pp 43โ56.</cite>
</li>
<li id="CR21">
<span class="label">21.</span><cite>Mohammadabadi, P.H., & Valaee, S. (2014). Cooperative node positioning in vehicular networks using inter-node distance measurements. In <em>2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC)</em>, IEEE, pp 1448โ1452.</cite>
</li>
<li id="CR22">
<span class="label">22.</span><cite>Feng, C., Anthea Au, W. S., Valaee, S., & Tan, Z. (2010). Compressive sensing based positioning using RSS of WLAN access points. <em>Proceedings - IEEE INFOCOM</em>. 10.1109/INFCOM.2010.5461981</cite>
</li>
<li id="CR23">
<span class="label">23.</span><cite>Patwari, N., Hero, A. O., Perkins, M., Correal, N. S., & Oโdea, R. J. (2003). Relative location estimation in wireless sensor networks. <em>IEEE Transactions on Signal Processing,</em><em>51</em>(8), 2137โ2148.</cite>
</li>
<li id="CR24">
<span class="label">24.</span><cite>Patwari N, Ash JN, Kyperountas S, Hero AO, Moses RL, Correal NS. Locating the nodes: Cooperative localization in wireless sensor networks. IEEE Signal Processing Magazine. 2005;22(4):54โ69. doi: 10.1109/MSP.2005.1458287.</cite> [<a href="https://doi.org/10.1109/MSP.2005.1458287" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Signal%20Processing%20Magazine&title=Locating%20the%20nodes:%20Cooperative%20localization%20in%20wireless%20sensor%20networks&author=N%20Patwari&author=JN%20Ash&author=S%20Kyperountas&author=AO%20Hero&author=RL%20Moses&volume=22&issue=4&publication_year=2005&pages=54-69&doi=10.1109/MSP.2005.1458287&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR25">
<span class="label">25.</span><cite>Tarrรญo P, Bernardos AM, Casar JR. Weighted least squares techniques for improved received signal strength based localization. Sensors. 2011;11(9):8569โ8592. doi: 10.3390/s110908569.</cite> [<a href="https://doi.org/10.3390/s110908569" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="/articles/PMC3231493/" class="usa-link">PMC free article</a>] [<a href="https://pubmed.ncbi.nlm.nih.gov/22164092/" class="usa-link">PubMed</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=Sensors&title=Weighted%20least%20squares%20techniques%20for%20improved%20received%20signal%20strength%20based%20localization&author=P%20Tarr%C3%ADo&author=AM%20Bernardos&author=JR%20Casar&volume=11&issue=9&publication_year=2011&pages=8569-8592&pmid=22164092&doi=10.3390/s110908569&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR26">
<span class="label">26.</span><cite>Shang Y, Ruml W, Zhang Y, Fromherz M. Localization from connectivity in sensor networks. IEEE Transactions on Parallel and Distributed Systems. 2004;15(11):961โ974. doi: 10.1109/TPDS.2004.67.</cite> [<a href="https://doi.org/10.1109/TPDS.2004.67" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Transactions%20on%20Parallel%20and%20Distributed%20Systems&title=Localization%20from%20connectivity%20in%20sensor%20networks&author=Y%20Shang&author=W%20Ruml&author=Y%20Zhang&author=M%20Fromherz&volume=15&issue=11&publication_year=2004&pages=961-974&doi=10.1109/TPDS.2004.67&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR27">
<span class="label">27.</span><cite>Biswas, P., & Ye, Y. (2004). Semidenite Programming for Ad Hoc Wireless Sensor Network Localization. In <em>Proceedings of the Third International Symposium on Information Processing in Sensor Networks</em>, pp 46โ54. 10.1145/984622.984630.</cite>
</li>
<li id="CR28">
<span class="label">28.</span><cite>Xiong W, Schindelhauer C, So HC, Bordoy J, Gabbrielli A, Liang J. Tdoa-based localization with nlos mitigation via robust model transformation and neurodynamic optimization. Signal Processing. 2021;178(107):774.</cite> [<a href="https://scholar.google.com/scholar_lookup?journal=Signal%20Processing&title=Tdoa-based%20localization%20with%20nlos%20mitigation%20via%20robust%20model%20transformation%20and%20neurodynamic%20optimization&author=W%20Xiong&author=C%20Schindelhauer&author=HC%20So&author=J%20Bordoy&author=A%20Gabbrielli&volume=178&issue=107&publication_year=2021&pages=774&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR29">
<span class="label">29.</span><cite>Zheng, J., & Wu, Y. C. (2009). Robust joint localization and time synchronization in wireless sensor networks with bounded anchor uncertainties. <em>2009 IEEE International Conference on Acoustics</em> (pp. 2793โ2796). IEEE: Speech and Signal Processing.</cite>
</li>
<li id="CR30">
<span class="label">30.</span><cite>Picard JS, Weiss AJ. Bounds on the number of identifiable outliers in source localization by linear programming. IEEE Transactions on Signal Processing. 2010;58(5):2884โ2895. doi: 10.1109/TSP.2010.2041275.</cite> [<a href="https://doi.org/10.1109/TSP.2010.2041275" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Transactions%20on%20Signal%20Processing&title=Bounds%20on%20the%20number%20of%20identifiable%20outliers%20in%20source%20localization%20by%20linear%20programming&author=JS%20Picard&author=AJ%20Weiss&volume=58&issue=5&publication_year=2010&pages=2884-2895&doi=10.1109/TSP.2010.2041275&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR31">
<span class="label">31.</span><cite>Zhu S, Ding Z. A simple approach of range-based positioning with low computational complexity. IEEE Transactions on Wireless Communications. 2009;8(12):5832โ5836. doi: 10.1109/TWC.2009.12.090905.</cite> [<a href="https://doi.org/10.1109/TWC.2009.12.090905" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Transactions%20on%20Wireless%20Communications&title=A%20simple%20approach%20of%20range-based%20positioning%20with%20low%20computational%20complexity&author=S%20Zhu&author=Z%20Ding&volume=8&issue=12&publication_year=2009&pages=5832-5836&doi=10.1109/TWC.2009.12.090905&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR32">
<span class="label">32.</span><cite>Lui KWK, Ma WK, So HC, Chan FKW. Semi-definite programming algorithms for sensor network node localization with uncertainties in anchor positions and/or propagation speed. IEEE Transactions on Signal Processing. 2009;57(2):752โ763. doi: 10.1109/TSP.2008.2007916.</cite> [<a href="https://doi.org/10.1109/TSP.2008.2007916" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Transactions%20on%20Signal%20Processing&title=Semi-definite%20programming%20algorithms%20for%20sensor%20network%20node%20localization%20with%20uncertainties%20in%20anchor%20positions%20and/or%20propagation%20speed&author=KWK%20Lui&author=WK%20Ma&author=HC%20So&author=FKW%20Chan&volume=57&issue=2&publication_year=2009&pages=752-763&doi=10.1109/TSP.2008.2007916&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR33">
<span class="label">33.</span><cite>Mekonnen, Z.W., & Wittneben, a. (2014). Robust TOA based localization for wireless sensor networks with anchor position uncertainties. In <em>Personal, Indoor, and Mobile Radio Communication (PIMRC), 2014 IEEE 25th Annual International Symposium</em>, pp 2029โ2033, 10.1109/PIMRC.2014.7136505</cite>
</li>
<li id="CR34">
<span class="label">34.</span><cite>Naddafzadeh-Shirazi G, Shenouda MB, Lampe L. Second order cone programming for sensor network localization with anchor position uncertainty. IEEE Transactions on Wireless Communications. 2014;13(2):749โ763. doi: 10.1109/TWC.2013.120613.130170.</cite> [<a href="https://doi.org/10.1109/TWC.2013.120613.130170" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Transactions%20on%20Wireless%20Communications&title=Second%20order%20cone%20programming%20for%20sensor%20network%20localization%20with%20anchor%20position%20uncertainty&author=G%20Naddafzadeh-Shirazi&author=MB%20Shenouda&author=L%20Lampe&volume=13&issue=2&publication_year=2014&pages=749-763&doi=10.1109/TWC.2013.120613.130170&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR35">
<span class="label">35.</span><cite>Srirangarajan, S., Tewfik, A.H., & Luo, Z.Q. (2007). Distributed sensor network localization with inaccurate anchor positions and noisy distance information. In <em>2007 IEEE International Conference on Acoustics, Speech and Signal Processing-ICASSPโ07</em>, IEEE, volย 3, pp IIIโ521.</cite>
</li>
<li id="CR36">
<span class="label">36.</span><cite>Angjelichinoski M, Denkovski D, Atanasovski V, Gavrilovska L. SPEAR: Source position estimation for anchor position uncertainty reduction. Communications Letters, IEEE. 2014;18(4):560โ563. doi: 10.1109/LCOMM.2014.020414.132780.</cite> [<a href="https://doi.org/10.1109/LCOMM.2014.020414.132780" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=Communications%20Letters,%20IEEE&title=SPEAR:%20Source%20position%20estimation%20for%20anchor%20position%20uncertainty%20reduction&author=M%20Angjelichinoski&author=D%20Denkovski&author=V%20Atanasovski&author=L%20Gavrilovska&volume=18&issue=4&publication_year=2014&pages=560-563&doi=10.1109/LCOMM.2014.020414.132780&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR37">
<span class="label">37.</span><cite>Ja Costa, Patwari N, Hero AO. Distributed weighted-multidimensional scaling for node localization in sensor networks. ACM Transactions on Sensor Networks. 2006;2(1):39โ64. doi: 10.1145/1138127.1138129.</cite> [<a href="https://doi.org/10.1145/1138127.1138129" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=ACM%20Transactions%20on%20Sensor%20Networks&title=Distributed%20weighted-multidimensional%20scaling%20for%20node%20localization%20in%20sensor%20networks&author=Costa%20Ja&author=N%20Patwari&author=AO%20Hero&volume=2&issue=1&publication_year=2006&pages=39-64&doi=10.1145/1138127.1138129&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR38">
<span class="label">38.</span><cite>Yin Y, Wang Q, Zhang H, Xu H. A novel distributed sensor fusion algorithm for RSSI-based location estimation using the unscented kalman filter. Wireless Personal Communications. 2021;117(2):607โ621. doi: 10.1007/s11277-020-07888-w.</cite> [<a href="https://doi.org/10.1007/s11277-020-07888-w" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=Wireless%20Personal%20Communications&title=A%20novel%20distributed%20sensor%20fusion%20algorithm%20for%20RSSI-based%20location%20estimation%20using%20the%20unscented%20kalman%20filter&author=Y%20Yin&author=Q%20Wang&author=H%20Zhang&author=H%20Xu&volume=117&issue=2&publication_year=2021&pages=607-621&doi=10.1007/s11277-020-07888-w&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR39">
<span class="label">39.</span><cite>Varma PS, Anand V. Random forest learning based indoor localization as an IoT service for smart buildings. Wireless Personal Communications. 2021;117(4):3209โ3227. doi: 10.1007/s11277-020-07977-w.</cite> [<a href="https://doi.org/10.1007/s11277-020-07977-w" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=Wireless%20Personal%20Communications&title=Random%20forest%20learning%20based%20indoor%20localization%20as%20an%20IoT%20service%20for%20smart%20buildings&author=PS%20Varma&author=V%20Anand&volume=117&issue=4&publication_year=2021&pages=3209-3227&doi=10.1007/s11277-020-07977-w&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR40">
<span class="label">40.</span><cite>Kumar, V., & Arablouei, R. (2020). Self-localization given single perturbed measurement of anchor positions and RSSI. In <em>2020 23rd International Symposium on Wireless Personal Multimedia Communications (WPMC)</em>, IEEE, pp 1โ5.</cite>
</li>
<li id="CR41">
<span class="label">41.</span><cite>Raun J, Ahas R, Tiru M. Measuring tourism destinations using mobile tracking data. Tourism Management. 2016;57:202โ212. doi: 10.1016/j.tourman.2016.06.006.</cite> [<a href="https://doi.org/10.1016/j.tourman.2016.06.006" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=Tourism%20Management&title=Measuring%20tourism%20destinations%20using%20mobile%20tracking%20data&author=J%20Raun&author=R%20Ahas&author=M%20Tiru&volume=57&publication_year=2016&pages=202-212&doi=10.1016/j.tourman.2016.06.006&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR42">
<span class="label">42.</span><cite>Cardell-Oliver, R., Smettem, K., Kranz, M., & Mayer, K. (2004). Field testing a wireless sensor network for reactive environmental monitoring [soil moisture measurement]. In <em>Intelligent Sensors, Sensor Networks and Information Processing Conference</em>. Proceedings of the 2004, IEEE, pp 7โ12.</cite>
</li>
<li id="CR43">
<span class="label">43.</span><cite>Hart JK, Martinez K. Environmental sensor networks: A revolution in the earth system science? Earth-Science Reviews. 2006;78(3):177โ191. doi: 10.1016/j.earscirev.2006.05.001.</cite> [<a href="https://doi.org/10.1016/j.earscirev.2006.05.001" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=Earth-Science%20Reviews&title=Environmental%20sensor%20networks:%20A%20revolution%20in%20the%20earth%20system%20science?&author=JK%20Hart&author=K%20Martinez&volume=78&issue=3&publication_year=2006&pages=177-191&doi=10.1016/j.earscirev.2006.05.001&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR44">
<span class="label">44.</span><cite>Doherty, L., Pister, K., & El Ghaoui, L. (2001). Convex position estimation in wireless sensor networks. In <em>Proceedings IEEE INFOCOM 2001 Conference on Computer Communications Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat No01CH37213)</em> 3:1655โ1663, 10.1109/INFCOM.2001.916662</cite>
</li>
<li id="CR45">
<span class="label">45.</span><cite>Patwari, N., Heroย III, A.O. (2003) Using proximity and quantized RSS for sensor localization in wireless networks. In <em>Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications</em>, ACM, pp 20โ29.</cite>
</li>
<li id="CR46">
<span class="label">46.</span><cite>Kumar, P., Reddy, L., & Varma, S. (2009). Distance measurement and error estimation scheme for RSSI-based localization in wireless sensor networks. In <em>Wireless Communication and Sensor Networks (WCSN), 2009 Fifth IEEE Conference on, IEEE</em>, pp 1โ4.</cite>
</li>
<li id="CR47">
<span class="label">47.</span><cite>Angjelichinoski M, Denkovski D, Atanasovski V, Gavrilovska L. SPEAR: Source position estimation for anchor position uncertainty reduction. IEEE Communications Letters. 2014;18(4):560โ563. doi: 10.1109/LCOMM.2014.020414.132780.</cite> [<a href="https://doi.org/10.1109/LCOMM.2014.020414.132780" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Communications%20Letters&title=SPEAR:%20Source%20position%20estimation%20for%20anchor%20position%20uncertainty%20reduction&author=M%20Angjelichinoski&author=D%20Denkovski&author=V%20Atanasovski&author=L%20Gavrilovska&volume=18&issue=4&publication_year=2014&pages=560-563&doi=10.1109/LCOMM.2014.020414.132780&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR48">
<span class="label">48.</span><cite>Angjelichinoski M, Denkovski D, Atanasovski V, Gavrilovska L. Cramรฉr-Rao lower bounds of RSS-based localization with anchor position uncertainty. IEEE Transactions on Information Theory. 2015;61(5):2807โ2834. doi: 10.1109/TIT.2015.2409270.</cite> [<a href="https://doi.org/10.1109/TIT.2015.2409270" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Transactions%20on%20Information%20Theory&title=Cram%C3%A9r-Rao%20lower%20bounds%20of%20RSS-based%20localization%20with%20anchor%20position%20uncertainty&author=M%20Angjelichinoski&author=D%20Denkovski&author=V%20Atanasovski&author=L%20Gavrilovska&volume=61&issue=5&publication_year=2015&pages=2807-2834&doi=10.1109/TIT.2015.2409270&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR49">
<span class="label">49.</span><cite>Denkovski, D., Angjelichinoski, M., Atanasovski, V., & Gavrilovska, L. (2016). Geometric interpretation of theoretical bounds for RSS-based source localization with uncertain anchor positions. 10.1016/j.dsp.2017.06.003.</cite>
</li>
<li id="CR50">
<span class="label">50.</span><cite>Vukadinovic, V., & Mangold, S. (2012). Performance of collaborative GPS localization in pedestrian ad hoc networks. In <em>Proceedings of the third ACM international workshop on Mobile Opportunistic Networks, ACM</em>, pp 45โ52.</cite>
</li>
<li id="CR51">
<span class="label">51.</span><cite>Taniuchi D, Liu X, Nakai D, Maekawa T. Spring model based collaborative indoor position estimation with neighbor mobile devices. IEEE Journal of Selected Topics in Signal Processing. 2015;9(2):268โ277. doi: 10.1109/JSTSP.2014.2382478.</cite> [<a href="https://doi.org/10.1109/JSTSP.2014.2382478" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Journal%20of%20Selected%20Topics%20in%20Signal%20Processing&title=Spring%20model%20based%20collaborative%20indoor%20position%20estimation%20with%20neighbor%20mobile%20devices&author=D%20Taniuchi&author=X%20Liu&author=D%20Nakai&author=T%20Maekawa&volume=9&issue=2&publication_year=2015&pages=268-277&doi=10.1109/JSTSP.2014.2382478&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR52">
<span class="label">52.</span><cite>So HC, Chan FK. A generalized subspace approach for mobile positioning with time-of-arrival measurements. IEEE Transactions on Signal Processing. 2007;55(10):5103โ5107. doi: 10.1109/TSP.2003.896092.</cite> [<a href="https://doi.org/10.1109/TSP.2003.896092" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Transactions%20on%20Signal%20Processing&title=A%20generalized%20subspace%20approach%20for%20mobile%20positioning%20with%20time-of-arrival%20measurements&author=HC%20So&author=FK%20Chan&volume=55&issue=10&publication_year=2007&pages=5103-5107&doi=10.1109/TSP.2003.896092&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
<li id="CR53">
<span class="label">53.</span><cite>Rappaport, T.S., etย al. (1996).<em> Wireless communications: Principles and practice</em>, volย 2. Prentice Hall PTR.</cite>
</li>
<li id="CR54">
<span class="label">54.</span><cite>Rice, S.B.L. (1945). Mathematical Analysis of Random Noise Part III: Statistical properties of random noise currents _bstj24-1-46.pdf. 10.1002/j.1538-7305.1944.tb00874.x</cite>
</li>
<li id="CR55">
<span class="label">55.</span><cite>Abramowitz, M., Stegun, I.A., & Miller, D. (1965). Handbook of mathematical functions with formulas, graphs and mathematical tables (National Bureau of Standards Applied Mathematics Series No. 55).</cite>
</li>
<li id="CR56">
<span class="label">56.</span><cite>Zill, D. G. (2020). <em>Advanced Engineering Mathematics</em>. Jones & Bartlett Publishers.</cite>
</li>
<li id="CR57">
<span class="label">57.</span><cite>Ahmad, I., Bergmann, N., Jurdak, R., & Kusy, B. (2015). Experiments on localization of wireless sensors using airborne mobile anchors. In <em>IEEE Conference on Wireless Sensors (ICWiSe), IEEE</em>, pp 1โ6.</cite>
</li>
<li id="CR58">
<span class="label">58.</span><cite>Nguyen NH, Doฤanรงay K. Optimal geometry analysis for multi-static TOA localization. IEEE Transactions on Signal Processing. 2016;64(16):4180โ4193. doi: 10.1109/TSP.2016.2566611.</cite> [<a href="https://doi.org/10.1109/TSP.2016.2566611" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">DOI</a>] [<a href="https://scholar.google.com/scholar_lookup?journal=IEEE%20Transactions%20on%20Signal%20Processing&title=Optimal%20geometry%20analysis%20for%20multi-static%20TOA%20localization&author=NH%20Nguyen&author=K%20Do%C4%9Fan%C3%A7ay&volume=64&issue=16&publication_year=2016&pages=4180-4193&doi=10.1109/TSP.2016.2566611&" class="usa-link usa-link--external" data-ga-action="click_feat_suppl" target="_blank" rel="noopener noreferrer">Google Scholar</a>]</li>
</ul></section></section></section><footer class="p courtesy-note font-secondary font-sm text-center"><hr class="headless">
<p>Articles from Wireless Personal Communications are provided here courtesy of <strong>Nature Publishing Group</strong></p></footer></section></article>
</main>
</div>
</div>
</div>
<div class="pmc-sidenav desktop:grid-col-4 display-flex">
<section class="pmc-sidenav__container" aria-label="Article resources and navigation">
<button type="button" class="pmc-sidenav__container__close">
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/usa-icons/close.svg" role="img" alt="Close" />
</button>
<div class="display-none desktop:display-block">
<section class="margin-top-4 desktop:margin-top-0">
<h2 class="margin-top-0">ACTIONS</h2>
<ul class="usa-list usa-list--unstyled usa-list--actions">
<li>
<a
href="https://doi.org/10.1007/s11277-021-09423-x"
class="usa-button usa-button--outline width-24 font-xs display-inline-flex flex-align-center flex-justify-start padding-left-1"
target="_blank"
rel="noreferrer noopener"
data-ga-category="actions"
data-ga-action="click"
data-ga-label="publisher_link_desktop"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/launch.svg" alt="View on publisher site icon" class="usa-icon usa-icon--size-3 usa-icon--link"/>
<span class="display-inline-flex flex-justify-center flex-1 padding-right-2">View on publisher site</span>
</a>
</li>
<li>
<a
href="pdf/11277_2021_Article_9423.pdf"
class="usa-button usa-button--outline width-24 display-inline-flex flex-align-center flex-justify-start padding-left-1"
data-ga-category="actions"
data-ga-action="click"
data-ga-label="pdf_download_desktop"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/file_download.svg" alt="Download PDF icon" class="usa-icon usa-icon--size-3 usa-icon--link"/>
<span class="display-inline-flex flex-justify-center flex-1">PDF (1.8ย MB)</span>
</a>
</li>
<li>
<button role="button" class="usa-button width-24 citation-dialog-trigger display-inline-flex flex-align-center flex-justify-start padding-left-1"
aria-label="Open dialog with citation text in different styles"
data-ga-category="actions"
data-ga-action="open"
data-ga-label="cite_desktop"
data-all-citations-url="/resources/citations/8636071/"
data-citation-style="nlm"
data-download-format-link="/resources/citations/8636071/export/"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/format_quote.svg" alt="Cite icon" class="usa-icon usa-icon--size-3 usa-icon--white"/>
<span class="display-inline-flex flex-justify-center flex-1 button-label">Cite</span>
</button>
</li>
<li>
<button class="usa-button width-24 collections-dialog-trigger collections-button display-inline-flex flex-align-center flex-justify-start padding-left-1 collections-button-empty"
aria-label="Save article in MyNCBI collections."
data-ga-category="actions"
data-ga-action="click"
data-ga-label="collections_button_desktop"
data-collections-open-dialog-enabled="false"
data-collections-open-dialog-url="https://account.ncbi.nlm.nih.gov/?back_url=https%3A%2F%2Fpmc.ncbi.nlm.nih.gov%2Farticles%2FPMC8636071%2F%23open-collections-dialog"
data-in-collections="false">
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/action-bookmark-full.svg" alt="Collections icon" class="usa-icon usa-icon--size-3 usa-icon--white usa-icon--bookmark-full" hidden />
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/action-bookmark-empty.svg" alt="Collections icon" class="usa-icon usa-icon--size-3 usa-icon--white usa-icon--bookmark-empty" hidden />
<span class="display-inline-flex flex-justify-center flex-1">Collections</span>
</button>
</li>
<li class="pmc-permalink">
<button
type="button"
class="usa-button width-24 display-inline-flex flex-align-center flex-justify padding-left-1 shadow-none"
aria-label="Show article permalink"
aria-expanded="false"
aria-haspopup="true"
data-ga-category="actions"
data-ga-action="open"
data-ga-label="permalink_desktop"
>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/share.svg" alt="Permalink icon" class="usa-icon usa-icon--size-3 usa-icon--white"/>
<span class="display-inline-flex flex-justify-center flex-1 button-label">Permalink</span>
</button>
<div class="pmc-permalink__dropdown" hidden>
<div class="pmc-permalink__dropdown__container">
<h2 class="usa-modal__heading margin-top-0 margin-bottom-2 text-uppercase font-sans-xs">PERMALINK</h2>
<div class="pmc-permalink__dropdown__content">
<input type="text" class="usa-input" value="https://pmc.ncbi.nlm.nih.gov/articles/PMC8636071/" aria-label="Article permalink">
<button class="usa-button display-inline-flex pmc-permalink__dropdown__copy__btn margin-right-0" title="Copy article permalink" data-ga-category="save_share" data-ga-action="link" data-ga-label="copy_link">
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/content_copy.svg" alt="Copy icon" aria-hidden="true" class="usa-icon usa-icon--white" />
<span class="margin-left-1">Copy</span>
</button>
</div>
</div>
</div>
</li>
</ul>
</section>
</div>
<section class="pmc-resources margin-top-6 desktop:margin-top-4" data-page-path="/articles/PMC8636071/">
<h2 class="margin-top-0">RESOURCES</h2>
<div class="usa-accordion usa-accordion--multiselectable" data-allow-multiple>
<h3 class="usa-accordion__heading">
<button
type="button"
class="usa-accordion__button"
aria-expanded="false"
aria-controls="resources-similar-articles"
data-ga-category="resources_accordion"
data-ga-action="open_similar_articles"
data-ga-label="/articles/PMC8636071/"
data-action-open="open_similar_articles"
data-action-close="close_similar_articles"
>
Similar articles
</button>
</h3>
<div
id="resources-similar-articles"
class="usa-accordion__content usa-prose"
data-source-url="/resources/similar-article-links/34873380/"
>
</div>
<h3 class="usa-accordion__heading">
<button
type="button"
class="usa-accordion__button"
aria-expanded="false"
aria-controls="resources-cited-by-other-articles"
data-ga-category="resources_accordion"
data-ga-action="open_cited_by"
data-ga-label="/articles/PMC8636071/"
data-action-open="open_cited_by"
data-action-close="close_cited_by"
>
Cited by other articles
</button>
</h3>
<div
id="resources-cited-by-other-articles"
class="usa-accordion__content usa-prose"
data-source-url="/resources/cited-by-links/34873380/"
>
</div>
<h3 class="usa-accordion__heading">
<button
type="button"
class="usa-accordion__button"
aria-expanded="false"
aria-controls="resources-links-to-ncbi-databases"
data-ga-category="resources_accordion"
data-ga-action="open_NCBI_links"
data-ga-label="/articles/PMC8636071/"
data-action-open="open_NCBI_links"
data-action-close="close_NCBI_link"
>
Links to NCBI Databases
</button>
</h3>
<div
id="resources-links-to-ncbi-databases"
class="usa-accordion__content usa-prose"
data-source-url="/resources/db-links/8636071/"
>
</div>
</div>
</section>
<section
class="usa-in-page-nav usa-in-page-nav--wide margin-top-6 desktop:margin-top-4"
data-title-text="On this page"
data-title-heading-level="h2"
data-scroll-offset="0"
data-root-margin="-10% 0px -80% 0px"
data-main-content-selector="main"
data-threshold="1"
hidden
></section>
</section>
</div>
<div class="overlay" role="dialog" aria-label="Citation Dialog" hidden>
<div class="dialog citation-dialog" aria-hidden="true">
<div class="display-inline-flex flex-align-center flex-justify width-full margin-bottom-2">
<h2 class="usa-modal__heading margin-0">Cite</h2>
<button type="button" class="usa-button usa-button--unstyled close-overlay text-black width-auto" tabindex="1">
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/close.svg" alt="Close icon" class="usa-icon usa-icon--size-3 usa-icon--button" />
</button>
</div>
<div class="citation-text-block">
<div class="citation-text margin-bottom-2"></div>
<ul class="usa-list usa-list--unstyled display-inline-flex flex-justify width-full flex-align-center">
<li>
<button
class="usa-button usa-button--unstyled text-no-underline display-flex flex-align-center copy-button dialog-focus"
data-ga-category="save_share"
data-ga-action="cite"
data-ga-label="copy"
tabindex="2">
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/content_copy.svg" alt="Copy icon" class="usa-icon usa-icon--size-3 usa-icon--link" />
<span>Copy</span>
</button>
</li>
<li>
<a
href="#"
role="button"
class="usa-button usa-button--unstyled text-no-underline display-flex flex-align-center export-button"
data-ga-category="save_share"
data-ga-action="cite"
data-ga-label="download"
title="Download a file for external citation management software"
tabindex="3">
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/file_download.svg" alt="Download icon" aria-hidden="true" class="usa-icon usa-icon--size-3 usa-icon--link" />
<span class="display-none mobile-lg:display-inline">Download .nbib</span>
<span class="display-inline mobile-lg:display-none">.nbib</span>
</a>
</li>
<li>
<div class="display-inline-flex flex-align-center">
<label class="usa-label margin-top-0">Format:</label>
<select aria-label="Format" class="usa-select citation-style-selector padding-1 margin-top-0 border-0 padding-right-4" tabindex="4" >
<option data-style-url-name="ama"
value="AMA"
>
AMA
</option>
<option data-style-url-name="apa"
value="APA"
>
APA
</option>
<option data-style-url-name="mla"
value="MLA"
>
MLA
</option>
<option data-style-url-name="nlm"
value="NLM"
selected="selected">
NLM
</option>
</select>
</div>
</li>
</ul>
</div>
</div>
</div>
<div class="overlay" role="dialog" hidden>
<div id="collections-action-dialog" class="dialog collections-dialog" aria-hidden="true">
<div class="display-inline-flex flex-align-center flex-justify width-full margin-bottom-2">
<h2 class="usa-modal__heading margin-0">Add to Collections</h2>
</div>
<div class="collections-action-panel action-panel">
<form id="collections-action-dialog-form"
class="usa-form maxw-full collections-action-panel-form action-panel-content action-form action-panel-smaller-selectors"
data-existing-collections-url="/list-existing-collections/"
data-add-to-existing-collection-url="/add-to-existing-collection/"
data-create-and-add-to-new-collection-url="/create-and-add-to-new-collection/"
data-myncbi-max-collection-name-length="100"
data-collections-root-url="https://www.ncbi.nlm.nih.gov/myncbi/collections/">
<input type="hidden" name="csrfmiddlewaretoken" value="MI2aCXSpxWqt5BmH1Ns8GxtdLVC4ICIIMONwF1PzKPX6jylQPdLmeTQ45iVjMUeM">
<fieldset class="usa-fieldset margin-bottom-2">
<div class="usa-radio">
<input type="radio"
id="collections-action-dialog-new"
class="usa-radio__input usa-radio__input--tile collections-new margin-top-0"
name="collections"
value="new"
data-ga-category="collections_button"
data-ga-action="click"
data-ga-label="collections_radio_new" />
<label class="usa-radio__label" for="collections-action-dialog-new">Create a new collection</label>
</div>
<div class="usa-radio">
<input type="radio"
id="collections-action-dialog-existing"
class="usa-radio__input usa-radio__input--tile collections-existing"
name="collections"
value="existing"
checked="true"
data-ga-category="collections_button"
data-ga-action="click"
data-ga-label="collections_radio_existing" />
<label class="usa-radio__label" for="collections-action-dialog-existing">Add to an existing collection</label>
</div>
</fieldset>
<fieldset class="usa-fieldset margin-bottom-2">
<div class="action-panel-control-wrap new-collections-controls">
<label for="collections-action-dialog-add-to-new" class="usa-label margin-top-0">
Name your collection
<abbr title="required" class="usa-hint usa-hint--required text-no-underline">*</abbr>
</label>
<input
type="text"
name="add-to-new-collection"
id="collections-action-dialog-add-to-new"
class="usa-input collections-action-add-to-new"
pattern="[^"&=<>/]*" title="The following characters are not allowed in the Name field: "&=<>/"
maxlength=""
data-ga-category="collections_button"
data-ga-action="create_collection"
data-ga-label="non_favorties_collection"
required
/>
</div>
<div class="action-panel-control-wrap existing-collections-controls">
<label for="collections-action-dialog-add-to-existing" class="usa-label margin-top-0">
Choose a collection
</label>
<select id="collections-action-dialog-add-to-existing"
class="usa-select collections-action-add-to-existing"
data-ga-category="collections_button"
data-ga-action="select_collection"
data-ga-label="($('.collections-action-add-to-existing').val() === 'Favorites') ? 'Favorites' : 'non_favorites_collection'">
</select>
<div class="collections-retry-load-on-error usa-input-error-message selection-validation-message">
Unable to load your collection due to an error<br>
<a href="#">Please try again</a>
</div>
</div>
</fieldset>
<div class="display-inline-flex">
<button class="usa-button margin-top-0 action-panel-submit"
type="submit"
data-loading-label="Adding..."
data-pinger-ignore
data-ga-category="collections_button"
data-ga-action="click"
data-ga-label="add">
Add
</button>
<button class="usa-button usa-button--outline margin-top-0 action-panel-cancel"
aria-label="Close 'Add to Collections' panel"
ref="linksrc=close_collections_panel"
data-ga-category="collections_button"
data-ga-action="click"
data-ga-label="cancel">
Cancel
</button>
</div>
</form>
</div>
</div>
</div>
</div>
</div>
</div>
<footer class="ncbi-footer ncbi-dark-background " >
<div class="ncbi-footer__icon-section">
<div class="ncbi-footer__social-header">
Follow NCBI
</div>
<div class="grid-container ncbi-footer__ncbi-social-icons-container">
<a href="https://twitter.com/ncbi"
class="ncbi-footer__social-icon ncbi-footer__social-icon--gray"
target="_blank"
rel="noreferrer noopener">
<svg width="40"
height="40"
viewBox="0 0 40 40"
fill="none"
xmlns="http://www.w3.org/2000/svg"
focusable="false"
aria-hidden="true">
<path d="m6.067 8 10.81 13.9L6 33.2h4.2l8.4-9.1 7.068 9.1H34L22.8 18.5 31.9 8h-3.5l-7.7 8.4L14.401 8H6.067Zm3.6 1.734h3.266l16.8 21.732H26.57L9.668 9.734Z">
</path>
</svg>
<span class="usa-sr-only">NCBI on X (formerly known as Twitter)</span>
</a>
<a href="https://www.facebook.com/ncbi.nlm"
class="ncbi-footer__social-icon ncbi-footer__social-icon--gray"
target="_blank"
rel="noreferrer noopener">
<svg width="16"
height="29"
focusable="false"
aria-hidden="true"
viewBox="0 0 16 29"
fill="none"
xmlns="http://www.w3.org/2000/svg">
<path d="M3.8809 21.4002C3.8809 19.0932 3.8809 16.7876 3.8809 14.478C3.8809 14.2117 3.80103 14.1452 3.54278 14.1492C2.53372 14.1638 1.52334 14.1492 0.514288 14.1598C0.302626 14.1598 0.248047 14.0972 0.248047 13.8936C0.256034 12.4585 0.256034 11.0239 0.248047 9.58978C0.248047 9.37013 0.302626 9.30224 0.528931 9.3049C1.53798 9.31688 2.54837 9.3049 3.55742 9.31555C3.80103 9.31555 3.8809 9.26097 3.87957 9.00272C3.87158 8.00565 3.85428 7.00592 3.90753 6.00884C3.97142 4.83339 4.31487 3.73115 5.04437 2.78467C5.93095 1.63318 7.15699 1.09005 8.56141 0.967577C10.5582 0.79319 12.555 0.982221 14.5518 0.927641C14.7102 0.927641 14.7462 0.99287 14.7449 1.13664C14.7449 2.581 14.7449 4.02668 14.7449 5.47104C14.7449 5.67604 14.6517 5.68669 14.4946 5.68669C13.4523 5.68669 12.4113 5.68669 11.3703 5.68669C10.3506 5.68669 9.92057 6.10868 9.90593 7.13904C9.89661 7.7647 9.91525 8.39303 9.89794 9.01869C9.88995 9.26364 9.96583 9.31822 10.2015 9.31688C11.7204 9.30623 13.2393 9.31688 14.7595 9.3049C15.0257 9.3049 15.0723 9.3728 15.0444 9.62439C14.89 10.9849 14.7515 12.3467 14.6144 13.7085C14.5691 14.1571 14.5785 14.1585 14.1458 14.1585C12.8386 14.1585 11.5313 14.1665 10.2254 14.1518C9.95119 14.1518 9.89794 14.2317 9.89794 14.4899C9.90593 19.0799 9.89794 23.6752 9.91125 28.2612C9.91125 28.5674 9.8407 28.646 9.53186 28.6433C7.77866 28.6273 6.02414 28.6366 4.27094 28.634C3.82499 28.634 3.87158 28.6992 3.87158 28.22C3.87602 25.9472 3.87913 23.6739 3.8809 21.4002Z">
</path>
</svg>
<span class="usa-sr-only">NCBI on Facebook</span>
</a>
<a href="https://www.linkedin.com/company/ncbinlm"
class="ncbi-footer__social-icon ncbi-footer__social-icon--gray"
target="_blank"
rel="noreferrer noopener">
<svg width="25"
height="23"
viewBox="0 0 26 24"
fill="none"
xmlns="http://www.w3.org/2000/svg"
focusable="false"
aria-hidden="true">
<path d="M14.6983 9.98423C15.6302 9.24808 16.5926 8.74754 17.6762 8.51991C19.673 8.09126 21.554 8.30824 23.1262 9.7526C24.2351 10.7723 24.7529 12.1115 25.0165 13.5612C25.1486 14.3363 25.2105 15.1218 25.2015 15.9081C25.2015 18.3043 25.2015 20.6898 25.2082 23.0806C25.2082 23.3468 25.1549 23.444 24.8621 23.4414C23.1297 23.4272 21.3992 23.4272 19.6704 23.4414C19.4041 23.4414 19.3429 23.3588 19.3442 23.1019C19.3535 20.5194 19.3442 17.9368 19.3442 15.3543C19.3442 14.0005 18.3258 12.9448 17.0266 12.9488C15.7273 12.9528 14.6983 14.0071 14.6983 15.361C14.6983 17.9328 14.6917 20.5047 14.6983 23.0753C14.6983 23.3708 14.6198 23.444 14.3296 23.4427C12.6185 23.4294 10.9079 23.4294 9.19779 23.4427C8.93155 23.4427 8.86099 23.3735 8.86232 23.1086C8.8783 19.7619 8.88628 16.4144 8.88628 13.066C8.88628 11.5688 8.87874 10.0708 8.86365 8.57182C8.86365 8.3575 8.90758 8.27896 9.14054 8.28029C10.9048 8.29094 12.6687 8.29094 14.4321 8.28029C14.6464 8.28029 14.6983 8.34818 14.6983 8.54653C14.6903 9.00047 14.6983 9.45441 14.6983 9.98423Z">
</path>
<path d="M6.55316 15.8443C6.55316 18.2564 6.55316 20.6699 6.55316 23.082C6.55316 23.3629 6.48127 23.4388 6.19906 23.4374C4.47737 23.4241 2.75568 23.4241 1.03399 23.4374C0.767751 23.4374 0.69986 23.3629 0.701191 23.1006C0.709178 18.2648 0.709178 13.4281 0.701191 8.59053C0.701191 8.34026 0.765089 8.27237 1.01669 8.2737C2.74991 8.28435 4.48048 8.28435 6.20838 8.2737C6.47462 8.2737 6.5465 8.33627 6.54517 8.6065C6.54783 11.0186 6.55316 13.4308 6.55316 15.8443Z">
</path>
<path d="M3.65878 0.243898C5.36804 0.243898 6.58743 1.45529 6.58743 3.1406C6.58743 4.75801 5.32145 5.95742 3.60819 5.96807C3.22177 5.97614 2.83768 5.90639 2.47877 5.76299C2.11985 5.61959 1.79344 5.40546 1.51897 5.13334C1.24449 4.86123 1.02755 4.53668 0.881058 4.17902C0.734563 3.82136 0.661505 3.43788 0.666231 3.05141C0.67555 1.42601 1.9362 0.242566 3.65878 0.243898Z">
</path>
</svg>
<span class="usa-sr-only">NCBI on LinkedIn</span>
</a>
<a href="https://github.com/ncbi"
class="ncbi-footer__social-icon ncbi-footer__social-icon--gray"
target="_blank"
rel="noreferrer noopener">
<svg width="28"
height="27"
viewBox="0 0 28 28"
fill="none"
xmlns="http://www.w3.org/2000/svg"
focusable="false"
aria-hidden="true">
<path d="M16.7228 20.6334C17.5057 20.5527 18.2786 20.3944 19.0301 20.1608C21.3108 19.4193 22.5822 17.8259 22.963 15.4909C23.1228 14.5112 23.1814 13.5287 22.9883 12.5437C22.8106 11.6423 22.4013 10.8028 21.8007 10.1076C21.7526 10.0605 21.7197 10 21.7064 9.934C21.6931 9.86799 21.7 9.79952 21.7262 9.73748C22.0856 8.6206 21.9711 7.51969 21.601 6.42677C21.582 6.3497 21.5345 6.2827 21.468 6.23923C21.4016 6.19577 21.3211 6.17906 21.2429 6.19248C20.7329 6.21649 20.2313 6.33051 19.7611 6.52928C19.1103 6.7908 18.4899 7.12198 17.9104 7.51703C17.84 7.56996 17.7581 7.60551 17.6713 7.62078C17.5846 7.63605 17.4954 7.6306 17.4112 7.60489C15.2596 7.05882 13.0054 7.06203 10.8554 7.61421C10.7806 7.63586 10.7018 7.63967 10.6253 7.62534C10.5487 7.611 10.4766 7.57892 10.4148 7.53167C9.64788 7.03247 8.85171 6.58918 7.96368 6.33359C7.65781 6.24338 7.34123 6.19458 7.02239 6.18849C6.94879 6.17986 6.87462 6.19893 6.81432 6.242C6.75402 6.28507 6.71191 6.34904 6.69621 6.42145C6.32342 7.51437 6.2209 8.61527 6.56307 9.73348C6.59635 9.84264 6.64694 9.93316 6.54177 10.0516C5.47666 11.2604 5.09988 12.6834 5.19574 14.2676C5.2663 15.4244 5.46201 16.5466 6.01454 17.5769C6.84399 19.1171 8.21664 19.9119 9.85158 20.3352C10.3938 20.4706 10.9444 20.5698 11.4998 20.632C11.5384 20.7492 11.4506 20.7798 11.408 20.8291C11.1734 21.1179 10.9894 21.4441 10.8634 21.7942C10.7622 22.0458 10.8315 22.4039 10.6065 22.5516C10.263 22.7766 9.83827 22.8485 9.42421 22.8871C8.17936 23.0056 7.26471 22.4877 6.6283 21.4348C6.25552 20.8184 5.76956 20.3325 5.08523 20.0663C4.76981 19.9325 4.42139 19.8967 4.08537 19.9638C3.7898 20.029 3.73788 20.1901 3.93891 20.4111C4.03639 20.5234 4.14989 20.6207 4.27575 20.6999C4.9796 21.1318 5.51717 21.7884 5.80152 22.5636C6.37002 23.9973 7.48039 24.5697 8.93825 24.6323C9.43741 24.6575 9.93768 24.615 10.4254 24.5058C10.5892 24.4672 10.6531 24.4872 10.6517 24.6762C10.6451 25.4936 10.6637 26.3123 10.6517 27.131C10.6517 27.6635 10.1684 27.9297 9.58663 27.7393C8.17396 27.2671 6.84977 26.5631 5.66838 25.656C2.59555 23.2891 0.720966 20.1861 0.217704 16.3376C-0.357453 11.9127 0.911353 8.00824 3.98551 4.73881C6.11909 2.42656 8.99932 0.939975 12.1203 0.540191C16.5351 -0.0601815 20.4347 1.14323 23.7232 4.16373C26.2449 6.47869 27.724 9.37672 28.1048 12.7726C28.5828 17.0325 27.3686 20.7945 24.4768 23.9827C22.9762 25.6323 21.0956 26.8908 18.9982 27.6488C18.8783 27.6927 18.7585 27.738 18.636 27.7726C18.0356 27.9404 17.6189 27.6395 17.6189 27.0098C17.6189 25.7452 17.6308 24.4806 17.6295 23.2159C17.6329 22.9506 17.6128 22.6856 17.5696 22.4238C17.4325 21.6664 17.3419 21.484 16.7228 20.6334Z">
</path>
</svg>
<span class="usa-sr-only">NCBI on GitHub</span>
</a>
<a href="https://ncbiinsights.ncbi.nlm.nih.gov/"
class="ncbi-footer__social-icon ncbi-footer__social-icon--gray"
target="_blank"
rel="noreferrer noopener">
<svg width="26"
height="26"
viewBox="0 0 27 27"
fill="none"
xmlns="http://www.w3.org/2000/svg"
focusable="false"
aria-hidden="true">
<path d="M23.7778 26.4574C23.1354 26.3913 22.0856 26.8024 21.636 26.3087C21.212 25.8444 21.4359 24.8111 21.324 24.0347C19.9933 14.8323 14.8727 8.80132 6.09057 5.85008C4.37689 5.28406 2.58381 4.99533 0.779072 4.99481C0.202773 4.99481 -0.0229751 4.83146 0.00455514 4.21479C0.0660406 3.08627 0.0660406 1.95525 0.00455514 0.826734C-0.0413285 0.0815827 0.259669 -0.0193618 0.896534 0.00266238C6.96236 0.222904 12.3693 2.24179 16.9889 6.16209C22.9794 11.2478 26.1271 17.7688 26.4372 25.648C26.4629 26.294 26.3179 26.5271 25.6609 26.4684C25.0827 26.417 24.4991 26.4574 23.7778 26.4574Z">
</path>
<path d="M14.8265 26.441C14.0924 26.441 13.2371 26.6795 12.6626 26.3786C12.0092 26.0372 12.3781 25.0644 12.246 24.378C11.1154 18.5324 6.6849 14.5497 0.74755 14.1001C0.217135 14.0615 -0.0104482 13.9422 0.0134113 13.3659C0.0519536 12.1454 0.0482829 10.9213 0.0134113 9.69524C-0.00127145 9.14464 0.196946 9.03268 0.703502 9.04736C9.21217 9.27128 16.5994 16.2511 17.2804 24.7231C17.418 26.4446 17.418 26.4446 15.6579 26.4446H14.832L14.8265 26.441Z">
</path>
<path d="M3.58928 26.4555C2.64447 26.4618 1.73584 26.0925 1.06329 25.4289C0.39073 24.7653 0.00933763 23.8617 0.0030097 22.9169C-0.00331824 21.9721 0.365937 21.0635 1.02954 20.3909C1.69315 19.7184 2.59675 19.337 3.54156 19.3306C4.48637 19.3243 5.39499 19.6936 6.06755 20.3572C6.7401 21.0208 7.1215 21.9244 7.12782 22.8692C7.13415 23.814 6.7649 24.7226 6.10129 25.3952C5.43768 26.0677 4.53409 26.4491 3.58928 26.4555Z">
</path>
</svg>
<span class="usa-sr-only">NCBI RSS feed</span>
</a>
</div>
</div>
<div data-testid="gridContainer"
class="grid-container ncbi-footer__container">
<div class="grid-row ncbi-footer__main-content-container"
data-testid="grid">
<div class="ncbi-footer__column">
<p class="ncbi-footer__circled-icons-heading">
Connect with NLM
</p>
<div class="ncbi-footer__circled-icons-list">
<a href=https://twitter.com/nlm_nih class="ncbi-footer__social-icon ncbi-footer__social-icon--circled" target="_blank" rel="noreferrer noopener">
<svg width="32"
height="32"
viewBox="0 0 40 40"
fill="none"
xmlns="http://www.w3.org/2000/svg"
focusable="false"
aria-hidden="true">
<path d="m6.067 8 10.81 13.9L6 33.2h4.2l8.4-9.1 7.068 9.1H34L22.8 18.5 31.9 8h-3.5l-7.7 8.4L14.401 8H6.067Zm3.6 1.734h3.266l16.8 21.732H26.57L9.668 9.734Z">
</path>
</svg>
<span class="usa-sr-only">NLM on X (formerly known as Twitter)</span>
</a>
<a href=https://www.facebook.com/nationallibraryofmedicine class="ncbi-footer__social-icon ncbi-footer__social-icon--circled" target="_blank" rel="noreferrer noopener">
<svg width="13"
height="24"
viewBox="0 0 13 24"
fill="none"
xmlns="http://www.w3.org/2000/svg"
focusable="false"
aria-hidden="true">
<path d="M4.11371 23.1369C4.11371 23.082 4.11371 23.0294 4.11371 22.9745V12.9411H0.817305C0.6709 12.9411 0.670898 12.9411 0.670898 12.8016C0.670898 11.564 0.670898 10.3287 0.670898 9.09341C0.670898 8.97903 0.705213 8.95158 0.815017 8.95158C1.8673 8.95158 2.91959 8.95158 3.97417 8.95158H4.12057V8.83263C4.12057 7.8055 4.12057 6.7738 4.12057 5.74897C4.1264 4.92595 4.31387 4.11437 4.66959 3.37217C5.12916 2.38246 5.94651 1.60353 6.95717 1.1921C7.64827 0.905008 8.3913 0.764035 9.13953 0.778051C10.0019 0.791777 10.8644 0.830666 11.7268 0.860404C11.8869 0.860404 12.047 0.894717 12.2072 0.90158C12.2964 0.90158 12.3261 0.940469 12.3261 1.02968C12.3261 1.5421 12.3261 2.05452 12.3261 2.56465C12.3261 3.16857 12.3261 3.7725 12.3261 4.37642C12.3261 4.48165 12.2964 4.51367 12.1912 4.51138C11.5369 4.51138 10.8804 4.51138 10.2261 4.51138C9.92772 4.51814 9.63058 4.5526 9.33855 4.61433C9.08125 4.6617 8.84537 4.78881 8.66431 4.97766C8.48326 5.16652 8.3662 5.40755 8.32972 5.66661C8.28476 5.89271 8.26027 6.1224 8.25652 6.35289C8.25652 7.19014 8.25652 8.02969 8.25652 8.86923C8.25652 8.89439 8.25652 8.91955 8.25652 8.95615H12.0219C12.1797 8.95615 12.182 8.95616 12.1614 9.10714C12.0768 9.76596 11.9876 10.4248 11.9029 11.0813C11.8312 11.6319 11.7626 12.1824 11.697 12.733C11.6719 12.9434 11.6787 12.9434 11.4683 12.9434H8.26338V22.899C8.26338 22.979 8.26338 23.0591 8.26338 23.1392L4.11371 23.1369Z">
</path>
</svg>
<span class="usa-sr-only">NLM on Facebook</span>
</a>
<a href=https://www.youtube.com/user/NLMNIH class="ncbi-footer__social-icon ncbi-footer__social-icon--circled" target="_blank" rel="noreferrer noopener">
<svg width="21"
height="15"
viewBox="0 0 21 15"
fill="none"
xmlns="http://www.w3.org/2000/svg"
focusable="false"
aria-hidden="true">
<path d="M19.2561 1.47914C18.9016 1.15888 18.5699 0.957569 17.2271 0.834039C15.5503 0.678484 13.2787 0.655608 11.563 0.65332H9.43556C7.71987 0.65332 5.4483 0.678484 3.77151 0.834039C2.43098 0.957569 2.097 1.15888 1.74242 1.47914C0.813665 2.32097 0.619221 4.62685 0.598633 6.89384C0.598633 7.31781 0.598633 7.74101 0.598633 8.16345C0.626084 10.4121 0.827391 12.686 1.74242 13.521C2.097 13.8412 2.4287 14.0425 3.77151 14.1661C5.4483 14.3216 7.71987 14.3445 9.43556 14.3468H11.563C13.2787 14.3468 15.5503 14.3216 17.2271 14.1661C18.5676 14.0425 18.9016 13.8412 19.2561 13.521C20.1712 12.6929 20.3725 10.451 20.3999 8.22064C20.3999 7.74025 20.3999 7.25986 20.3999 6.77946C20.3725 4.54907 20.1689 2.30724 19.2561 1.47914ZM8.55942 10.5311V4.65201L13.5601 7.50005L8.55942 10.5311Z"
fill="white" />
</svg>
<span class="usa-sr-only">NLM on YouTube</span>
</a>
</div>
</div>
<address class="ncbi-footer__address ncbi-footer__column">
<p>
<a class="usa-link usa-link--external"
href="https://www.google.com/maps/place/8600+Rockville+Pike,+Bethesda,+MD+20894/%4038.9959508,
-77.101021,17z/data%3D!3m1!4b1!4m5!3m4!1s0x89b7c95e25765ddb%3A0x19156f88b27635b8!8m2!3d38.9959508!
4d-77.0988323"
rel="noopener noreferrer" target="_blank">National Library of Medicine
<br/> 8600 Rockville Pike<br/> Bethesda, MD 20894</a>
</p>
</address>
<ul class="usa-list usa-list--unstyled ncbi-footer__vertical-list ncbi-footer__column">
<li class="ncbi-footer__vertical-list-item">
<a href="https://www.nlm.nih.gov/web_policies.html" class="usa-link usa-link--alt ncbi-footer__link" >
Web Policies
</a>
</li>
<li class="ncbi-footer__vertical-list-item">
<a href="https://www.nih.gov/institutes-nih/nih-office-director/office-communications-public-liaison/freedom-information-act-office" class="usa-link usa-link--alt ncbi-footer__link" >
FOIA
</a>
</li>
<li class="ncbi-footer__vertical-list-item">
<a href="https://www.hhs.gov/vulnerability-disclosure-policy/index.html" class="usa-link usa-link--external usa-link--alt ncbi-footer__link" rel="noreferrer noopener" target='_blank' >
HHS Vulnerability Disclosure
</a>
</li>
</ul>
<ul class="usa-list usa-list--unstyled ncbi-footer__vertical-list ncbi-footer__column">
<li class="ncbi-footer__vertical-list-item">
<a href="https://support.nlm.nih.gov/" class="usa-link usa-link--alt ncbi-footer__link" >
Help
</a>
</li>
<li class="ncbi-footer__vertical-list-item">
<a href="https://www.nlm.nih.gov/accessibility.html" class="usa-link usa-link--alt ncbi-footer__link" >
Accessibility
</a>
</li>
<li class="ncbi-footer__vertical-list-item">
<a href="https://www.nlm.nih.gov/careers/careers.html" class="usa-link usa-link--alt ncbi-footer__link" >
Careers
</a>
</li>
</ul>
</div>
<div class="grid-row grid-col-12" data-testid="grid">
<ul class="ncbi-footer__bottom-links-list">
<li class="ncbi-footer__bottom-list-item">
<a href="https://www.nlm.nih.gov/" class="usa-link usa-link--alt ncbi-footer__link" >
NLM
</a>
</li>
<li class="ncbi-footer__bottom-list-item">
<a href="https://www.nih.gov/" class="usa-link usa-link--alt ncbi-footer__link" >
NIH
</a>
</li>
<li class="ncbi-footer__bottom-list-item">
<a href="https://www.hhs.gov/" class="usa-link usa-link--external usa-link--alt ncbi-footer__link" rel="noreferrer noopener" target='_blank' >
HHS
</a>
</li>
<li class="ncbi-footer__bottom-list-item">
<a href="https://www.usa.gov/" class="usa-link usa-link--external usa-link--alt ncbi-footer__link" rel="noreferrer noopener" target='_blank' >
USA.gov
</a>
</li>
</ul>
</div>
</div>
</footer>
<script type="text/javascript" src="https://cdn.ncbi.nlm.nih.gov/core/pinger/pinger.js"> </script>
<button class="back-to-top" data-ga-category="pagination" data-ga-action="back_to_top">
<label>Back to Top</label>
<img src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/img/arrow_upward.svg" alt="back to top icon" class="usa-icon usa-icon--size-3 order-0 usa-icon--white" />
</button>
<div id="icon-container" style="display: none;"></div>
<script type="application/javascript">
window.ncbi = window.ncbi || {};
window.ncbi.pmc = window.ncbi.pmc || {};
window.ncbi.pmc.options = {
logLevel: 'INFO',
staticEndpoint: 'https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/',
citeCookieName: 'pmc-cf',
};
</script>
<script type="module" crossorigin="" src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/base-Cp_Il6gk.js"></script>
<link href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/vendor-Co8Vdmw2.js" type="text/javascript" crossorigin="anonymous" rel="modulepreload" as="script" />
<script type="text/javascript" src="https://cdn.ncbi.nlm.nih.gov/core/jquery/jquery-3.6.0.min.js"> </script>
<script type="text/javascript">
jQuery.getScript("https://cdn.ncbi.nlm.nih.gov/core/alerts/alerts.js", function () {
galert(['div.nav_and_browser', 'div.header', '#universal_header', '.usa-banner', 'body > *:nth-child(1)'])
});
</script>
<script type="text/javascript">var exports = {};</script>
<script src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/CACHE/js/output.4e25b6297b38.js"></script>
<script type="module" crossorigin="" src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/article-BxyWTbsj.js"></script>
<link href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/vendor-Co8Vdmw2.js" type="text/javascript" crossorigin="anonymous" rel="modulepreload" as="script" />
<link href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/index-DXSA0fsx.js" type="text/javascript" crossorigin="anonymous" rel="modulepreload" as="script" />
<link href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/secure-cookie-Br6x5jtB.js" type="text/javascript" crossorigin="anonymous" rel="modulepreload" as="script" />
<script type="module" crossorigin="" src="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/math-CjjrG8hn.js"></script>
<link href="https://cdn.ncbi.nlm.nih.gov/pmc/pd-medc-pmc-cloudpmc-viewer/production/a2b04810/var/data/static/assets/vendor-Co8Vdmw2.js" type="text/javascript" crossorigin="anonymous" rel="modulepreload" as="script" />
</body>
</html>