{"id":"https://openalex.org/W2008074281","doi":"https://doi.org/10.1109/glocom.2012.6503082","title":"Quasi-greedy geographic routing in wireless networks","display_name":"Quasi-greedy geographic routing in wireless networks","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W2008074281","doi":"https://doi.org/10.1109/glocom.2012.6503082","mag":"2008074281"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2012.6503082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2012.6503082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Global Communications Conference (GLOBECOM)","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/A5074778887","display_name":"Jung\u2010Tsung Tsai","orcid":null},"institutions":[{"id":"https://openalex.org/I134161618","display_name":"National Taiwan Normal University","ror":"https://ror.org/059dkdx38","country_code":"TW","type":"education","lineage":["https://openalex.org/I134161618"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Jung-Tsung Tsai","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei 116, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei 116, Taiwan","institution_ids":["https://openalex.org/I134161618"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108678207","display_name":"Yen-Cheng Li","orcid":null},"institutions":[{"id":"https://openalex.org/I134161618","display_name":"National Taiwan Normal University","ror":"https://ror.org/059dkdx38","country_code":"TW","type":"education","lineage":["https://openalex.org/I134161618"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yen-Cheng Li","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei 116, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei 116, Taiwan","institution_ids":["https://openalex.org/I134161618"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074778887"],"corresponding_institution_ids":["https://openalex.org/I134161618"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11630556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"8","last_page":"13"},"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.9995999932289124,"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/T10069","display_name":"Antenna Design and Analysis","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.7709589004516602},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7455172538757324},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7282171249389648},{"id":"https://openalex.org/keywords/packet-forwarding","display_name":"Packet forwarding","score":0.6815206408500671},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.6143978238105774},{"id":"https://openalex.org/keywords/virtual-routing-and-forwarding","display_name":"Virtual routing and forwarding","score":0.5562291145324707},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5270098447799683},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.51836758852005},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5037049651145935},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.3621261715888977},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34875279664993286},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.31729528307914734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12786981463432312}],"concepts":[{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.7709589004516602},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7455172538757324},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7282171249389648},{"id":"https://openalex.org/C120317029","wikidata":"https://www.wikidata.org/wiki/Q874048","display_name":"Packet forwarding","level":3,"score":0.6815206408500671},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.6143978238105774},{"id":"https://openalex.org/C157626507","wikidata":"https://www.wikidata.org/wiki/Q7935037","display_name":"Virtual routing and forwarding","level":5,"score":0.5562291145324707},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5270098447799683},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.51836758852005},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5037049651145935},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.3621261715888977},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34875279664993286},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.31729528307914734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12786981463432312}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2012.6503082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2012.6503082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6899999976158142}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1518780012","https://openalex.org/W1550444125","https://openalex.org/W1562002883","https://openalex.org/W1970754929","https://openalex.org/W2008809888","https://openalex.org/W2044959725","https://openalex.org/W2063295648","https://openalex.org/W2101963262","https://openalex.org/W2123812631","https://openalex.org/W2142963885","https://openalex.org/W2148565706","https://openalex.org/W2151691150","https://openalex.org/W3151200052","https://openalex.org/W4210530152","https://openalex.org/W6631139668","https://openalex.org/W6632945411","https://openalex.org/W6633622765"],"related_works":["https://openalex.org/W2497028718","https://openalex.org/W2120034637","https://openalex.org/W2103355668","https://openalex.org/W2984960301","https://openalex.org/W4385819622","https://openalex.org/W2118395071","https://openalex.org/W1966417809","https://openalex.org/W2146354244","https://openalex.org/W2144615114","https://openalex.org/W2078987980"],"abstract_inverted_index":{"Greedy":[0],"forwarding":[1,58,110,145],"combined":[2],"with":[3,178],"planar":[4,40],"graph":[5,41],"routing":[6,135,154],"exploits":[7],"minimal":[8],"local":[9,68,106],"position":[10],"information":[11,69,183,189],"to":[12,44,70,103,166,176,186],"achieve":[13,149],"reliable":[14],"packet":[15,79],"delivery":[16],"in":[17,94,126,184],"wireless":[18],"networks.":[19],"However,":[20],"it":[21],"is":[22,85],"at":[23,163],"the":[24,72,112,115,123,127,139,150,173,181,187],"expense":[25],"of":[26,74,98,129,141,152],"path":[27],"hop":[28,155],"counts":[29],"and":[30,100,175],"traffic":[31,55],"loads":[32],"converging":[33],"on":[34,67],"links":[35],"dictated":[36],"by":[37],"a":[38,62,86,95,105,168],"chosen":[39],"traversal":[42],"scheme":[43,59,136],"bypass":[45],"network":[46],"holes.":[47],"To":[48],"mitigate":[49],"these":[50],"negative":[51],"factors":[52],"for":[53,78,108,144],"delay-sensitive":[54],"service,":[56],"our":[57,133],"further":[60],"utilizes":[61],"simple":[63],"hypothesis":[64],"test":[65],"based":[66],"partition":[71],"set":[73],"candidate":[75],"neighborhood":[76,179],"nodes":[77,90,99,180],"relay":[80],"into":[81],"two":[82],"subsets.":[83],"One":[84],"preferable":[87,118],"subset":[88,119],"containing":[89],"more":[91],"likely":[92,102],"located":[93],"dense":[96],"area":[97],"less":[101],"be":[104],"minimum":[107],"greedy":[109,130,143],"while":[111],"other":[113,124],"contains":[114],"rest.":[116],"The":[117],"has":[120],"priority":[121],"over":[122],"one":[125],"process":[128],"forwarding.":[131],"Consequently,":[132],"geographic":[134],"even":[137],"embodies":[138],"feature":[140],"quasi":[142],"packets":[146],"but":[147],"does":[148],"goal":[151],"reducing":[153],"counts.":[156],"It":[157],"only":[158],"requires":[159],"an":[160],"extra":[161],"complexity":[162],"each":[164],"node":[165,174],"compute":[167],"representative":[169],"angle":[170,182],"that":[171],"characterizes":[172],"interchange":[177],"addition":[185],"location":[188],"needed":[190],"normally.":[191]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}