{"id":"https://openalex.org/W2921152538","doi":"https://doi.org/10.1109/istel.2018.8661097","title":"EiR: An Energy-Efficient Routing Algorithm for Delay Tolerant Networks","display_name":"EiR: An Energy-Efficient Routing Algorithm for Delay Tolerant Networks","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2921152538","doi":"https://doi.org/10.1109/istel.2018.8661097","mag":"2921152538"},"language":"en","primary_location":{"id":"doi:10.1109/istel.2018.8661097","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istel.2018.8661097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 9th International Symposium on Telecommunications (IST)","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/A5018299997","display_name":"Mehri Ashoori","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mehri Ashoori","raw_affiliation_strings":["Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089882636","display_name":"Mohammad Reza Pakravan","orcid":"https://orcid.org/0000-0002-3899-8211"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Reza Pakravan","raw_affiliation_strings":["Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018299997"],"corresponding_institution_ids":["https://openalex.org/I133529467"],"apc_list":null,"apc_paid":null,"fwci":0.1845,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.59115858,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"227","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T11478","display_name":"Caching and Content Delivery","score":0.98580002784729,"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/T13553","display_name":"Age of Information Optimization","score":0.9779999852180481,"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-science","display_name":"Computer science","score":0.7799991369247437},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.7034215331077576},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.6758300065994263},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6588302254676819},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.568610429763794},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.5481749176979065},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5143200159072876},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4899655878543854},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.47677233815193176},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46122413873672485},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45552974939346313},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.4550545811653137},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.44215282797813416},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.41271576285362244},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38361042737960815},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3460506200790405},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11510780453681946}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7799991369247437},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.7034215331077576},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.6758300065994263},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6588302254676819},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.568610429763794},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.5481749176979065},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5143200159072876},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4899655878543854},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.47677233815193176},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46122413873672485},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45552974939346313},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.4550545811653137},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.44215282797813416},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.41271576285362244},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38361042737960815},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3460506200790405},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11510780453681946},{"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/istel.2018.8661097","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istel.2018.8661097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 9th International Symposium on Telecommunications (IST)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.9100000262260437,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W588247792","https://openalex.org/W658676137","https://openalex.org/W1676584033","https://openalex.org/W2006890895","https://openalex.org/W2010634640","https://openalex.org/W2011164891","https://openalex.org/W2017478515","https://openalex.org/W2021497904","https://openalex.org/W2091924929","https://openalex.org/W2273515758","https://openalex.org/W2312087731","https://openalex.org/W2589415983","https://openalex.org/W2795857897","https://openalex.org/W4298354674","https://openalex.org/W6654642102"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W4253436398","https://openalex.org/W1538003338","https://openalex.org/W1655019438","https://openalex.org/W2068473861","https://openalex.org/W2002267183","https://openalex.org/W2364686261","https://openalex.org/W1984835167","https://openalex.org/W2351097701","https://openalex.org/W2556128816"],"abstract_inverted_index":{"Delay":[0],"Tolerant":[1],"Networks":[2],"(DTNs)":[3],"are":[4,54,167],"sparse":[5],"and":[6,38,61,99,109,118,126,142,155,162,172],"highly":[7],"dynamic":[8],"networks":[9,37],"where":[10],"intermittent":[11],"connectivity":[12],"is":[13,31,77,175],"a":[14,32,92,176,197,204],"common":[15],"event.":[16],"In":[17,67],"these":[18,36,87],"networks,":[19],"nodes":[20,149,195],"have":[21,40],"time-limited":[22],"connection":[23],"opportunity":[24],"to":[25,42,64,90,105,122,209],"other":[26],"moving":[27,146],"nodes.":[28,84],"Therefore,":[29],"routing":[30,45,52,74,129,153,170,179],"major":[33],"challenge":[34],"in":[35],"researchers":[39],"tried":[41],"design":[43,123],"efficient":[44],"algorithms.":[46,212],"Important":[47],"performance":[48],"metrics":[49],"of":[50,83,101,112,138,144,148,194,199],"desired":[51],"algorithms":[53,171],"high":[55],"delivery":[56,206],"probability,":[57],"low":[58,62,127],"energy":[59,192],"consumption":[60,193],"end":[63,65],"latency.":[66],"this":[68],"paper,":[69],"we":[70,96],"propose":[71],"an":[72,124],"energy-efficient":[73,125],"algorithm":[75,130,154,189],"which":[76],"based":[78],"upon":[79],"the":[80,136,151,157,173,191],"encounter":[81,88],"probabilities":[82,89],"We":[85,134],"use":[86],"derive":[91],"utility":[93,116],"metric.":[94],"Moreover,":[95],"utilize":[97],"assumptions":[98],"observations":[100],"small":[102],"world":[103],"experiment":[104],"limit":[106],"active":[107],"copies":[108],"permitted":[110],"hops":[111],"messages.":[113],"The":[114,164],"proposed":[115,152,178,188,211],"metric":[117],"constraints":[119],"lead":[120],"us":[121],"overhead":[128],"for":[131,181],"DTN":[132,169,182],"applications.":[133],"evaluate":[135],"impact":[137],"limited":[139],"buffer":[140],"capacity":[141],"variation":[143],"maximum":[145],"speed":[147],"on":[150],"compare":[156],"results":[158],"with":[159],"MaxProp,":[160],"PROPHET,":[161],"SeeR.":[163],"first":[165],"two":[166],"well-known":[168],"third":[174],"recently":[177],"scheme":[180],"scenarios.":[183],"Results":[184],"show":[185],"that":[186],"our":[187],"reduces":[190],"by":[196],"factor":[198],"4.":[200],"It":[201],"also":[202],"has":[203],"higher":[205],"probability":[207],"compared":[208],"previously":[210]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}