{"id":"https://openalex.org/W2326649519","doi":"https://doi.org/10.1109/med.2016.7536054","title":"Trust-aware network utility optimization in multihop wireless networks with delay constraints","display_name":"Trust-aware network utility optimization in multihop wireless networks with delay constraints","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2326649519","doi":"https://doi.org/10.1109/med.2016.7536054","mag":"2326649519"},"language":"en","primary_location":{"id":"doi:10.1109/med.2016.7536054","is_oa":false,"landing_page_url":"https://doi.org/10.1109/med.2016.7536054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 24th Mediterranean Conference on Control and Automation (MED)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1603.09278","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Evripidis Paraskevas","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Evripidis Paraskevas","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Tao Jiang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101778","display_name":"Samsung (United States)","ror":"https://ror.org/01bfbvm65","country_code":"US","type":"company","lineage":["https://openalex.org/I2250650973","https://openalex.org/I4210101778"]},{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tao Jiang","raw_affiliation_strings":["Samsung Research America-Dallas, Richardson, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Samsung Research America-Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319","https://openalex.org/I4210101778"]}]},{"author_position":"last","author":{"id":null,"display_name":"John S. Baras","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John S. Baras","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":1.4765,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.84153082,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"24","issue":null,"first_page":"593","last_page":"598"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc 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/T10246","display_name":"Mobile Ad Hoc 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/T10796","display_name":"Cooperative Communication and Network Coding","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/T11158","display_name":"Wireless Networks and Protocols","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"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6086000204086304},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5631999969482422},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.5544999837875366},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.5314000248908997},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.47380000352859497},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.46459999680519104},{"id":"https://openalex.org/keywords/utility-maximization-problem","display_name":"Utility maximization problem","score":0.39239999651908875},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3693999946117401}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7318999767303467},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6086000204086304},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5631999969482422},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.5544999837875366},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5314000248908997},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4884999990463257},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.47380000352859497},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4722999930381775},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.46459999680519104},{"id":"https://openalex.org/C2779044140","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization problem","level":3,"score":0.39239999651908875},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3693999946117401},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3671000003814697},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.33500000834465027},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.3231000006198883},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.31060001254081726},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3084999918937683},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.26260000467300415}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/med.2016.7536054","is_oa":false,"landing_page_url":"https://doi.org/10.1109/med.2016.7536054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 24th Mediterranean Conference on Control and Automation (MED)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1603.09278","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1603.09278","pdf_url":"https://arxiv.org/pdf/1603.09278","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1603.09278","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1603.09278","pdf_url":"https://arxiv.org/pdf/1603.09278","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1490838413","https://openalex.org/W1988044997","https://openalex.org/W2064545653","https://openalex.org/W2075343554","https://openalex.org/W2123893388","https://openalex.org/W2127699957","https://openalex.org/W2130203633","https://openalex.org/W2138205851","https://openalex.org/W2158893758","https://openalex.org/W2162986857","https://openalex.org/W2164470162","https://openalex.org/W2168205742","https://openalex.org/W2170178059","https://openalex.org/W2326649519","https://openalex.org/W2964223742","https://openalex.org/W4243641201","https://openalex.org/W4245276699","https://openalex.org/W4250589301","https://openalex.org/W6654858518"],"related_works":[],"abstract_inverted_index":{"Many":[0],"resource":[1],"allocation":[2],"problems":[3],"can":[4,44],"be":[5,45],"formulated":[6],"as":[7],"a":[8,12],"constrained":[9],"maximization":[10],"of":[11,104,115,129],"utility":[13],"function.":[14],"Network":[15],"Utility":[16],"Maximization":[17],"(NUM)":[18],"applies":[19],"optimization":[20,74],"techniques":[21],"to":[22,95,124],"achieve":[23],"decomposition":[24],"by":[25,47],"duality":[26],"or":[27],"the":[28,63,73,82,116,126],"primal-dual":[29],"method.":[30],"Several":[31],"important":[32,57],"problems,":[33],"for":[34,113,133],"example":[35],"joint":[36],"source":[37],"rate":[38],"control,":[39],"routing,":[40],"and":[41,66,88],"scheduling":[42],"design,":[43],"optimized":[46],"using":[48],"this":[49,52],"framework.":[50,75],"In":[51],"work,":[53],"we":[54,67],"introduce":[55],"an":[56],"network":[58,86],"security":[59],"concept,":[60],"\u201ctrust\u201d,":[61],"into":[62],"NUM":[64],"formulation":[65],"integrate":[68],"nodes'":[69],"trust":[70,77],"values":[71,78],"in":[72],"These":[76],"are":[79,122],"based":[80,90],"on":[81],"interaction":[83],"history":[84],"between":[85],"entities":[87],"community":[89],"monitoring.":[91],"Our":[92],"objective":[93],"is":[94],"avoid":[96],"routing":[97],"packets":[98],"though":[99],"paths":[100],"with":[101],"large":[102],"percentage":[103],"malicious":[105],"nodes.":[106],"We":[107],"also":[108],"add":[109],"end-to-end":[110],"delay":[111,120],"constraints":[112,121],"each":[114,134],"traffic":[117,135],"flows.":[118],"The":[119],"introduced":[123],"capture":[125],"imposed":[127],"quality":[128],"service":[130],"(QoS)":[131],"requirements":[132],"flow.":[136]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-22T09:01:20.584952","created_date":"2016-06-24T00:00:00"}