{"id":"https://openalex.org/W2171860868","doi":"https://doi.org/10.1145/1023720.1023730","title":"Revisiting the TTL-based controlled flooding search","display_name":"Revisiting the TTL-based controlled flooding search","publication_year":2004,"publication_date":"2004-09-26","ids":{"openalex":"https://openalex.org/W2171860868","doi":"https://doi.org/10.1145/1023720.1023730","mag":"2171860868"},"language":"en","primary_location":{"id":"doi:10.1145/1023720.1023730","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1023720.1023730","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th annual international conference on Mobile computing and networking","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/A5110545183","display_name":"Nicholas B. Chang","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicholas Chang","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101967011","display_name":"Mingyan Liu","orcid":"https://orcid.org/0000-0003-3295-9200"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mingyan Liu","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":7.2364,"has_fulltext":false,"cited_by_count":103,"citation_normalized_percentile":{"value":0.97230769,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"85","last_page":"99"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998999834060669,"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":0.9998999834060669,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","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/T11498","display_name":"Security in Wireless Sensor Networks","score":0.9945999979972839,"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.78690505027771},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6437921524047852},{"id":"https://openalex.org/keywords/flooding","display_name":"Flooding (psychology)","score":0.6423557996749878},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.5813970565795898},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5506835579872131},{"id":"https://openalex.org/keywords/linear-search","display_name":"Linear search","score":0.4680497348308563},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.43740010261535645},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.43461689352989197},{"id":"https://openalex.org/keywords/search-cost","display_name":"Search cost","score":0.426675945520401},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.4205538034439087},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.4142463803291321},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4028763473033905},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.226687490940094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1486830711364746}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.78690505027771},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6437921524047852},{"id":"https://openalex.org/C186594467","wikidata":"https://www.wikidata.org/wiki/Q1429176","display_name":"Flooding (psychology)","level":2,"score":0.6423557996749878},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.5813970565795898},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5506835579872131},{"id":"https://openalex.org/C204259536","wikidata":"https://www.wikidata.org/wiki/Q787903","display_name":"Linear search","level":2,"score":0.4680497348308563},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.43740010261535645},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.43461689352989197},{"id":"https://openalex.org/C21782646","wikidata":"https://www.wikidata.org/wiki/Q841666","display_name":"Search cost","level":2,"score":0.426675945520401},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.4205538034439087},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.4142463803291321},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4028763473033905},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.226687490940094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1486830711364746},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1023720.1023730","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1023720.1023730","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th annual international conference on Mobile computing and networking","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":17,"referenced_works":["https://openalex.org/W190248073","https://openalex.org/W1504808310","https://openalex.org/W1535136082","https://openalex.org/W1552828154","https://openalex.org/W1995601504","https://openalex.org/W2014550373","https://openalex.org/W2022318042","https://openalex.org/W2045028348","https://openalex.org/W2100411501","https://openalex.org/W2113428162","https://openalex.org/W2126947768","https://openalex.org/W2136982639","https://openalex.org/W2141351878","https://openalex.org/W2157457404","https://openalex.org/W2671731656","https://openalex.org/W2942686539","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4213195198","https://openalex.org/W2107835995","https://openalex.org/W843542728","https://openalex.org/W3124637411","https://openalex.org/W2585326820","https://openalex.org/W2998661990","https://openalex.org/W1972935601","https://openalex.org/W924159296","https://openalex.org/W1979261194","https://openalex.org/W2008976935"],"abstract_inverted_index":{"In":[0],"this":[1,27,69,124,152],"paper":[2,153],"we":[3,171,238],"consider":[4],"the":[5,72,87,97,115,139,158,162,165,187,194,200,214,218,221,229,234,241,288],"problem":[6,28],"of":[7,17,26,45,74,123,133,141,151,161,164,217,220,297],"searching":[8,30,54],"for":[9,31,42,55,203],"a":[10,22,32,36,43,49,56,90,169,173,226,271,276,295],"node":[11,34],"or":[12],"an":[13,60,106,285],"object":[14,166,222,230],"(i.e.,":[15,110,131],"piece":[16,44],"data,":[18],"file,":[19],"etc.)":[20],"in":[21,35,48,59,68,86,96,105],"large":[23],"network.":[24,63],"Applications":[25],"include":[29],"destination":[33],"mobile":[37],"ad":[38],"hoc":[39],"network,":[40,52],"querying":[41],"desired":[46],"data":[47],"wireless":[50],"sensor":[51],"and":[53,84,114,196,228],"shared":[57],"file":[58],"unstructured":[61],"peer-to-peer":[62],"We":[64,191,261,282],"limit":[65],"our":[66],"attention":[67],"study":[70,125],"to":[71,127,210,232],"class":[73,296],"controlled":[75],"flooding":[76],"search":[77,102,112,129,180,189,208,236,280],"strategies":[78,130,181,209,243],"where":[79],"query/search":[80],"packets":[81],"are":[82,154,244,251],"broadcast":[83],"propagated":[85],"network":[88,289],"until":[89],"preset":[91],"TTL":[92,108,134,249,267],"(time-to-live)":[93],"value":[94,109],"carried":[95],"packet":[98,146],"expires.":[99],"Every":[100],"unsuccessful":[101],"attempt":[103],"results":[104,150],"increased":[107],"larger":[111],"area)":[113],"same":[116],"process":[117],"is":[118,126,167,223,231],"repeated.":[119],"The":[120,148],"primary":[121],"goal":[122],"derive":[128,193,284],"sequences":[132],"values)":[135],"that":[136,185,240,263,274],"will":[137],"minimize":[138,186,233],"cost":[140],"such":[142],"searches":[143],"associated":[144],"with":[145,177],"transmissions.":[147],"main":[149],"as":[155],"follows.":[156],"When":[157,213],"probability":[159,215,255],"distribution":[160,202,216],"location":[163,201,219],"known":[168,225],"priori,":[170],"present":[172],"dynamic":[174],"programming":[175],"formulation":[176],"which":[178],"optimal":[179,292],"can":[182],"be":[183,211],"derived":[184],"expected":[188,279],"cost.":[190,281],"also":[192,283],"necessary":[195],"sufficient":[197],"conditions":[198],"%on":[199],"two":[204],"very":[205],"commonly":[206],"used":[207],"optimal.":[212],"not":[224],"priori":[227],"worst-case":[235,278],"cost,":[237],"show":[239,262],"best":[242],"randomized":[245,272,298],"strategies,":[246],"i.e.,":[247],"successive":[248],"values":[250],"chosen":[252],"from":[253],"certain":[254],"distributions":[256],"rather":[257],"than":[258],"deterministic":[259,266],"values.":[260],"given":[264],"any":[265],"sequence,":[268],"there":[269],"exists":[270],"version":[273],"has":[275],"lower":[277],"asymptotically":[286],"(as":[287],"size":[290],"increases)":[291],"strategy":[293],"within":[294],"strategies.":[299]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}
