{"id":"https://openalex.org/W2111220346","doi":"https://doi.org/10.1109/mnet.2004.1316756","title":"Scalable geographic routing algorithms for wireless ad hoc networks","display_name":"Scalable geographic routing algorithms for wireless ad hoc networks","publication_year":2004,"publication_date":"2004-07-01","ids":{"openalex":"https://openalex.org/W2111220346","doi":"https://doi.org/10.1109/mnet.2004.1316756","mag":"2111220346"},"language":"en","primary_location":{"id":"doi:10.1109/mnet.2004.1316756","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mnet.2004.1316756","pdf_url":null,"source":{"id":"https://openalex.org/S186584794","display_name":"IEEE Network","issn_l":"0890-8044","issn":["0890-8044","1558-156X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Network","raw_type":"journal-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/A5031115518","display_name":"Hannes Frey","orcid":"https://orcid.org/0009-0003-6943-8422"},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"H. Frey","raw_affiliation_strings":["University of Trier, Germany","Trier University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Trier, Germany","institution_ids":["https://openalex.org/I89864525"]},{"raw_affiliation_string":"Trier University, Germany","institution_ids":["https://openalex.org/I89864525"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031115518"],"corresponding_institution_ids":["https://openalex.org/I89864525"],"apc_list":null,"apc_paid":null,"fwci":6.6597,"has_fulltext":false,"cited_by_count":96,"citation_normalized_percentile":{"value":0.96898201,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"18","issue":"4","first_page":"18","last_page":"22"},"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/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9988999962806702,"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.823081910610199},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.6903546452522278},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6335070133209229},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6002551913261414},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5781099796295166},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5453876256942749},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5412859320640564},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5171222686767578},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.5106194615364075},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.48853763937950134},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.41846922039985657},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.41352805495262146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3384425938129425},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.29193389415740967},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2857416272163391},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.20770615339279175},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.11599162220954895}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.823081910610199},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.6903546452522278},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6335070133209229},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6002551913261414},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5781099796295166},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5453876256942749},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5412859320640564},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5171222686767578},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.5106194615364075},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.48853763937950134},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.41846922039985657},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.41352805495262146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3384425938129425},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.29193389415740967},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2857416272163391},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.20770615339279175},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.11599162220954895}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mnet.2004.1316756","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mnet.2004.1316756","pdf_url":null,"source":{"id":"https://openalex.org/S186584794","display_name":"IEEE Network","issn_l":"0890-8044","issn":["0890-8044","1558-156X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Network","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1518780012","https://openalex.org/W2044959725","https://openalex.org/W2067243839","https://openalex.org/W2079133215","https://openalex.org/W2085463780","https://openalex.org/W2113906050","https://openalex.org/W2120892803","https://openalex.org/W2123115882","https://openalex.org/W2124297703","https://openalex.org/W2151691150"],"related_works":["https://openalex.org/W2620451430","https://openalex.org/W2336965019","https://openalex.org/W2340460301","https://openalex.org/W1494290658","https://openalex.org/W2097528968","https://openalex.org/W2091164239","https://openalex.org/W2154804934","https://openalex.org/W1484282256","https://openalex.org/W2469742869","https://openalex.org/W4210668819"],"abstract_inverted_index":{"The":[0],"design":[1],"of":[2,15,35,57,124],"efficient":[3],"routing":[4,46,114,126,137],"protocols":[5],"for":[6,121],"dynamical":[7],"changing":[8],"network":[9],"topologies":[10],"is":[11,27,42,52,89],"a":[12,39,90,119],"crucial":[13],"part":[14],"building":[16],"power-efficient":[17],"and":[18,60,128,136],"scalable":[19],"ad":[20],"hoc":[21],"wireless":[22],"networks.":[23],"If":[24],"position":[25],"information":[26],"available":[28],"due":[29],"to":[30,79,94,109,132],"GPS":[31],"or":[32],"some":[33],"kind":[34],"relative":[36],"positioning":[37],"technique,":[38],"promising":[40],"approach":[41],"given":[43],"by":[44],"geographic":[45,125],"algorithms,":[47,127],"where":[48],"each":[49],"forwarding":[50,135],"decision":[51],"based":[53],"on":[54],"the":[55],"positions":[56],"current,":[58],"destination,":[59],"possible":[61,107],"candidate":[62],"nodes":[63],"in":[64,77,138],"vicinity":[65],"only.":[66],"About":[67],"15":[68],"years":[69,98],"ago":[70],"heuristic":[71],"greedy":[72,113,134],"algorithms":[73],"were":[74],"proposed,":[75],"which":[76],"order":[78],"provide":[80],"freedom":[81],"from":[82,92,111],"loops":[83],"might":[84],"fail":[85],"even":[86],"if":[87],"there":[88],"path":[91],"source":[93],"destination.":[95],"In":[96],"recent":[97,130],"planar":[99,139],"graph":[100],"traversal":[101],"has":[102],"been":[103],"investigated":[104],"as":[105],"one":[106],"strategy":[108],"recover":[110],"such":[112],"failures.":[115],"This":[116],"article":[117],"provides":[118],"tutorial":[120],"this":[122],"class":[123],"discusses":[129],"improvements":[131],"both":[133],"graphs.":[140]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}