{"id":"https://openalex.org/W2010375194","doi":"https://doi.org/10.1109/pccc.2013.6742778","title":"Minimizing routing overhead with Two-Hop Coordinate Awareness in ad hoc networks","display_name":"Minimizing routing overhead with Two-Hop Coordinate Awareness in ad hoc networks","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2010375194","doi":"https://doi.org/10.1109/pccc.2013.6742778","mag":"2010375194"},"language":"en","primary_location":{"id":"doi:10.1109/pccc.2013.6742778","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pccc.2013.6742778","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 32nd International Performance Computing and Communications Conference (IPCCC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt0v19203g/qt0v19203g.pdf?t=nu6741","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100335702","display_name":"Yali Wang","orcid":"https://orcid.org/0000-0002-1739-3053"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yali Wang","raw_affiliation_strings":["Computer Engineering Department, University of California, , Santa Cruz, Santa Cruz, CA, USA","Comput. Eng. Dept., Univ. of California Santa Cruz, Santa Cruz, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, University of California, , Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"Comput. Eng. Dept., Univ. of California Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065935907","display_name":"J.J. Garcia\u2010Luna\u2010Aceves","orcid":"https://orcid.org/0000-0001-9914-6031"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.J. Garcia-Luna-Aceves","raw_affiliation_strings":["Computer Engineering Department, University of California, , Santa Cruz, Santa Cruz, CA, USA","Comput. Eng. Dept., Univ. of California Santa Cruz, Santa Cruz, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, University of California, , Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"Comput. Eng. Dept., Univ. of California Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":0.2683,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.42776228,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"1","last_page":"9"},"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.9998000264167786,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9987999796867371,"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.5836386680603027},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.5469900369644165},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.44819796085357666},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34615206718444824},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3428441286087036},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.32729196548461914},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.32235807180404663},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24325093626976013},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09106364846229553}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5836386680603027},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.5469900369644165},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.44819796085357666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34615206718444824},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3428441286087036},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.32729196548461914},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.32235807180404663},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24325093626976013},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09106364846229553},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/pccc.2013.6742778","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pccc.2013.6742778","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 32nd International Performance Computing and Communications Conference (IPCCC)","raw_type":"proceedings-article"},{"id":"pmh:qt0v19203g","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/0v19203g","pdf_url":"https://escholarship.org/content/qt0v19203g/qt0v19203g.pdf?t=nu6741","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Garcia-Luna-Aceves, J.J.; & Wang, Y.(2013). Minimizing Routing Overhead With Two Hop Coordinate Awareness in Ad Hoc Networks. Proceedings IEEE IPCCC 2013. UC Santa Cruz: Retrieved from: http://www.escholarship.org/uc/item/0v19203g","raw_type":"article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt0v19203g","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/0v19203g","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"pmh:qt0v19203g","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/0v19203g","pdf_url":"https://escholarship.org/content/qt0v19203g/qt0v19203g.pdf?t=nu6741","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Garcia-Luna-Aceves, J.J.; & Wang, Y.(2013). Minimizing Routing Overhead With Two Hop Coordinate Awareness in Ad Hoc Networks. Proceedings IEEE IPCCC 2013. UC Santa Cruz: Retrieved from: http://www.escholarship.org/uc/item/0v19203g","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2010375194.pdf","grobid_xml":"https://content.openalex.org/works/W2010375194.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1549535141","https://openalex.org/W1969043696","https://openalex.org/W2003702658","https://openalex.org/W2014411916","https://openalex.org/W2016193412","https://openalex.org/W2035041833","https://openalex.org/W2035776116","https://openalex.org/W2045349136","https://openalex.org/W2055654205","https://openalex.org/W2080979018","https://openalex.org/W2099574482","https://openalex.org/W2101963262","https://openalex.org/W2107475174","https://openalex.org/W2114771944","https://openalex.org/W2119710605","https://openalex.org/W2120361596","https://openalex.org/W2127126344","https://openalex.org/W2128410356","https://openalex.org/W2131019569","https://openalex.org/W2132395255","https://openalex.org/W2140285346","https://openalex.org/W2155427143","https://openalex.org/W2159172509","https://openalex.org/W2166485324","https://openalex.org/W2652040576","https://openalex.org/W2913217326","https://openalex.org/W4235154472","https://openalex.org/W4254751305","https://openalex.org/W6654216672","https://openalex.org/W6679029639","https://openalex.org/W6680420236"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2117210722","https://openalex.org/W2589759689","https://openalex.org/W1978191894","https://openalex.org/W2018045843","https://openalex.org/W3125668480","https://openalex.org/W2032875422","https://openalex.org/W1999406711","https://openalex.org/W1989661137","https://openalex.org/W2163664197"],"abstract_inverted_index":{"We":[0,75],"introduce":[1],"ORTHCA":[2,113,131],"(On-demand":[3],"Routing":[4],"with":[5,64,116],"Two":[6],"Hop":[7],"Coordinates":[8],"Awareness)":[9],"a":[10,81],"method":[11],"for":[12],"minimizing":[13],"the":[14,35,49,87,108,111,133,142],"dissemination":[15,88],"of":[16,27,73,89,107,110],"route":[17,90],"requests":[18,91],"in":[19,80,86],"mobile":[20],"ad":[21],"hoc":[22],"networks":[23],"(MANET).":[24],"The":[25,126],"selection":[26],"relaying":[28],"nodes":[29,39,61,79],"is":[30,68,114],"implemented":[31],"by":[32,70],"first":[33],"computing":[34],"best":[36],"two-hop":[37,53],"relay":[38,60],"R2(u)":[40],"whose":[41],"Euclidean":[42],"Distance":[43],"to":[44],"four":[45,144],"polar":[46],"points":[47],"are":[48,84],"shortest":[50],"among":[51],"all":[52,78],"neighbors":[54],"N2(u),":[55],"and":[56,95,124,136],"then":[57],"determining":[58],"one-hop":[59],"R1(u)":[62],"connecting":[63],"R2(u).":[65,74],"This":[66],"process":[67],"iterated":[69],"each":[71],"member":[72],"prove":[76],"that":[77,96,130],"connected":[82],"MANET":[83],"covered":[85],"using":[92],"this":[93],"procedure,":[94],"|R1(u)":[97],"+":[98],"R2(u)|":[99],"\u2264":[100],"16,":[101],"which":[102],"constitutes":[103],"complexity":[104],"O(1),":[105],"regardless":[106],"density":[109],"network.":[112],"compared":[115],"representative":[117],"routing":[118,134,145],"protocols,":[119],"namely":[120],"AODV,":[121],"OLSR,":[122],"LAR,":[123],"THP.":[125],"simulation":[127],"results":[128],"show":[129],"reduces":[132],"load":[135],"improves":[137],"packet":[138],"delivery":[139],"ratios,":[140],"outperforming":[141],"other":[143],"protocols.":[146]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}