{"id":"https://openalex.org/W1989404594","doi":"https://doi.org/10.1109/comsnets.2014.6734881","title":"Pareto optimal cross layer lifetime optimization for Disaster Response Networks","display_name":"Pareto optimal cross layer lifetime optimization for Disaster Response Networks","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1989404594","doi":"https://doi.org/10.1109/comsnets.2014.6734881","mag":"1989404594"},"language":"en","primary_location":{"id":"doi:10.1109/comsnets.2014.6734881","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2014.6734881","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Sixth International Conference on Communication Systems and Networks (COMSNETS)","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/A5006259183","display_name":"Harsha Chenji","orcid":"https://orcid.org/0000-0003-3272-7020"},"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"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Harsha Chenji","raw_affiliation_strings":["Department of Computer Science and Engineering, Texas A&M University, College Station, Texas, USA","Department of Computer Science and Engineering, Texas A&M University , College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Texas A&M University, College Station, Texas, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Texas A&M University , College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083949715","display_name":"Radu Stoleru","orcid":"https://orcid.org/0000-0003-3976-4502"},"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Radu Stoleru","raw_affiliation_strings":["Department of Computer Science and Engineering, Texas A&M University, College Station, Texas, USA","Department of Computer Science and Engineering, Texas A&M University , College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Texas A&M University, College Station, Texas, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Texas A&M University , College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006259183"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":1.0344,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78723649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T11896","display_name":"Opportunistic and Delay-Tolerant 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.9993000030517578,"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.9883999824523926,"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/sorting","display_name":"Sorting","score":0.7441413402557373},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7378235459327698},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6922367811203003},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.613609254360199},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5905303955078125},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5501948595046997},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5498544573783875},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.5119744539260864},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.43160104751586914},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.41414108872413635},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4064834713935852},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14092612266540527},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.07863959670066833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07107803225517273}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7441413402557373},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7378235459327698},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6922367811203003},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.613609254360199},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5905303955078125},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5501948595046997},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5498544573783875},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.5119744539260864},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.43160104751586914},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.41414108872413635},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4064834713935852},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14092612266540527},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.07863959670066833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07107803225517273},{"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/comsnets.2014.6734881","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2014.6734881","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Sixth International Conference on Communication Systems and Networks (COMSNETS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","score":0.6399999856948853,"display_name":"Climate action"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1969308036","https://openalex.org/W1978211940","https://openalex.org/W2035778208","https://openalex.org/W2056196692","https://openalex.org/W2068755173","https://openalex.org/W2084182494","https://openalex.org/W2094325201","https://openalex.org/W2125957038","https://openalex.org/W2129565328","https://openalex.org/W2137587950","https://openalex.org/W2140881359","https://openalex.org/W2149429274","https://openalex.org/W2150889340","https://openalex.org/W2160113526","https://openalex.org/W2162076967","https://openalex.org/W2166713974","https://openalex.org/W2171970784","https://openalex.org/W6681949580","https://openalex.org/W6683793466"],"related_works":["https://openalex.org/W2090178682","https://openalex.org/W1994686097","https://openalex.org/W4241467429","https://openalex.org/W2001591765","https://openalex.org/W2073147994","https://openalex.org/W1588199609","https://openalex.org/W2384474142","https://openalex.org/W1550055091","https://openalex.org/W2744462909","https://openalex.org/W3083133203"],"abstract_inverted_index":{"Disaster":[0],"Response":[1],"Networks":[2],"(DRNs)":[3],"are":[4,31],"designed":[5],"to":[6,27,63,102,134,144],"assist":[7],"first":[8],"responders":[9],"during":[10],"the":[11,44,70,85,99,107,121,136,140,169,174],"recovery":[12],"period":[13],"following":[14],"a":[15,76,154,164],"large":[16],"scale":[17],"disaster.":[18],"The":[19,57,113,125],"system":[20,48,51,111,159],"lifetime":[21,160],"of":[22,65,109],"deployed":[23],"DRNs":[24],"is":[25,59,115,132,142,161],"critical":[26],"successful":[28],"recovery,":[29],"as":[30,35,75,120],"performance":[32,49,73,150],"metrics":[33],"such":[34,55,92],"packet":[36,170,175],"delivery":[37,171,176],"delay.":[38],"In":[39],"this":[40],"paper":[41],"we":[42],"investigate":[43],"Pareto":[45],"front":[46],"between":[47],"and":[50,139],"energy":[52],"consumption":[53],"in":[54,84,158,168],"DRNs.":[56],"latter":[58],"further":[60],"reduced":[61],"compared":[62],"state":[64],"art":[66],"methods":[67],"by":[68],"accepting":[69],"least":[71],"possible":[72,162],"penalty":[74],"tradeoff.":[77],"We":[78],"observe":[79],"that":[80,153],"not":[81],"all":[82],"nodes":[83,94],"network":[86],"may":[87],"consume":[88],"or":[89],"produce":[90],"data;":[91],"relay":[93],"can":[95],"be":[96],"excluded":[97],"from":[98],"routing":[100,123],"process":[101],"save":[103],"energy,":[104],"but":[105],"at":[106,146],"cost":[108],"decreased":[110],"performance.":[112],"problem":[114],"formulated":[116],"mathematically":[117],"using":[118],"Raven":[119],"underlying":[122],"protocol.":[124],"Nondominated":[126],"Sorting":[127],"Genetic":[128],"Algorithm":[129],"II":[130],"(NSGA-II)":[131],"used":[133],"obtain":[135],"Pareto-optimal":[137],"points,":[138],"DRN":[141],"made":[143],"operate":[145],"these":[147],"points.":[148],"Extensive":[149],"evaluations":[151],"demonstrate":[152],"162":[155],"minute":[156,166],"increase":[157,167],"for":[163],"61":[165],"delay,":[172],"while":[173],"ratio":[177],"remains":[178],"almost":[179],"constant.":[180]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}