{"id":"https://openalex.org/W1587375058","doi":"https://doi.org/10.1007/978-3-642-03367-4_49","title":"Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs","display_name":"Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1587375058","doi":"https://doi.org/10.1007/978-3-642-03367-4_49","mag":"1587375058"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-03367-4_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03367-4_49","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5052402488","display_name":"Chenyu Yan","orcid":"https://orcid.org/0000-0003-1974-7107"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chenyu Yan","raw_affiliation_strings":["Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, U.S.A","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100666554","display_name":"Yang Xiang","orcid":"https://orcid.org/0000-0001-5252-0831"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Xiang","raw_affiliation_strings":["Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, U.S.A","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086851146","display_name":"Feodor F. Dragan","orcid":null},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Feodor F. Dragan","raw_affiliation_strings":["Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, U.S.A","institution_ids":["https://openalex.org/I149910238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0811,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73081642,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"566","last_page":"577"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.995199978351593,"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.9944999814033508,"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/vertex","display_name":"Vertex (graph theory)","score":0.7414970993995667},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6363093852996826},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.5979965329170227},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5094559788703918},{"id":"https://openalex.org/keywords/unit-disk-graph","display_name":"Unit disk graph","score":0.4756945073604584},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4604419469833374},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4467219412326813},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4222082197666168},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.37924253940582275},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.32586783170700073},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2985069453716278},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2983741760253906},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.24288487434387207},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.22211876511573792},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1846155822277069},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16818678379058838},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1412484049797058},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08627325296401978}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7414970993995667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6363093852996826},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.5979965329170227},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5094559788703918},{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.4756945073604584},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4604419469833374},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4467219412326813},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4222082197666168},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.37924253940582275},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.32586783170700073},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2985069453716278},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2983741760253906},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.24288487434387207},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.22211876511573792},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1846155822277069},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16818678379058838},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1412484049797058},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08627325296401978},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-03367-4_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03367-4_49","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.160.132","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.132","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.kent.edu/~dragan/WADS2009.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1489554686","https://openalex.org/W1494596592","https://openalex.org/W1555349516","https://openalex.org/W1568961751","https://openalex.org/W1587867115","https://openalex.org/W1907032667","https://openalex.org/W1983502795","https://openalex.org/W1983598160","https://openalex.org/W1985758609","https://openalex.org/W2031256962","https://openalex.org/W2038643780","https://openalex.org/W2044959725","https://openalex.org/W2057994027","https://openalex.org/W2063572899","https://openalex.org/W2073271991","https://openalex.org/W2085463780","https://openalex.org/W2093095561","https://openalex.org/W2101963262","https://openalex.org/W2121808152","https://openalex.org/W2124784817","https://openalex.org/W2152809170","https://openalex.org/W2152948207","https://openalex.org/W2156271404","https://openalex.org/W2161843738","https://openalex.org/W2167838689","https://openalex.org/W2290450095","https://openalex.org/W2405987263","https://openalex.org/W2602480688","https://openalex.org/W4205300528","https://openalex.org/W4232452653"],"related_works":["https://openalex.org/W2540907302","https://openalex.org/W2430455952","https://openalex.org/W2145862009","https://openalex.org/W2098287480","https://openalex.org/W2034296768","https://openalex.org/W2189300248","https://openalex.org/W2007580270","https://openalex.org/W2260470578","https://openalex.org/W2204238626","https://openalex.org/W2137458781"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}