{"id":"https://openalex.org/W2060121790","doi":"https://doi.org/10.1145/2513228.2516926","title":"A framework for analyzing the performance of distributed lifetime-efficient routing schemes in wireless sensor networks","display_name":"A framework for analyzing the performance of distributed lifetime-efficient routing schemes in wireless sensor networks","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W2060121790","doi":"https://doi.org/10.1145/2513228.2516926","mag":"2060121790"},"language":"en","primary_location":{"id":"doi:10.1145/2513228.2516926","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2513228.2516926","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 Research in Adaptive and Convergent Systems","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":"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":["Concordia University Montreal, Canada","Concordia University (Montreal, Canada)"],"affiliations":[{"raw_affiliation_string":"Concordia University Montreal, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Concordia University (Montreal, 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":["Concordia University Montreal, Canada","Concordia University (Montreal, Canada)"],"affiliations":[{"raw_affiliation_string":"Concordia University Montreal, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Concordia University (Montreal, 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/I60342839","display_name":"Qatar University","ror":"https://ror.org/00yhnba62","country_code":"QA","type":"education","lineage":["https://openalex.org/I60342839"]},{"id":"https://openalex.org/I58152225","display_name":"Texas A&M University at Qatar","ror":"https://ror.org/03vb4dm14","country_code":"QA","type":"education","lineage":["https://openalex.org/I58152225","https://openalex.org/I91045830"]}],"countries":["QA"],"is_corresponding":false,"raw_author_name":"Ali Ghrayeb","raw_affiliation_strings":["Texas A&M Qatar University Doha, Qatar"],"affiliations":[{"raw_affiliation_string":"Texas A&M Qatar University Doha, Qatar","institution_ids":["https://openalex.org/I58152225","https://openalex.org/I60342839"]}]}],"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":0.3625,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65980274,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"283","last_page":"288"},"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.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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9990000128746033,"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.735443115234375},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6938970685005188},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6515282988548279},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5978438258171082},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5751466751098633},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5738847851753235},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.546353816986084},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5353997349739075},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.5121283531188965},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.49640733003616333},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.4817197918891907},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4809512495994568},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4496139883995056},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4144821763038635},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39883121848106384},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.38921844959259033},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13743191957473755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10639142990112305}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.735443115234375},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6938970685005188},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6515282988548279},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5978438258171082},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5751466751098633},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5738847851753235},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.546353816986084},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5353997349739075},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.5121283531188965},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.49640733003616333},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.4817197918891907},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4809512495994568},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4496139883995056},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4144821763038635},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39883121848106384},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.38921844959259033},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13743191957473755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10639142990112305},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"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/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.1145/2513228.2516926","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2513228.2516926","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 Research in Adaptive and Convergent Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.9100000262260437,"display_name":"Affordable and clean energy"}],"awards":[{"id":"https://openalex.org/G4564320049","display_name":null,"funder_award_id":"N00850, N00858","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G4842449531","display_name":null,"funder_award_id":"CC0076","funder_id":"https://openalex.org/F4320321588","funder_display_name":"Concordia University"}],"funders":[{"id":"https://openalex.org/F4320321588","display_name":"Concordia University","ror":"https://ror.org/0420zvk78"},{"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":11,"referenced_works":["https://openalex.org/W1511213320","https://openalex.org/W1992876548","https://openalex.org/W2051398902","https://openalex.org/W2053089950","https://openalex.org/W2061560193","https://openalex.org/W2113443014","https://openalex.org/W2132895032","https://openalex.org/W2143514830","https://openalex.org/W2168452204","https://openalex.org/W2613173048","https://openalex.org/W6737445176"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2068473861","https://openalex.org/W2889464401","https://openalex.org/W757657516","https://openalex.org/W2351878639","https://openalex.org/W2539097916","https://openalex.org/W2136173851","https://openalex.org/W2607223747","https://openalex.org/W2361465121"],"abstract_inverted_index":{"This":[0],"paper":[1],"is":[2,66],"concerned":[3],"with":[4],"energy-efficient":[5],"routing":[6,15,81,115,151],"in":[7,30,68,111],"wireless":[8],"sensor":[9],"networks.":[10],"Most":[11],"of":[12,62,124,149],"the":[13,28,34,38,42,45,51,74,85,97,101,108,122,133,137,146],"existing":[14,150],"schemes":[16],"assign":[17],"energy-related":[18],"costs":[19],"to":[20,32,71,121,144],"network":[21,39,90],"links":[22],"and":[23,40,50,92],"obtain":[24],"shortest":[25],"paths":[26],"for":[27,58],"nodes":[29],"order":[31],"balance":[33],"flowing":[35],"traffic":[36],"within":[37],"increase":[41],"lifetime.":[43],"However,":[44],"optimal":[46,102,138],"link":[47,103,126],"cost":[48,104,127],"values":[49],"maximum":[52,109],"achievable":[53,76],"lifetime":[54,110],"are":[55,119],"not":[56],"known":[57],"this":[59,69],"vast":[60],"category":[61],"schemes.":[63],"A":[64],"framework":[65,99,135],"provided":[67],"work":[70],"analytically":[72],"derive":[73],"best":[75],"performance":[77],"by":[78],"any":[79],"distributed":[80,113],"algorithm":[82],"based":[83],"on":[84],"shortest-path":[86,114],"approach.":[87],"Given":[88],"a":[89,112,142],"configuration":[91],"an":[93],"energy":[94,147],"consumption":[95],"model,":[96],"presented":[98],"provides":[100,136],"assignment":[105,128],"which":[106],"yields":[107],"strategy.":[116],"The":[117],"results":[118],"extended":[120],"case":[123],"variable":[125],"as":[129,141],"well.":[130],"In":[131],"particular,":[132],"proposed":[134],"route":[139],"selection":[140],"benchmark":[143],"evaluate":[145],"efficiency":[148],"algorithms.":[152]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}