{"id":"https://openalex.org/W2076090993","doi":"https://doi.org/10.1109/twc.2015.2403351","title":"A Framework for Evaluating the Best Achievable Performance by Distributed Lifetime-Efficient Routing Schemes in Wireless Sensor Networks","display_name":"A Framework for Evaluating the Best Achievable Performance by Distributed Lifetime-Efficient Routing Schemes in Wireless Sensor Networks","publication_year":2015,"publication_date":"2015-02-13","ids":{"openalex":"https://openalex.org/W2076090993","doi":"https://doi.org/10.1109/twc.2015.2403351","mag":"2076090993"},"language":"en","primary_location":{"id":"doi:10.1109/twc.2015.2403351","is_oa":false,"landing_page_url":"https://doi.org/10.1109/twc.2015.2403351","pdf_url":null,"source":{"id":"https://openalex.org/S63459445","display_name":"IEEE Transactions on Wireless Communications","issn_l":"1536-1276","issn":["1536-1276","1558-2248"],"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 Transactions on Wireless Communications","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/A5088153645","display_name":"Jalal Habibi","orcid":null},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Jalal Habibi","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Concordia University, Montr\u00e9al, Qu\u00e9bec, Canada","Dept. of Electr. & Comput. Eng., Concordia Univ., Montre\u0301al, QC, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Concordia University, Montr\u00e9al, Qu\u00e9bec, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Concordia Univ., Montre\u0301al, QC, Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023864111","display_name":"Amir G. Aghdam","orcid":"https://orcid.org/0000-0001-5180-0508"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Amir G. Aghdam","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Concordia University, Montr\u00e9al, Qu\u00e9bec, Canada","Dept. of Electr. & Comput. Eng., Concordia Univ., Montre\u0301al, QC, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Concordia University, Montr\u00e9al, Qu\u00e9bec, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Concordia Univ., Montre\u0301al, QC, Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014049864","display_name":"Ali Ghrayeb","orcid":"https://orcid.org/0000-0002-6808-5886"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]},{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA","US"],"is_corresponding":false,"raw_author_name":"Ali Ghrayeb","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Concordia University, Montr\u00e9al, QC, Canada","Dept. of Electr. & Comput. Eng., Texas A & M Univ. at Qatar, Doha, Qatar"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Concordia University, Montr\u00e9al, QC, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Texas A & M Univ. at Qatar, Doha, Qatar","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088153645"],"corresponding_institution_ids":["https://openalex.org/I60158472"],"apc_list":null,"apc_paid":null,"fwci":2.3297,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.8972485,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"14","issue":"6","first_page":"3231","last_page":"3246"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor 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/T10080","display_name":"Energy Efficient Wireless Sensor 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/T10246","display_name":"Mobile Ad Hoc 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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.7628663778305054},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6256732940673828},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6217490434646606},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6155095100402832},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5513135194778442},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.539450466632843},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.535069465637207},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5257476568222046},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.49953341484069824},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.48886388540267944},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4537019431591034},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.4516701400279999},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.43019551038742065},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4173480272293091},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39544808864593506},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3953888416290283},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3672197759151459},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.1607615351676941},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1271546185016632},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0815509557723999},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.06644275784492493}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7628663778305054},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6256732940673828},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6217490434646606},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6155095100402832},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5513135194778442},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.539450466632843},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.535069465637207},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5257476568222046},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49953341484069824},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.48886388540267944},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4537019431591034},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.4516701400279999},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.43019551038742065},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4173480272293091},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39544808864593506},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3953888416290283},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3672197759151459},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.1607615351676941},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1271546185016632},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0815509557723999},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.06644275784492493},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/twc.2015.2403351","is_oa":false,"landing_page_url":"https://doi.org/10.1109/twc.2015.2403351","pdf_url":null,"source":{"id":"https://openalex.org/S63459445","display_name":"IEEE Transactions on Wireless Communications","issn_l":"1536-1276","issn":["1536-1276","1558-2248"],"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 Transactions on Wireless Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8999999761581421,"id":"https://metadata.un.org/sdg/7"}],"awards":[{"id":"https://openalex.org/G27741932","display_name":null,"funder_award_id":"N00850","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G4396955011","display_name":null,"funder_award_id":"N00858","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1511213320","https://openalex.org/W1612069777","https://openalex.org/W1990761225","https://openalex.org/W1992876548","https://openalex.org/W2006033216","https://openalex.org/W2015563522","https://openalex.org/W2046497867","https://openalex.org/W2051398902","https://openalex.org/W2053089950","https://openalex.org/W2060121790","https://openalex.org/W2061560193","https://openalex.org/W2064630832","https://openalex.org/W2096741434","https://openalex.org/W2101447447","https://openalex.org/W2101600057","https://openalex.org/W2101904623","https://openalex.org/W2111075016","https://openalex.org/W2113443014","https://openalex.org/W2116458021","https://openalex.org/W2119545161","https://openalex.org/W2119548540","https://openalex.org/W2121723384","https://openalex.org/W2124415567","https://openalex.org/W2124743724","https://openalex.org/W2126130938","https://openalex.org/W2131720379","https://openalex.org/W2132004615","https://openalex.org/W2132895032","https://openalex.org/W2137243960","https://openalex.org/W2137775453","https://openalex.org/W2139171311","https://openalex.org/W2143514830","https://openalex.org/W2144161535","https://openalex.org/W2150050284","https://openalex.org/W2153200851","https://openalex.org/W2156899574","https://openalex.org/W2159808897","https://openalex.org/W2161152645","https://openalex.org/W2162658094","https://openalex.org/W2164597602","https://openalex.org/W2165903656","https://openalex.org/W2166122937","https://openalex.org/W2168452204","https://openalex.org/W2170106967","https://openalex.org/W2479778494","https://openalex.org/W4247840447","https://openalex.org/W6630654670","https://openalex.org/W6648283419"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2117516174","https://openalex.org/W2041853321","https://openalex.org/W2406963874","https://openalex.org/W2965704649","https://openalex.org/W2543752581","https://openalex.org/W2361465121","https://openalex.org/W2607223747","https://openalex.org/W1968750272"],"abstract_inverted_index":{"This":[0],"paper":[1],"is":[2,66,138],"concerned":[3],"with":[4,150],"energy-efficient":[5],"routing":[6,15,85,119,174],"in":[7,68,115],"wireless":[8],"sensor":[9],"networks.":[10],"Most":[11],"of":[12,60,128,172],"the":[13,25,29,33,37,44,50,58,61,74,89,101,105,112,126,146,156,160,169],"existing":[14,62,173],"schemes":[16],"assign":[17],"energy-related":[18],"costs":[19],"to":[20,31,71,125,141,145,167],"network":[21,38,94],"links":[22],"and":[23,39,49,96],"obtain":[24,142],"shortest":[26],"paths":[27],"for":[28,57],"nodes":[30],"balance":[32],"flowing":[34],"traffic":[35],"within":[36],"increase":[40],"its":[41],"lifetime.":[42],"However,":[43],"optimal":[45,106,161],"link":[46,107,130],"cost":[47,108,131],"values":[48],"maximum":[51,113],"achievable":[52,76],"lifetime":[53,114],"are":[54,123],"not":[55],"known":[56],"majority":[59],"schemes.":[63],"A":[64,135],"framework":[65,103,158],"provided":[67],"this":[69],"work":[70],"analytically":[72],"derive":[73],"best":[75,147],"performance":[77,148],"that":[78],"can":[79],"be":[80],"obtained":[81],"by":[82],"any":[83],"distributed":[84,117],"algorithm":[86,137],"based":[87],"on":[88],"shortest-path":[90,118],"approach.":[91],"Given":[92],"a":[93,116,165],"configuration":[95],"an":[97],"energy":[98,170],"consumption":[99],"model,":[100],"presented":[102],"provides":[104,159],"assignment":[109,132],"which":[110],"yields":[111],"strategy.":[120],"The":[121],"results":[122],"extended":[124],"case":[127],"variable":[129],"as":[133,164],"well.":[134],"heuristic":[136],"also":[139],"developed":[140],"approximate":[143],"solutions":[144],"problem":[149],"limited":[151],"computational":[152],"complexity.":[153],"In":[154],"particular,":[155],"proposed":[157],"route":[162],"selection":[163],"benchmark":[166],"evaluate":[168],"efficiency":[171],"algorithms.":[175]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}