{"id":"https://openalex.org/W2170507273","doi":"https://doi.org/10.1109/infcom.2005.1498345","title":"On-line search for mobile users","display_name":"On-line search for mobile users","publication_year":2005,"publication_date":"2005-08-24","ids":{"openalex":"https://openalex.org/W2170507273","doi":"https://doi.org/10.1109/infcom.2005.1498345","mag":"2170507273"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2005.1498345","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2005.1498345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089278678","display_name":"Zohar Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Z. Naor","raw_affiliation_strings":["Department of Mathematics, Physics, and Computer Science, University of Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Physics, and Computer Science, University of Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089278678"],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":null,"apc_paid":null,"fwci":0.5191,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.74573425,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1186","last_page":"1195"},"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9983000159263611,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9940000176429749,"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.7541522979736328},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5997253060340881},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5132036209106445},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.489803284406662},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.45226186513900757},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.4516347050666809},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4439114034175873},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.4312351644039154},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3676038980484009},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18402099609375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16913408041000366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14387023448944092}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7541522979736328},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5997253060340881},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5132036209106445},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.489803284406662},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.45226186513900757},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.4516347050666809},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4439114034175873},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.4312351644039154},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3676038980484009},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18402099609375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16913408041000366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14387023448944092},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2005.1498345","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2005.1498345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1599406659","https://openalex.org/W1656660687","https://openalex.org/W1838982856","https://openalex.org/W1974331052","https://openalex.org/W1984216594","https://openalex.org/W1985389032","https://openalex.org/W1986886088","https://openalex.org/W1999370138","https://openalex.org/W2001016215","https://openalex.org/W2011039300","https://openalex.org/W2032353118","https://openalex.org/W2047997423","https://openalex.org/W2093979815","https://openalex.org/W2104680817","https://openalex.org/W2109039129","https://openalex.org/W2109453359","https://openalex.org/W2118127134","https://openalex.org/W2142194541","https://openalex.org/W2150352566","https://openalex.org/W2152614125"],"related_works":["https://openalex.org/W2064794194","https://openalex.org/W2358427436","https://openalex.org/W2808808802","https://openalex.org/W4386269615","https://openalex.org/W4200104947","https://openalex.org/W1994919150","https://openalex.org/W4390091683","https://openalex.org/W2397806795","https://openalex.org/W2998661990","https://openalex.org/W3192236608"],"abstract_inverted_index":{"The":[0,31],"problem":[1,24,74,181],"of":[2,25,42,75,80,128,134,146,159,182,187,233,266],"searching":[3,26,43],"for":[4,27,34,44,96,113,139,206,213],"mobile":[5],"users":[6,46,130,142,161],"in":[7,12,64,70],"cellular":[8,166],"networks":[9],"is":[10,37,60,68,88,116,151,195,204,274],"addressed":[11],"this":[13,18,35,58,71,197],"study.":[14],"Previous":[15],"studies":[16],"addressing":[17],"issue":[19],"have":[20],"focused":[21],"on":[22],"the":[23,73,77,91,110,125,132,156,180,184,214,220,224,230,239,251,263,271,276,281,287,298],"a":[28,52,97,104,121,144,165,176,244,292],"single":[29,53,98,148],"user.":[30],"underlying":[32],"assumption":[33,59],"approach":[36],"that":[38,93,109,203,248,295],"some":[39],"straightforward":[40],"strategy":[41,242,290],"multiple":[45],"can":[47,227],"be":[48,101],"easily":[49],"derived":[50],"from":[51,118,143],"user":[54,99,149,299],"search":[55,95,114,138,173,241,246,283,289],"strategy.":[56,284],"Unfortunately,":[57,153],"violated":[61],"very":[62,154],"often":[63,155],"practice.":[65],"As":[66],"it":[67],"shown":[69],"study,":[72],"maximizing":[76,183],"expected":[78,185,231,264],"rate":[79,186,232,265,278],"successful":[81,188,234,267],"searches":[82,150,189,235,268,296],"under":[83,190,219],"delay":[84,191],"and":[85,108,192,210,255],"bandwidth":[86,111,193],"constraints":[87,194],"NP-hard.":[89,152],"Given":[90],"conditions":[92],"each":[94],"must":[100],"over":[102],"during":[103],"pre-defined":[105,122],"time":[106],"period,":[107],"available":[112],"operations":[115],"bounded":[117],"above":[119],"by":[120,236,270,280],"constant,":[123],"when":[124],"potential":[126,157],"locations":[127,158],"different":[129,160],"overlap,":[131],"derivation":[133],"an":[135,200],"optimal":[136,147,205,212],"concurrent":[137],"many":[140,171],"independent":[141],"set":[145],"overlap.":[162],"In":[163,285],"reality,":[164],"network":[167],"has":[168],"to":[169],"serve":[170],"competing":[172],"requests":[174],"sharing":[175],"limited":[177],"bandwidth.":[178],"Since":[179],"NP-hard,":[196],"study":[198],"proposes":[199],"approximation":[201],"algorithm,":[202],"most":[207],"probable":[208],"cases,":[209],"nearly":[211],"worst":[215,221],"case":[216,222],"condition.":[217],"Even":[218],"condition,":[223],"proposed":[225,240,272,288],"method":[226,273],"potentially":[228],"increase":[229],"100%.":[237],"Moreover,":[238],"outperforms":[243,291],"greedy":[245,282],"strategy,":[247],"considers":[249],"only":[250],"users'":[252],"location":[253],"probabilities":[254],"ignores":[256],"their":[257],"deadline":[258],"constraints.":[259],"Under":[260],"certain":[261],"conditions,":[262],"generated":[269,279],"twice":[275],"equivalent":[277],"addition,":[286],"heuristic":[293],"algorithm":[294],"around":[297],"last":[300],"known":[301],"location.":[302]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
