{"id":"https://openalex.org/W2103909006","doi":"https://doi.org/10.1109/wcnc.2012.6214177","title":"IPR: Incremental path reduction algorithm for tree-based routing in low-rate wireless mesh networks","display_name":"IPR: Incremental path reduction algorithm for tree-based routing in low-rate wireless mesh networks","publication_year":2012,"publication_date":"2012-04-01","ids":{"openalex":"https://openalex.org/W2103909006","doi":"https://doi.org/10.1109/wcnc.2012.6214177","mag":"2103909006"},"language":"en","primary_location":{"id":"doi:10.1109/wcnc.2012.6214177","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2012.6214177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","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/A5100661083","display_name":"Hyung Seok Kim","orcid":"https://orcid.org/0000-0003-4816-2992"},"institutions":[{"id":"https://openalex.org/I142401562","display_name":"Electronics and Telecommunications Research Institute","ror":"https://ror.org/03ysstz10","country_code":"KR","type":"facility","lineage":["https://openalex.org/I142401562","https://openalex.org/I2801339556","https://openalex.org/I4210144908","https://openalex.org/I4387152098"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Hyungseok Kim","raw_affiliation_strings":["Attached Institute of ETRI, Daejeon, South Korea","The Attached Institute of ETRI, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Attached Institute of ETRI, Daejeon, South Korea","institution_ids":["https://openalex.org/I142401562"]},{"raw_affiliation_string":"The Attached Institute of ETRI, Republic of Korea","institution_ids":["https://openalex.org/I142401562"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100769344","display_name":"Seong Hoon Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seong Hoon Kim","raw_affiliation_strings":["Department of Computer Science, KAIST, Daejeon, South Korea","Department of Computer Science, KAIST, Daejeon\u00a0, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KAIST, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Computer Science, KAIST, Daejeon\u00a0, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043134229","display_name":"Minkeun Ha","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Minkeun Ha","raw_affiliation_strings":["Department of Computer Science, KAIST, Daejeon, South Korea","Department of Computer Science, KAIST, Daejeon\u00a0, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KAIST, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Computer Science, KAIST, Daejeon\u00a0, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076950802","display_name":"Taehong Kim","orcid":"https://orcid.org/0000-0001-6246-6218"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Taehong Kim","raw_affiliation_strings":["Department of Computer Science, KAIST, Daejeon, South Korea","Department of Computer Science, KAIST, Daejeon\u00a0, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KAIST, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Computer Science, KAIST, Daejeon\u00a0, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100412739","display_name":"Daeyoung Kim","orcid":"https://orcid.org/0000-0002-7960-5955"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Daeyoung Kim","raw_affiliation_strings":["Department of Computer Science, KAIST, Daejeon, South Korea","Department of Computer Science, KAIST, Daejeon\u00a0, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KAIST, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Computer Science, KAIST, Daejeon\u00a0, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5100661083"],"corresponding_institution_ids":["https://openalex.org/I142401562"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18487314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2300","last_page":"2305"},"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9997000098228455,"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.9975000023841858,"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.7900019288063049},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7202059030532837},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.667670726776123},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.6092524528503418},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5531274676322937},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5376327037811279},{"id":"https://openalex.org/keywords/source-routing","display_name":"Source routing","score":0.509002685546875},{"id":"https://openalex.org/keywords/routing-information-protocol","display_name":"Routing Information Protocol","score":0.4854429364204407},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4433327913284302},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4421624541282654},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4409812390804291},{"id":"https://openalex.org/keywords/forwarder","display_name":"Forwarder","score":0.4330725073814392},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4104993939399719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11242860555648804}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7900019288063049},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7202059030532837},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.667670726776123},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.6092524528503418},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5531274676322937},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5376327037811279},{"id":"https://openalex.org/C44010500","wikidata":"https://www.wikidata.org/wiki/Q1422567","display_name":"Source routing","level":5,"score":0.509002685546875},{"id":"https://openalex.org/C7573999","wikidata":"https://www.wikidata.org/wiki/Q207580","display_name":"Routing Information Protocol","level":5,"score":0.4854429364204407},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4433327913284302},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4421624541282654},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4409812390804291},{"id":"https://openalex.org/C2781363737","wikidata":"https://www.wikidata.org/wiki/Q616007","display_name":"Forwarder","level":2,"score":0.4330725073814392},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4104993939399719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11242860555648804},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wcnc.2012.6214177","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2012.6214177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1520481638","https://openalex.org/W1974807671","https://openalex.org/W1995183798","https://openalex.org/W2049612791","https://openalex.org/W2132646562","https://openalex.org/W2142126316","https://openalex.org/W2144714690","https://openalex.org/W2325877089","https://openalex.org/W6631291725"],"related_works":["https://openalex.org/W1880846403","https://openalex.org/W2094080270","https://openalex.org/W2110532060","https://openalex.org/W2952606066","https://openalex.org/W2982628255","https://openalex.org/W1970596730","https://openalex.org/W2035320281","https://openalex.org/W2552236496","https://openalex.org/W2146753264","https://openalex.org/W4200541282"],"abstract_inverted_index":{"Tree-based":[0],"routing":[1,127,153,160],"protocols":[2],"in":[3,13,56],"low-rate":[4],"wireless":[5],"mesh":[6],"networks":[7],"usually":[8],"have":[9],"the":[10,16,53,68,74,107,124,131,151],"detour":[11],"problem":[12],"return":[14],"for":[15,155],"no":[17],"route":[18,55,109],"discovery":[19],"overhead.":[20,143],"In":[21,46,101],"this":[22,102],"paper,":[23],"we":[24,120],"propose":[25],"a":[26,87],"novel":[27],"algorithm,":[28,119],"named":[29],"Incremental":[30],"Path":[31],"Reduction":[32],"(IPR),":[33],"which":[34],"incrementally":[35,105],"shortens":[36,106],"inefficient":[37],"detoured":[38,108],"path":[39,132],"as":[40,110,138,140],"more":[41,111],"data":[42,48,69,112],"packets":[43,49,113],"are":[44,50,114],"delivered.":[45,115],"IPR,":[47],"delivered":[51],"along":[52],"tree":[54,126],"use":[57],"by":[58],"using":[59],"1-hop":[60],"broadcast,":[61],"enabling":[62],"neighbor":[63],"nodes":[64],"to":[65,84,123],"learn":[66],"about":[67],"packets'":[70],"hop":[71,75,82,93,99],"count.":[72,100],"Using":[73],"counts,":[76],"each":[77,89],"node":[78,94],"estimates":[79],"their":[80],"residual":[81,98],"count":[83],"destination.":[85],"As":[86],"result,":[88],"forwarder":[90],"selects":[91],"next":[92],"that":[95,147],"has":[96],"small":[97],"way,":[103],"IPR":[104,122,148],"To":[116],"verify":[117],"our":[118],"applied":[121],"representative":[125],"protocols,":[128],"and":[129,134],"evaluated":[130],"stretch":[133],"packet":[135,142],"delivery":[136],"ratio":[137],"well":[139],"control":[141],"Simulation":[144],"results":[145],"show":[146],"significantly":[149],"enhances":[150],"overall":[152],"metrics":[154],"any":[156],"types":[157],"of":[158],"tree-based":[159],"protocols.":[161]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}