{"id":"https://openalex.org/W2112751665","doi":"https://doi.org/10.1109/.2006.1629385","title":"Path Cost Metrics for Multi-Hop Network Routing","display_name":"Path Cost Metrics for Multi-Hop Network Routing","publication_year":2006,"publication_date":"2006-05-25","ids":{"openalex":"https://openalex.org/W2112751665","doi":"https://doi.org/10.1109/.2006.1629385","mag":"2112751665"},"language":"en","primary_location":{"id":"doi:10.1109/.2006.1629385","is_oa":false,"landing_page_url":"https://doi.org/10.1109/.2006.1629385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Performance Computing and Communications Conference","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":null,"display_name":"Lijuan Cao","orcid":null},"institutions":[{"id":"https://openalex.org/I102149020","display_name":"University of North Carolina at Charlotte","ror":"https://ror.org/04dawnj30","country_code":"US","type":"education","lineage":["https://openalex.org/I102149020"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lijuan Cao","raw_affiliation_strings":["Department of Computer Science, University of North Carolina, Charlotte, Charlotte, NC, USA","Dept. of Comput. Sci.,, North Carolina Univ., Charlotte, NC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina, Charlotte, Charlotte, NC, USA","institution_ids":["https://openalex.org/I102149020"]},{"raw_affiliation_string":"Dept. of Comput. Sci.,, North Carolina Univ., Charlotte, NC","institution_ids":["https://openalex.org/I102149020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057464520","display_name":"Teresa A. Dahlberg","orcid":null},"institutions":[{"id":"https://openalex.org/I102149020","display_name":"University of North Carolina at Charlotte","ror":"https://ror.org/04dawnj30","country_code":"US","type":"education","lineage":["https://openalex.org/I102149020"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. Dahlberg","raw_affiliation_strings":["Department of Computer Science, University of North Carolina, Charlotte, Charlotte, NC, USA","Dept. of Comput. Sci.,, North Carolina Univ., Charlotte, NC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina, Charlotte, Charlotte, NC, USA","institution_ids":["https://openalex.org/I102149020"]},{"raw_affiliation_string":"Dept. of Comput. Sci.,, North Carolina Univ., Charlotte, NC","institution_ids":["https://openalex.org/I102149020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5235,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.90511391,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"27","issue":null,"first_page":"15","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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9994999766349792,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.8333264589309692},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8310710191726685},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5554164052009583},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5316942930221558},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.488309383392334},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4775555729866028},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.473473459482193},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4654916524887085},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.46340039372444153},{"id":"https://openalex.org/keywords/metrics","display_name":"Metrics","score":0.4566887617111206},{"id":"https://openalex.org/keywords/source-routing","display_name":"Source routing","score":0.44275155663490295},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.4352427124977112},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.4348428249359131},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.43387818336486816},{"id":"https://openalex.org/keywords/routing-information-protocol","display_name":"Routing Information Protocol","score":0.4224848747253418},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.20863768458366394},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09236910939216614}],"concepts":[{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.8333264589309692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8310710191726685},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5554164052009583},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5316942930221558},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.488309383392334},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4775555729866028},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.473473459482193},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4654916524887085},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.46340039372444153},{"id":"https://openalex.org/C195780805","wikidata":"https://www.wikidata.org/wiki/Q1535986","display_name":"Metrics","level":5,"score":0.4566887617111206},{"id":"https://openalex.org/C44010500","wikidata":"https://www.wikidata.org/wiki/Q1422567","display_name":"Source routing","level":5,"score":0.44275155663490295},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.4352427124977112},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.4348428249359131},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.43387818336486816},{"id":"https://openalex.org/C7573999","wikidata":"https://www.wikidata.org/wiki/Q207580","display_name":"Routing Information Protocol","level":5,"score":0.4224848747253418},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.20863768458366394},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09236910939216614},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/.2006.1629385","is_oa":false,"landing_page_url":"https://doi.org/10.1109/.2006.1629385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Performance Computing and Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.8899999856948853,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1894885767","https://openalex.org/W1903485920","https://openalex.org/W1983681337","https://openalex.org/W1992876548","https://openalex.org/W2017333190","https://openalex.org/W2047377413","https://openalex.org/W2097624841","https://openalex.org/W2099574482","https://openalex.org/W2157457404","https://openalex.org/W2167169755","https://openalex.org/W6639599988"],"related_works":["https://openalex.org/W1640796511","https://openalex.org/W2120137201","https://openalex.org/W2003936810","https://openalex.org/W2139746613","https://openalex.org/W2147199059","https://openalex.org/W1985364327","https://openalex.org/W1967396936","https://openalex.org/W2183106894","https://openalex.org/W1597161197","https://openalex.org/W4200541282"],"abstract_inverted_index":{"Future":[0],"network":[1],"architectures":[2],"for":[3,33,39,50,93],"mesh":[4],"networks,":[5,7,83],"sensor":[6],"and":[8,25,46,130,147],"hybrid":[9],"networks":[10,36],"include":[11],"multiple":[12],"wireless":[13],"hops":[14],"with":[15,137],"fixed":[16],"or":[17,63,72],"mobile":[18,23,44],"routers":[19],"relaying":[20],"messages":[21],"between":[22,42],"nodes":[24],"access":[26,48],"points.":[27],"The":[28],"vast":[29],"literature":[30],"on":[31],"routing":[32,58],"ad":[34,56],"hoc":[35,57],"is":[37,74],"applicable":[38],"route":[40,117],"discovery":[41],"a":[43,67,84,107,134],"node":[45],"an":[47],"point":[49],"these":[51],"multi-hop":[52,82],"networks.":[53],"However,":[54],"most":[55],"protocols":[59],"rely":[60],"upon":[61],"\"least-cost\"":[62],"\"shortest-path\"":[64],"routing,":[65],"wherein":[66],"single":[68],"metric":[69],"of":[70,86,109],"hop-count":[71],"energy-usage":[73,131],"used":[75],"to":[76,112,127],"define":[77,113],"the":[78],"path":[79,95,114],"cost.":[80,96],"For":[81],"number":[85,108],"additional":[87],"metrics":[88],"should":[89],"be":[90],"simultaneously":[91],"considered":[92],"determining":[94],"In":[97],"this":[98],"paper,":[99],"we":[100],"introduce":[101],"our":[102],"first":[103],"step":[104],"towards":[105],"combining":[106],"cost":[110,115],"criteria":[111],"during":[116],"discovery.":[118],"Our":[119],"simulation":[120],"results":[121,132],"indicate":[122],"that":[123],"giving":[124],"simultaneous":[125],"consideration":[126],"hop-count,":[128],"path-congestion,":[129],"in":[133],"system":[135],"performance":[136],"greater":[138],"packet":[139],"delivery":[140],"ratio,":[141],"lower":[142,145,148],"end-to-end":[143],"delay,":[144],"overhead,":[146],"per-node":[149],"energy":[150],"usage":[151]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}