<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-022-08-1072</article-id>
      <article-id pub-id-type="publisher-id">23427</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>D.1 - PROGRAMMING TECHNIQUES</subject>
          <subject>D.4 - OPERATING SYSTEMS</subject>
          <subject>H.4.3 - Communications Applications</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>CMSN: An Efficient and Effective Agent Lookup for Mobile Agent Middleware</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Fukuda</surname>
            <given-names>Hiroaki</given-names>
          </name>
          <email xlink:type="simple">hiroaki@shibaura-it.ac.jp</email>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Leger</surname>
            <given-names>Paul</given-names>
          </name>
          <uri content-type="orcid">https://orcid.org/0000-0003-0969-5139</uri>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Namiki</surname>
            <given-names>Keita</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">JTEC CORPORATION, Tokyo, Japan</addr-line>
        <institution>JTEC CORPORATION</institution>
        <addr-line content-type="city">Tokyo</addr-line>
        <country>Japan</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Hiroaki Fukuda (<email xlink:type="simple">hiroaki@shibaura-it.ac.jp</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2016</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>08</month>
        <year>2016</year>
      </pub-date>
      <volume>22</volume>
      <issue>8</issue>
      <fpage>1072</fpage>
      <lpage>1096</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/542D612B-93AF-5638-8FF1-EA32D3911188">542D612B-93AF-5638-8FF1-EA32D3911188</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/5505443">5505443</uri>
      <history>
        <date date-type="received">
          <day>27</day>
          <month>04</month>
          <year>2015</year>
        </date>
        <date date-type="accepted">
          <day>29</day>
          <month>07</month>
          <year>2016</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>Hiroaki Fukuda, Paul Leger, Keita Namiki</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>A Wireless Sensor Network (WSN) is typically deployed in a location in which no electrical source is provided, meaning that sufficient battery life is crucial. Applications for WSNs require implementations of complex operations such as network administration. To simplify the development of these applications, several mobile agent middleware solutions have been proposed. Applications for these middleware frameworks are executed by communication among agents; therefore, a common operation is to look up agents. Because existing proposals do not have much technical support for an efficient approach to look up agents, every lookup consumes a significant amount of battery power and time. In addition, current approaches can fail in their lookup operations if the target agent moves during a lookup operation. This paper proposes Chord for Mobile agent on Sensor Network (CMSN), an efficient and effective lookup for mobile agent middleware. CMSN is inspired by Chord for Sensor Networks (CSN), which introduces hierarchical ring structures and a distributed hash table algorithm to improve lookup performance. Unfortunately, CSN cannot be applied to mobile agent middleware solutions because CSN always requires a base station and assumes no agent migration between nodes. Unlikely CSN, CMSN is designed for an environment where agents can freely move between nodes without dependency on a special node such as a base station. In addition, CMSN leverages a feature where the location of a node is stationary in order to improve lookup performance with simplified algorithms. We evaluate and compare CMSN in terms of performance, effective lookups, and battery consumption.</p>
      </abstract>
    </article-meta>
  </front>
</article>
