{"id":"https://openalex.org/W1574120709","doi":"https://doi.org/10.17562/pb-47-7","title":"Efficient Routing of Mobile Agents in a Stochastic Network","display_name":"Efficient Routing of Mobile Agents in a Stochastic Network","publication_year":2013,"publication_date":"2013-06-30","ids":{"openalex":"https://openalex.org/W1574120709","doi":"https://doi.org/10.17562/pb-47-7","mag":"1574120709"},"language":"en","primary_location":{"id":"doi:10.17562/pb-47-7","is_oa":true,"landing_page_url":"https://doi.org/10.17562/pb-47-7","pdf_url":"https://www.polibits.cidetec.ipn.mx/ojs/index.php/polibits/article/view/47-7/1710","source":{"id":"https://openalex.org/S4210186437","display_name":"Polibits","issn_l":"1870-9044","issn":["1870-9044","2395-8618"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Polibits","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.polibits.cidetec.ipn.mx/ojs/index.php/polibits/article/view/47-7/1710","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028888072","display_name":"Amir Elalouf","orcid":"https://orcid.org/0000-0001-7950-0785"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amir Elalouf","raw_affiliation_strings":["Bar-Ilan\u00a0University, Ramat-Gan, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bar-Ilan\u00a0University, Ramat-Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084238830","display_name":"Eugene Levner","orcid":"https://orcid.org/0000-0003-0430-408X"},"institutions":[{"id":"https://openalex.org/I154488051","display_name":"Ashkelon Academic College","ror":"https://ror.org/00sfwx025","country_code":"IL","type":"education","lineage":["https://openalex.org/I154488051"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eugene Levner","raw_affiliation_strings":["Ashkelon Academic College,Ashkelon,Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ashkelon Academic College,Ashkelon,Israel","institution_ids":["https://openalex.org/I154488051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014895270","display_name":"Tianzhen Cheng","orcid":null},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"T.C.E. Cheng","raw_affiliation_strings":["Hong Kong Polytechnic University Kowloon, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hong Kong Polytechnic University Kowloon, Hong Kong","institution_ids":["https://openalex.org/I14243506"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06406767,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"47","issue":null,"first_page":"61","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5458768010139465},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4930388629436493},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.47092169523239136},{"id":"https://openalex.org/keywords/triangular-routing","display_name":"Triangular routing","score":0.43935805559158325},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35730424523353577},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.26122382283210754},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.18669554591178894}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5458768010139465},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4930388629436493},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.47092169523239136},{"id":"https://openalex.org/C22655229","wikidata":"https://www.wikidata.org/wiki/Q17143627","display_name":"Triangular routing","level":5,"score":0.43935805559158325},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35730424523353577},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.26122382283210754},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.18669554591178894}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.17562/pb-47-7","is_oa":true,"landing_page_url":"https://doi.org/10.17562/pb-47-7","pdf_url":"https://www.polibits.cidetec.ipn.mx/ojs/index.php/polibits/article/view/47-7/1710","source":{"id":"https://openalex.org/S4210186437","display_name":"Polibits","issn_l":"1870-9044","issn":["1870-9044","2395-8618"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Polibits","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.401.6150","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.401.6150","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://polibits.gelbukh.com/2013_47/Efficient Routing of Mobile Agents in a Stochastic Network.pdf","raw_type":"text"},{"id":"pmh:oai:redalyc.org:402640461008","is_oa":false,"landing_page_url":"https://www.redalyc.org/articulo.oa?id=402640461008","pdf_url":null,"source":{"id":"https://openalex.org/S4377196100","display_name":"Redalyc (Universidad Aut\u00f3noma del Estado de M\u00e9xico)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I179647637","host_organization_name":"Universidad Aut\u00f3noma del Estado de M\u00e9xico","host_organization_lineage":["https://openalex.org/I179647637"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Polibits (M\u00e9xico) Vol.47","raw_type":"art\u00edculo cient\u00edfico"}],"best_oa_location":{"id":"doi:10.17562/pb-47-7","is_oa":true,"landing_page_url":"https://doi.org/10.17562/pb-47-7","pdf_url":"https://www.polibits.cidetec.ipn.mx/ojs/index.php/polibits/article/view/47-7/1710","source":{"id":"https://openalex.org/S4210186437","display_name":"Polibits","issn_l":"1870-9044","issn":["1870-9044","2395-8618"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Polibits","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1574120709.pdf","grobid_xml":"https://content.openalex.org/works/W1574120709.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W11211593","https://openalex.org/W57516052","https://openalex.org/W78507853","https://openalex.org/W180618071","https://openalex.org/W190732186","https://openalex.org/W264528716","https://openalex.org/W1504027560","https://openalex.org/W1553331232","https://openalex.org/W1603976385","https://openalex.org/W1982453322","https://openalex.org/W2030170468","https://openalex.org/W2030395122","https://openalex.org/W2031910012","https://openalex.org/W2061701207","https://openalex.org/W2065104488","https://openalex.org/W2067297441","https://openalex.org/W2130626677","https://openalex.org/W2149056569","https://openalex.org/W2156164855","https://openalex.org/W2157993733","https://openalex.org/W2159659632","https://openalex.org/W2539947550","https://openalex.org/W2610739102","https://openalex.org/W3036920569","https://openalex.org/W3111526966","https://openalex.org/W3145128584","https://openalex.org/W4285786344","https://openalex.org/W6600164255","https://openalex.org/W6607261046","https://openalex.org/W6658072763","https://openalex.org/W6665940139","https://openalex.org/W6667234706","https://openalex.org/W6989127221","https://openalex.org/W7075592168"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2129380638","https://openalex.org/W2080563844","https://openalex.org/W1976722216","https://openalex.org/W2145916018","https://openalex.org/W1482798540","https://openalex.org/W1531878414","https://openalex.org/W2148383913","https://openalex.org/W1807741059","https://openalex.org/W2768852909"],"abstract_inverted_index":{"Mobile":[0],"agents":[1,42,48],"are":[2],"autonomous":[3],"programs":[4],"that":[5,99,102,116],"may":[6],"be":[7],"dispatched":[8],"through":[9],"computer":[10],"networks.":[11,28],"Using":[12],"a":[13,17,32,63,75],"mobile":[14,41,47,70],"agent":[15,71],"is":[16,74,86,106,110,119],"potentially":[18],"efficient":[19],"method":[20],"to":[21,87],"perform":[22],"transactions":[23],"and":[24,82,121,127],"retrieve":[25],"information":[26],"in":[27,31,36,67],"Unknown":[29],"congestion":[30],"network":[33,66],"causes":[34],"uncertainty":[35],"the":[37,44,53,69,84,89,92,97,100,103,133],"routing":[38,45,72],"times":[39],"of":[40,46],"so":[43],"cannot":[49],"rely":[50],"solely":[51],"on":[52],"average":[54],"travel":[55],"time.":[56],"In":[57],"this":[58,117],"paper":[59],"we":[60],"deal":[61],"with":[62,91],"given":[64],"stochastic":[65],"which":[68],"time":[73,95,105],"random":[76],"variable.":[77],"Given":[78],"pre-specified":[79],"values":[80],"R":[81,109],"PR,":[83],"objective":[85],"find":[88],"path":[90,104],"minimum":[93],"expected":[94],"under":[96],"constraint":[98],"probability":[101],"less":[107],"than":[108],"at":[111],"least":[112],"PR.":[113],"We":[114],"show":[115],"problem":[118],"NP-hard,":[120],"construct":[122],"an":[123,128],"exact":[124],"pseudo-polynomial":[125],"algorithm":[126,130],"-approximation":[129],"(FPTAS)":[131],"for":[132],"problem.":[134]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
