{"id":"https://openalex.org/W2143219284","doi":"https://doi.org/10.1109/mahss.2008.4660034","title":"Minimizing multi-hop wireless routing state under application-based accuracy constraints","display_name":"Minimizing multi-hop wireless routing state under application-based accuracy constraints","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2143219284","doi":"https://doi.org/10.1109/mahss.2008.4660034","mag":"2143219284"},"language":"en","primary_location":{"id":"doi:10.1109/mahss.2008.4660034","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mahss.2008.4660034","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems","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/A5052014378","display_name":"Mustafa Omer Kilavuz","orcid":null},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mustafa Omer Kilavuz","raw_affiliation_strings":["Computer Science and Engineering Department, University of Nevada,\uc2a0Reno, Reno, NV, USA","Comput. Sci. & Eng. Dept., Univ. of Nevada - Reno, Reno, NV"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, University of Nevada,\uc2a0Reno, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]},{"raw_affiliation_string":"Comput. Sci. & Eng. Dept., Univ. of Nevada - Reno, Reno, NV","institution_ids":["https://openalex.org/I134113660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026786267","display_name":"Murat Y\u00fcksel","orcid":"https://orcid.org/0000-0003-0387-7038"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Murat Yuksel","raw_affiliation_strings":["Computer Science and Engineering Department, University of Nevada,\uc2a0Reno, Reno, NV, USA","Comput. Sci. & Eng. Dept., Univ. of Nevada - Reno, Reno, NV"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, University of Nevada,\uc2a0Reno, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]},{"raw_affiliation_string":"Comput. Sci. & Eng. Dept., Univ. of Nevada - Reno, Reno, NV","institution_ids":["https://openalex.org/I134113660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052014378"],"corresponding_institution_ids":["https://openalex.org/I134113660"],"apc_list":null,"apc_paid":null,"fwci":0.3812,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71130068,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"98","issue":null,"first_page":"193","last_page":"202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":1.0,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":1.0,"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.9993000030517578,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9993000030517578,"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.8084549903869629},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5991475582122803},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5558644533157349},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5481451153755188},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5379970073699951},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5329201221466064},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5020952224731445},{"id":"https://openalex.org/keywords/dsrflow","display_name":"DSRFLOW","score":0.492104709148407},{"id":"https://openalex.org/keywords/header","display_name":"Header","score":0.4885050058364868},{"id":"https://openalex.org/keywords/source-routing","display_name":"Source routing","score":0.4640457034111023},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.45897454023361206},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.408822238445282}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8084549903869629},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5991475582122803},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5558644533157349},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5481451153755188},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5379970073699951},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5329201221466064},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5020952224731445},{"id":"https://openalex.org/C193794138","wikidata":"https://www.wikidata.org/wiki/Q5206182","display_name":"DSRFLOW","level":5,"score":0.492104709148407},{"id":"https://openalex.org/C48105269","wikidata":"https://www.wikidata.org/wiki/Q1141160","display_name":"Header","level":2,"score":0.4885050058364868},{"id":"https://openalex.org/C44010500","wikidata":"https://www.wikidata.org/wiki/Q1422567","display_name":"Source routing","level":5,"score":0.4640457034111023},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.45897454023361206},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.408822238445282},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/mahss.2008.4660034","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mahss.2008.4660034","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.205.4088","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.4088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unr.edu/%7Eyuksem/thesis/2009-kilavuz-ms.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.352.7672","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.7672","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unr.edu/~yuksem/my-papers/mass08-tbr.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W9590246","https://openalex.org/W1508419498","https://openalex.org/W1547174948","https://openalex.org/W1566965859","https://openalex.org/W1973633235","https://openalex.org/W1989581936","https://openalex.org/W1994641974","https://openalex.org/W2045329305","https://openalex.org/W2080979018","https://openalex.org/W2089499640","https://openalex.org/W2090874894","https://openalex.org/W2101087742","https://openalex.org/W2101963262","https://openalex.org/W2102258543","https://openalex.org/W2105170773","https://openalex.org/W2124651399","https://openalex.org/W2126389265","https://openalex.org/W2128990851","https://openalex.org/W2132611493","https://openalex.org/W2132787844","https://openalex.org/W2134511866","https://openalex.org/W2139616859","https://openalex.org/W2152150600","https://openalex.org/W2155952763","https://openalex.org/W2157457404","https://openalex.org/W2158049821","https://openalex.org/W2159277490","https://openalex.org/W2164192722","https://openalex.org/W2167477163","https://openalex.org/W2171201959","https://openalex.org/W2432517183","https://openalex.org/W2965720098","https://openalex.org/W2970445218","https://openalex.org/W3011460294","https://openalex.org/W3097169496","https://openalex.org/W4230781079","https://openalex.org/W4236944153","https://openalex.org/W4240571556","https://openalex.org/W4242450751","https://openalex.org/W4250390143","https://openalex.org/W4285719527","https://openalex.org/W6600396436","https://openalex.org/W6605293090","https://openalex.org/W6661830967","https://openalex.org/W6671115133","https://openalex.org/W6675445138","https://openalex.org/W6679362836","https://openalex.org/W6885023559"],"related_works":["https://openalex.org/W1981597438","https://openalex.org/W1997091564","https://openalex.org/W1871186498","https://openalex.org/W2913516634","https://openalex.org/W2204238626","https://openalex.org/W2018256716","https://openalex.org/W103514590","https://openalex.org/W2989144085","https://openalex.org/W2139924440","https://openalex.org/W2741533325"],"abstract_inverted_index":{"Provisioning":[0],"of":[1,13,56,99,101,112,121,146,179,182,188],"rich":[2],"routing":[3,38,58,78,88],"building":[4],"blocks":[5],"to":[6,70,74,114,143,163,194,202],"mobile":[7],"ad-hoc":[8],"networking":[9],"applications":[10,18],"has":[11,34],"been":[12,66],"high":[14],"interest.":[15],"Several":[16],"MANET":[17],"need":[19],"flexibility":[20],"in":[21,53,152],"describing":[22],"paths":[23],"their":[24,214],"traffic":[25],"will":[26],"follow.":[27],"To":[28],"accommodate":[29],"this":[30,107,122,210],"need,":[31],"previous":[32],"work":[33],"proposed":[35],"several":[36],"viable":[37],"schemes":[39,59],"such":[40],"as":[41,106],"Dynamic":[42],"Source":[43],"Routing":[44,48],"(DSR)":[45],"and":[46,60,134,171,197,212],"Trajectory-Based":[47],"(TBR).":[49],"However,":[50],"tradeoffs":[51],"involved":[52],"the":[54,61,72,76,97,102,115,127,130,135,144,165,177,186,190],"interaction":[55],"these":[57],"application-specific":[62],"requirements":[63],"have":[64],"not":[65],"explored.":[67],"Especially,":[68],"techniques":[69,85],"help":[71],"application":[73],"do":[75],"right":[77],"choices":[79,113],"are":[80],"much":[81],"needed.":[82],"We":[83,95,157,174],"consider":[84],"that":[86,176],"minimize":[87],"protocol":[89],"state":[90,199],"costs":[91],"under":[92],"application-based":[93,149],"constraints.":[94],"study":[96],"constraint":[98,108],"ldquoaccuracyrdquo":[100],"applicationpsilas":[103],"desired":[104],"route,":[105],"provides":[109],"a":[110,118,154,183],"range":[111],"applications.":[116],"As":[117],"crucial":[119],"part":[120],"optimization":[123],"framework,":[124],"we":[125,206],"investigate":[126],"tradeoff":[128,166],"between":[129,167],"packet":[131,168],"header":[132,169,195],"size":[133,170,196],"network":[136,172,198],"state.":[137,173],"We,":[138],"then,":[139],"apply":[140],"our":[141],"framework":[142],"case":[145],"TBR":[147],"with":[148,159,185],"accuracy":[150],"constraints":[151],"obeying":[153],"given":[155],"trajectory.":[156],"begin":[158],"simple":[160],"discrete":[161],"models":[162],"clarify":[164],"show":[175],"problem":[178,211],"accurate":[180],"representation":[181],"trajectory":[184],"objective":[187],"minimizing":[189],"cost":[191],"incurred":[192],"due":[193],"is":[200],"difficult":[201],"solve":[203],"optimally.":[204],"Finally,":[205],"develop":[207],"heuristics":[208],"solving":[209],"illustrate":[213],"performance.":[215]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}