<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01418404</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-23T02:05:57+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Never Live without Neighbors: From Single- to Multi-channel Neighbor Discovery for Mobile Sensing Applications</title>
            <author role="aut">
              <persName>
                <forename type="first">Lin</forename>
                <surname>Chen</surname>
              </persName>
              <email type="md5">df588d974a1012e832e350e57ace13b0</email>
              <email type="domain">lri.fr</email>
              <idno type="idhal" notation="string">lin-chen</idno>
              <idno type="idhal" notation="numeric">2388</idno>
              <idno type="halauthorid" notation="string">9324-2388</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-7943-3172</idno>
              <idno type="IDREF">https://www.idref.fr/160951232</idno>
              <affiliation ref="#struct-399697"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Kaigui</forename>
                <surname>Bian</surname>
              </persName>
              <idno type="halauthorid">885071-0</idno>
              <affiliation ref="#struct-300884"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Meng</forename>
                <surname>Zheng</surname>
              </persName>
              <idno type="halauthorid">885072-0</idno>
              <affiliation ref="#struct-239582"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Lin</forename>
                <surname>CHEN</surname>
              </persName>
              <email type="md5">df588d974a1012e832e350e57ace13b0</email>
              <email type="domain">lri.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-12-16 16:44:52</date>
              <date type="whenModified">2026-01-15 17:01:57</date>
              <date type="whenReleased">2016-12-16 16:44:52</date>
              <date type="whenProduced">2016-10-01</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="306110">
                <persName>
                  <forename>Lin</forename>
                  <surname>CHEN</surname>
                </persName>
                <email type="md5">df588d974a1012e832e350e57ace13b0</email>
                <email type="domain">lri.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01418404</idno>
            <idno type="halUri">https://hal.science/hal-01418404</idno>
            <idno type="halBibtex">chen:hal-01418404</idno>
            <idno type="halRefHtml">&lt;i&gt;IEEE/ACM Transactions on Networking&lt;/i&gt;, 2016, 24 (5), pp.3148 - 3161. &lt;a target="_blank" href="https://dx.doi.org/10.1109/TNET.2015.2505170"&gt;&amp;#x27E8;10.1109/TNET.2015.2505170&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">IEEE/ACM Transactions on Networking, 2016, 24 (5), pp.3148 - 3161. &amp;#x27E8;10.1109/TNET.2015.2505170&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-PSUD">Université Paris Sud - Paris XI</idno>
            <idno type="stamp" n="UMR8623">Laboratoire de Recherche en Informatique</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="LRI-GALAC" corresp="UMR8623">Equipe : Graphes, Algorithmes et Combinatoire</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIV-PSUD-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris Sud pour Paris Saclay</idno>
            <idno type="stamp" n="CENTRALESUPELEC-SACLAY" corresp="UNIV-PARIS-SACLAY">CENTRALESUPELEC-SACLAY</idno>
            <idno type="stamp" n="LISN">Laboratoire Interdisciplinaire des Sciences du Numérique</idno>
            <idno type="stamp" n="GS-ENGINEERING">Graduate School Sciences de l'Ingénierie et des Systèmes</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="LISN-GALAC" corresp="LISN">Graphes, Algorithmes et Combinatoire </idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Never Live without Neighbors: From Single- to Multi-channel Neighbor Discovery for Mobile Sensing Applications</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Lin</forename>
                    <surname>Chen</surname>
                  </persName>
                  <email type="md5">df588d974a1012e832e350e57ace13b0</email>
                  <email type="domain">lri.fr</email>
                  <idno type="idhal" notation="string">lin-chen</idno>
                  <idno type="idhal" notation="numeric">2388</idno>
                  <idno type="halauthorid" notation="string">9324-2388</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-7943-3172</idno>
                  <idno type="IDREF">https://www.idref.fr/160951232</idno>
                  <affiliation ref="#struct-399697"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Kaigui</forename>
                    <surname>Bian</surname>
                  </persName>
                  <idno type="halauthorid">885071-0</idno>
                  <affiliation ref="#struct-300884"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Meng</forename>
                    <surname>Zheng</surname>
                  </persName>
                  <idno type="halauthorid">885072-0</idno>
                  <affiliation ref="#struct-239582"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">5406</idno>
                <idno type="issn">1063-6692</idno>
                <title level="j">IEEE/ACM Transactions on Networking</title>
                <imprint>
                  <publisher>IEEE/ACM</publisher>
                  <biblScope unit="volume">24</biblScope>
                  <biblScope unit="issue">5</biblScope>
                  <biblScope unit="pp">3148 - 3161</biblScope>
                  <date type="datePub">2016-10-01</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1109/TNET.2015.2505170</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Neighbor discovery is of paramount importance in mobile sensing applications and is particularly challenging if the operating frequencies of mobile devices span multiple channels. In this paper, we formulate the multi-channel neighbor discovery problem and establish a theoretical framework of it, under which we derive the performance bound of any neighbor discovery protocol guaranteeing discovery. We then develop a multi-channel discovery protocol that achieves guaranteed discovery with order-minimum worst-case discovery delay and fine-grained control of energy conservation levels.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-399697" status="OLD">
          <orgName>Graphes, Algorithmes et Combinatoire (LRI)</orgName>
          <orgName type="acronym">GALaC - LRI</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Université Paris-Sud ; bât. 650 Lovelace ; 91405 Orsay Cedex</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-2544" type="direct"/>
            <relation active="#struct-92966" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation name="UMR8623" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300884" status="VALID">
          <idno type="ROR">https://ror.org/02v51f717</idno>
          <orgName>Peking University [Beijing]</orgName>
          <desc>
            <address>
              <addrLine>No.5 Yiheyuan Road Haidian District, Beijing, P.R.China 100871</addrLine>
              <country key="CN"/>
            </address>
            <ref type="url">http://english.pku.edu.cn/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-239582" status="VALID">
          <idno type="ROR">https://ror.org/034t30j35</idno>
          <orgName>Chinese Academy of Sciences [Changchun Branch]</orgName>
          <orgName type="acronym">CAS</orgName>
          <desc>
            <address>
              <addrLine>52 Sanlihe Rd. - Xicheng District - Beijing, China 100864</addrLine>
              <country key="CN"/>
            </address>
            <ref type="url">http://english.cas.cn/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-2544" status="OLD">
          <idno type="RNSR">199812948M</idno>
          <orgName>Laboratoire de Recherche en Informatique</orgName>
          <orgName type="acronym">LRI</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>LRI - Bâtiments 650-660 Université Paris-Sud 91405 Orsay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lri.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-92966" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation name="UMR8623" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-92966" status="OLD">
          <idno type="ROR">https://ror.org/028rypz17</idno>
          <orgName>Université Paris-Sud - Paris 11</orgName>
          <orgName type="acronym">UP11</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Bâtiment 300 - 91405 Orsay cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-psud.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>