<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-04-14T08:15:28Z</responseDate>
  <request metadataPrefix="oai_dc" identifier="oai:meral.edu.mm:recid/5215" verb="GetRecord">https://meral.edu.mm/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:meral.edu.mm:recid/5215</identifier>
        <datestamp>2021-12-13T00:58:28Z</datestamp>
        <setSpec>1582963413512:1596119372420</setSpec>
        <setSpec>user-ytu</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Wireless ad hoc network positioning algorithm based on self-organizing Map and received signal strength</dc:title>
          <dc:creator>Nyein Aye Maung Maung</dc:creator>
          <dc:creator>Makoto Kawai</dc:creator>
          <dc:description>Abstract Positioning or localization of wireless ad hoc networks has gained much research attentions for several years. This paper proposes a hybrid positioning algorithm which exploits Received Signal Strength (RSS)-based ranging and Self Organizing Maps (SOM)-based range free localization methods to obtain the tradeoff between cost, power and location accuracy. Distance information from RSS measurement has been utilized in the learning steps of SOM-based localization algorithm to get more accurate location estimates while reducing number of learning steps. Method on RSS uncertainty reduction is also incorporated in the proposed hybrid RSS-SOM algorithm. Results from extensive simulations prove that the hybrid RSS-SOM algorithm outperforms several existing positioning algorithms for all node density, anchor utilization and the number of learning steps.</dc:description>
          <dc:date>2012-10-01</dc:date>
          <dc:identifier>http://hdl.handle.net/20.500.12678/0000005215</dc:identifier>
          <dc:identifier>https://meral.edu.mm/records/5215</dc:identifier>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
