{"id":"https://openalex.org/W2139074424","doi":"https://doi.org/10.1109/glocom.2005.1578303","title":"Cost efficient routing strategies over virtual coordinates for wireless sensor networks","display_name":"Cost efficient routing strategies over virtual coordinates for wireless sensor networks","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2139074424","doi":"https://doi.org/10.1109/glocom.2005.1578303","mag":"2139074424"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2005.1578303","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2005.1578303","pdf_url":null,"source":{"id":"https://openalex.org/S4363608563","display_name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","raw_type":"proceedings-article"},"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/A5012618073","display_name":"Michele Rossi","orcid":"https://orcid.org/0000-0003-1121-324X"},"institutions":[{"id":"https://openalex.org/I201324441","display_name":"University of Ferrara","ror":"https://ror.org/041zkgm14","country_code":"IT","type":"education","lineage":["https://openalex.org/I201324441"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Rossi","raw_affiliation_strings":["Department of Engineering, University of Ferrara, Ferrara, Italy","Dept. of Eng., Ferrara Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Engineering, University of Ferrara, Ferrara, Italy","institution_ids":["https://openalex.org/I201324441"]},{"raw_affiliation_string":"Dept. of Eng., Ferrara Univ","institution_ids":["https://openalex.org/I201324441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005894115","display_name":"Michele Zorzi","orcid":"https://orcid.org/0000-0003-2870-4678"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]},{"id":"https://openalex.org/I201324441","display_name":"University of Ferrara","ror":"https://ror.org/041zkgm14","country_code":"IT","type":"education","lineage":["https://openalex.org/I201324441"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Zorzi","raw_affiliation_strings":["Department of Information Engineering, University of Padova, Padova, Italy","University of ferrara"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, University of Padova, Padova, Italy","institution_ids":["https://openalex.org/I138689650"]},{"raw_affiliation_string":"University of ferrara","institution_ids":["https://openalex.org/I201324441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074697921","display_name":"Ramesh R. Rao","orcid":"https://orcid.org/0000-0002-6523-0208"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R.R. Rao","raw_affiliation_strings":["University of California, San Diego, La Jolla, CA, USA","University of California,  San Diego"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California,  San Diego","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3923,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.61423026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"6 pp.","last_page":"2980"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9998999834060669,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9998999834060669,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998999834060669,"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.9955000281333923,"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/computer-science","display_name":"Computer science","score":0.7404952049255371},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.7094881534576416},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6529836654663086},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.614321231842041},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6045742630958557},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.5900700092315674},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5739192962646484},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.5530060529708862},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5337420701980591},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.48861390352249146},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4814947843551636},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.442557692527771},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43753692507743835},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4151100218296051},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3514097332954407},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34256595373153687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17793235182762146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13260996341705322},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1123291552066803}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7404952049255371},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.7094881534576416},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6529836654663086},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.614321231842041},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6045742630958557},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.5900700092315674},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5739192962646484},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.5530060529708862},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5337420701980591},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.48861390352249146},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4814947843551636},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.442557692527771},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43753692507743835},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4151100218296051},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3514097332954407},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34256595373153687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17793235182762146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13260996341705322},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1123291552066803},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/glocom.2005.1578303","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2005.1578303","pdf_url":null,"source":{"id":"https://openalex.org/S4363608563","display_name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:www.research.unipd.it:11577/2472202","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/2472202","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W143181703","https://openalex.org/W1965703925","https://openalex.org/W1992876548","https://openalex.org/W2013614847","https://openalex.org/W2035446426","https://openalex.org/W2084151778","https://openalex.org/W2098432798","https://openalex.org/W2099574482","https://openalex.org/W2102291323","https://openalex.org/W2102310419","https://openalex.org/W2121842672","https://openalex.org/W2122505293","https://openalex.org/W2126449801","https://openalex.org/W2142580474","https://openalex.org/W2157457404","https://openalex.org/W2161958621","https://openalex.org/W2168452204","https://openalex.org/W3144119516","https://openalex.org/W4298856952"],"related_works":["https://openalex.org/W2347665962","https://openalex.org/W2351097701","https://openalex.org/W2162880363","https://openalex.org/W1655019438","https://openalex.org/W1996079847","https://openalex.org/W2120137201","https://openalex.org/W2317653264","https://openalex.org/W106527558","https://openalex.org/W1975971517","https://openalex.org/W2950120971"],"abstract_inverted_index":{"In":[0],"this":[1,95],"paper":[2],"we":[3,34,97,122],"focus":[4],"on":[5,70],"routing":[6,101,125,168],"strategies":[7],"for":[8],"wireless":[9],"sensor":[10],"networks":[11],"over":[12],"hop":[13,53,162],"count":[14,54,163],"(HC)":[15],"virtual":[16],"coordinates.":[17],"We":[18,74],"consider":[19],"the":[20,40,43,57,66,71,89,92,111,128,132,150,181],"problem":[21],"of":[22,29,45,60,79,88,131,135,169,174,178,180],"optimally":[23],"delivering":[24],"data":[25],"packets":[26],"by":[27],"means":[28],"multi-hop":[30],"forwarding":[31,151],"techniques":[32],"where":[33,110,127],"assume":[35],"that":[36],"each":[37],"node":[38,69],"in":[39,77,176],"network,":[41],"upon":[42],"execution":[44],"a":[46,52,85,116],"proper":[47],"distribution":[48],"algorithm,":[49],"can":[50],"obtain":[51],"number,":[55],"i.e.,":[56],"minimum":[58,133],"number":[59],"transmissions":[61],"needed":[62],"to":[63,65,114,148,159,171],"get":[64],"sink":[67],"(destination)":[68],"shortest":[72],"path.":[73],"exploit":[75],"HCs":[76],"place":[78],"commonly":[80],"considered":[81],"geographical":[82,167],"coordinates":[83],"as":[84,145],"valuable":[86],"indication":[87],"direction":[90],"towards":[91],"sink.":[93],"Within":[94],"framework,":[96],"present":[98,123],"localized":[99],"greedy":[100,164],"schemes":[102,156],"and":[103,166],"compare":[104],"them":[105],"against":[106],"globally":[107],"optimal":[108],"solutions,":[109],"objective":[112],"is":[113,143],"minimize":[115],"properly":[117],"defined":[118],"cost":[119],"function.":[120],"Further,":[121],"novel":[124],"algorithms":[126],"statistical":[129],"knowledge":[130],"costs":[134],"second":[136],"order":[137,173],"(two":[138],"hops":[139],"away)":[140],"neighboring":[141],"nodes":[142],"used":[144],"an":[146],"aid":[147],"drive":[149],"process.":[152],"These":[153],"statistically":[154],"enhanced":[155],"are":[157],"found":[158],"outperform":[160],"both":[161],"approaches":[165],"up":[170],"one":[172],"magnitude":[175],"terms":[177],"goodness":[179],"selected":[182],"path":[183]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}