{"id":"https://openalex.org/W7096517434","doi":null,"title":"A Distributed and Efficient Flooding Scheme Using 1-hop Information","display_name":"A Distributed and Efficient Flooding Scheme Using 1-hop Information","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7096517434"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.84.2758","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.2758","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lion.cs.uiuc.edu/group_seminar_slides/2006/TPDS-0481-1105.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7096517434"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994999766349792,"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.9994999766349792,"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.00019999999494757503,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.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"}}],"keywords":[{"id":"https://openalex.org/keywords/floods","display_name":"floods","score":0.9229999780654907},{"id":"https://openalex.org/keywords/mobile-ad-hoc-networks","display_name":"mobile ad hoc networks","score":0.9900000095367432},{"id":"https://openalex.org/keywords/message-redundancy","display_name":"message redundancy","score":0.7059999704360962},{"id":"https://openalex.org/keywords/forwarding-node-selection","display_name":"forwarding node selection","score":0.8169999718666077},{"id":"https://openalex.org/keywords/local-optimality","display_name":"local optimality","score":0.7039999961853027},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.6000000238418579},{"id":"https://openalex.org/keywords/distributed-algorithms","display_name":"distributed algorithms","score":0.3499999940395355}],"concepts":[{"id":"https://openalex.org/C186594467","wikidata":"https://www.wikidata.org/wiki/Q1429176","display_name":"Flooding (psychology)","level":2,"score":0.8648999929428101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7770000100135803},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5435000061988831},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5403000116348267},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.51910001039505},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.3813000023365021},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.36550000309944153},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.361299991607666},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.30799999833106995},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.303600013256073}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.84.2758","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.2758","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lion.cs.uiuc.edu/group_seminar_slides/2006/TPDS-0481-1105.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2137878479","https://openalex.org/W2125665119","https://openalex.org/W2075591645","https://openalex.org/W2163959732","https://openalex.org/W7099855919","https://openalex.org/W7099682428","https://openalex.org/W2141435168","https://openalex.org/W2436705454","https://openalex.org/W2043554575","https://openalex.org/W2101651170"],"abstract_inverted_index":{"Abstract.":[0],"Flooding":[1],"is":[2,126,137,141,145,168],"one":[3],"of":[4,16,22,25,87,120,148,150,165],"the":[5,20,40,44,78,82,111,118,127,130,138,146,172],"most":[6],"fundamental":[7],"operations":[8],"in":[9,43,62,114,123],"mobile":[10],"ad":[11],"hoc":[12],"networks.":[13,45],"Traditional":[14],"implementation":[15],"flooding":[17,48,92,107,176],"suffers":[18],"from":[19],"problems":[21],"excessive":[23],"redundancy":[24],"messages,":[26],"resource":[27],"contention,":[28],"and":[29,37,84,158],"signal":[30],"collision.":[31],"This":[32],"causes":[33],"high":[34],"protocol":[35],"overhead":[36],"interference":[38],"to":[39,52,70],"existing":[41,173],"traffic":[42],"Some":[46],"efficient":[47,106,175],"algorithms":[49,58],"were":[50],"proposed":[51],"avoid":[53],"these":[54,57],"problems.":[55],"However,":[56],"either":[59],"perform":[60],"poorly":[61],"reducing":[63],"redundant":[64],"transmissions,":[65],"or":[66],"require":[67],"each":[68,124],"node":[69],"maintain":[71],"2-hop":[72],"(or":[73],"more)":[74],"neighbors":[75,100,149],"information.":[76,101],"In":[77],"paper,":[79],"we":[80],"study":[81],"sufficient":[83],"necessary":[85],"condition":[86],"100":[88],"%":[89],"deliverability":[90],"for":[91,133],"schemes":[93],"that":[94,109,163],"are":[95],"based":[96],"on":[97],"only":[98],"1-hop":[99],"We":[102],"further":[103],"propose":[104],"an":[105],"algorithm":[108,167],"achieves":[110],"local":[112],"optimality":[113],"two":[115],"senses:":[116],"1)":[117],"number":[119,147],"forwarding":[121,135],"nodes":[122,136],"step":[125],"minimal;":[128],"2)":[129],"time":[131],"complexity":[132],"computing":[134],"lowest,":[139],"which":[140],"O(nlogn),":[142],"where":[143],"n":[144],"a":[151],"node.":[152],"Extensive":[153],"simulations":[154],"have":[155,161],"been":[156],"conducted":[157],"simulation":[159],"results":[160],"shown":[162],"performance":[164],"our":[166],"significantly":[169],"better":[170],"than":[171],"message":[174],"methods.":[177]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7096517434","counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}
