Maintaining Information About Nearby Processors in a Mobile Environment

Maintaining Information About Nearby Processors in a Mobile Environment

The problem of maintaining information about the location of nearby processors in a mobile adhoc network is considered. A new scalable, deterministic algorithm is presented, provided processors can only move along a line. Many open questions and directions for future work are discussed.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ellen, Faith, Subramanian, Sivaramakrishnan, Welch, Jennifer
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 202
container_issue
container_start_page 193
container_title
container_volume
creator Ellen, Faith
Subramanian, Sivaramakrishnan
Welch, Jennifer
description The problem of maintaining information about the location of nearby processors in a mobile adhoc network is considered. A new scalable, deterministic algorithm is presented, provided processors can only move along a line. Many open questions and directions for future work are discussed.
doi_str_mv 10.1007/11947950_22
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19687041</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19687041</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-5ba59006ffeaf79b5fe23f90544e19ddd27d1927c72fe203798999815e713d413</originalsourceid><addsrcrecordid>eNpNkD1PwzAURc2XRFs68QeyMDAE3rOdOG-sqgKVWmCAOXISuzK0dmUHpP57Cu3AcHWHc3SHy9g1wh0CqHtEkooKqDk_YWNSlSgklBVKEKdsgCViLoSkMzY8AkHlORuAAJ6TkuKSDVP6AACuiA_Y41I73-_j_CqbexviRvcu-GzShK8-ezY6NrvsNYbWpBRiypzPdLYMjVubbOa_XQx-Y3x_xS6sXiczPvaIvT_M3qZP-eLlcT6dLPItR-rzotEFAZTWGm0VNYU1XFiCQkqD1HUdVx0SV63iewJCUUVEFRZGoegkihG7OexudWr12kbtW5fqbXQbHXc1Ulkp-PNuD17aI78ysW5C-Ew1Qv17Y_3vRvEDxHRe2A</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Maintaining Information About Nearby Processors in a Mobile Environment</title><source>Springer Books</source><creator>Ellen, Faith ; Subramanian, Sivaramakrishnan ; Welch, Jennifer</creator><contributor>Paul, Himadri S. ; Das, Samir R. ; Chaudhuri, Soma ; Tirthapura, Srikanta</contributor><creatorcontrib>Ellen, Faith ; Subramanian, Sivaramakrishnan ; Welch, Jennifer ; Paul, Himadri S. ; Das, Samir R. ; Chaudhuri, Soma ; Tirthapura, Srikanta</creatorcontrib><description>The problem of maintaining information about the location of nearby processors in a mobile adhoc network is considered. A new scalable, deterministic algorithm is presented, provided processors can only move along a line. Many open questions and directions for future work are discussed.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540681396</identifier><identifier>ISBN: 9783540681397</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540681403</identifier><identifier>EISBN: 354068140X</identifier><identifier>DOI: 10.1007/11947950_22</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Software</subject><ispartof>Distributed Computing and Networking, 2006, p.193-202</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11947950_22$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11947950_22$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,777,778,782,787,788,791,4038,4039,27908,38238,41425,42494</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=19687041$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Paul, Himadri S.</contributor><contributor>Das, Samir R.</contributor><contributor>Chaudhuri, Soma</contributor><contributor>Tirthapura, Srikanta</contributor><creatorcontrib>Ellen, Faith</creatorcontrib><creatorcontrib>Subramanian, Sivaramakrishnan</creatorcontrib><creatorcontrib>Welch, Jennifer</creatorcontrib><title>Maintaining Information About Nearby Processors in a Mobile Environment</title><title>Distributed Computing and Networking</title><description>The problem of maintaining information about the location of nearby processors in a mobile adhoc network is considered. A new scalable, deterministic algorithm is presented, provided processors can only move along a line. Many open questions and directions for future work are discussed.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540681396</isbn><isbn>9783540681397</isbn><isbn>9783540681403</isbn><isbn>354068140X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkD1PwzAURc2XRFs68QeyMDAE3rOdOG-sqgKVWmCAOXISuzK0dmUHpP57Cu3AcHWHc3SHy9g1wh0CqHtEkooKqDk_YWNSlSgklBVKEKdsgCViLoSkMzY8AkHlORuAAJ6TkuKSDVP6AACuiA_Y41I73-_j_CqbexviRvcu-GzShK8-ezY6NrvsNYbWpBRiypzPdLYMjVubbOa_XQx-Y3x_xS6sXiczPvaIvT_M3qZP-eLlcT6dLPItR-rzotEFAZTWGm0VNYU1XFiCQkqD1HUdVx0SV63iewJCUUVEFRZGoegkihG7OexudWr12kbtW5fqbXQbHXc1Ulkp-PNuD17aI78ysW5C-Ew1Qv17Y_3vRvEDxHRe2A</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Ellen, Faith</creator><creator>Subramanian, Sivaramakrishnan</creator><creator>Welch, Jennifer</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>Maintaining Information About Nearby Processors in a Mobile Environment</title><author>Ellen, Faith ; Subramanian, Sivaramakrishnan ; Welch, Jennifer</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-5ba59006ffeaf79b5fe23f90544e19ddd27d1927c72fe203798999815e713d413</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ellen, Faith</creatorcontrib><creatorcontrib>Subramanian, Sivaramakrishnan</creatorcontrib><creatorcontrib>Welch, Jennifer</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ellen, Faith</au><au>Subramanian, Sivaramakrishnan</au><au>Welch, Jennifer</au><au>Paul, Himadri S.</au><au>Das, Samir R.</au><au>Chaudhuri, Soma</au><au>Tirthapura, Srikanta</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Maintaining Information About Nearby Processors in a Mobile Environment</atitle><btitle>Distributed Computing and Networking</btitle><date>2006</date><risdate>2006</risdate><spage>193</spage><epage>202</epage><pages>193-202</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540681396</isbn><isbn>9783540681397</isbn><eisbn>9783540681403</eisbn><eisbn>354068140X</eisbn><abstract>The problem of maintaining information about the location of nearby processors in a mobile adhoc network is considered. A new scalable, deterministic algorithm is presented, provided processors can only move along a line. Many open questions and directions for future work are discussed.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11947950_22</doi><tpages>10</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Distributed Computing and Networking, 2006, p.193-202
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_19687041
source Springer Books
subjects Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
title Maintaining Information About Nearby Processors in a Mobile Environment
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T21%3A40%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Maintaining%20Information%20About%20Nearby%20Processors%20in%20a%20Mobile%20Environment&rft.btitle=Distributed%20Computing%20and%20Networking&rft.au=Ellen,%20Faith&rft.date=2006&rft.spage=193&rft.epage=202&rft.pages=193-202&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540681396&rft.isbn_list=9783540681397&rft_id=info:doi/10.1007/11947950_22&rft_dat=%3Cpascalfrancis_sprin%3E19687041%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540681403&rft.eisbn_list=354068140X&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true