{"id":"https://openalex.org/W7135077855","doi":"https://doi.org/10.1109/camsap66162.2025.11423946","title":"Optimized Sparse Network Coverage via L1-norm Minimization","display_name":"Optimized Sparse Network Coverage via L1-norm Minimization","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7135077855","doi":"https://doi.org/10.1109/camsap66162.2025.11423946"},"language":null,"primary_location":{"id":"doi:10.1109/camsap66162.2025.11423946","is_oa":false,"landing_page_url":"https://doi.org/10.1109/camsap66162.2025.11423946","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 10th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)","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/A5128837049","display_name":"Souvik Paul","orcid":null},"institutions":[{"id":"https://openalex.org/I158636061","display_name":"Deutz (Germany)","ror":"https://ror.org/01kg37d11","country_code":"DE","type":"company","lineage":["https://openalex.org/I158636061"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Souvik Paul","raw_affiliation_strings":["Lenovo Deutchland GmbH,Germany"],"affiliations":[{"raw_affiliation_string":"Lenovo Deutchland GmbH,Germany","institution_ids":["https://openalex.org/I158636061"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093255412","display_name":"Iv\u00e1n Alexander Morales Sandoval","orcid":"https://orcid.org/0000-0002-8601-5451"},"institutions":[{"id":"https://openalex.org/I2801221094","display_name":"Constructing Excellence","ror":"https://ror.org/04vxrkc13","country_code":"GB","type":"other","lineage":["https://openalex.org/I2801221094"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Iv\u00e1n Alexander Morales Sandoval","raw_affiliation_strings":["Constructor University,Germany"],"affiliations":[{"raw_affiliation_string":"Constructor University,Germany","institution_ids":["https://openalex.org/I2801221094"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042210188","display_name":"Giuseppe Thadeu Freitas de Abreu","orcid":"https://orcid.org/0000-0002-5018-8174"},"institutions":[{"id":"https://openalex.org/I2801221094","display_name":"Constructing Excellence","ror":"https://ror.org/04vxrkc13","country_code":"GB","type":"other","lineage":["https://openalex.org/I2801221094"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Giuseppe Thadeu Freitas de Abreu","raw_affiliation_strings":["Constructor University,Germany"],"affiliations":[{"raw_affiliation_string":"Constructor University,Germany","institution_ids":["https://openalex.org/I2801221094"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5128837049"],"corresponding_institution_ids":["https://openalex.org/I158636061"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.88408384,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"6","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.2741999924182892,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.2741999924182892,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.1379999965429306,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.05700000002980232,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/minification","display_name":"Minification","score":0.6040999889373779},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.32109999656677246},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.31189998984336853},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.2741999924182892},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.26350000500679016}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6040999889373779},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5741999745368958},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4749000072479248},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32120001316070557},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.32109999656677246},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.31189998984336853},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3073999881744385},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26840001344680786},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.2540000081062317}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/camsap66162.2025.11423946","is_oa":false,"landing_page_url":"https://doi.org/10.1109/camsap66162.2025.11423946","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 10th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1969665089","https://openalex.org/W1971937094","https://openalex.org/W2008620264","https://openalex.org/W2016929496","https://openalex.org/W2083984856","https://openalex.org/W2088087163","https://openalex.org/W2106335692","https://openalex.org/W2137519579","https://openalex.org/W2155492251","https://openalex.org/W2157054705","https://openalex.org/W2168452204","https://openalex.org/W2920305497","https://openalex.org/W4235283532","https://openalex.org/W4312512934","https://openalex.org/W4382786979","https://openalex.org/W4406625022","https://openalex.org/W4409171587","https://openalex.org/W4410582831","https://openalex.org/W4411196541"],"related_works":[],"abstract_inverted_index":{"The":[0,83],"selection":[1,141],"of":[2,35,54,67],"nodes":[3,37],"that":[4,114],"can":[5],"serve":[6],"as":[7,50],"cluster":[8],"heads,":[9],"local":[10],"sinks":[11],"and":[12,21,70,90,94,108,123,130,138],"gateways":[13],"is":[14,86,112],"a":[15,27,32,51,74,79,135],"critical":[16],"challenge":[17],"in":[18],"distributed":[19],"sensor":[20],"communication":[22],"networks.":[23],"This":[24],"paper":[25],"presents":[26],"novel":[28],"framework":[29],"for":[30],"identifying":[31],"minimal":[33],"set":[34,57],"nexus":[36],"to":[38,88,127],"ensure":[39],"full":[40],"network":[41,92],"coverage":[42],"while":[43],"minimizing":[44],"cost.":[45],"By":[46],"formulating":[47],"the":[48,55,62,115],"problem":[49],"convex":[52],"relaxation":[53],"NP-hard":[56],"cover":[58],"problem,":[59],"we":[60],"integrate":[61],"graph":[63,106],"theoretic":[64],"centrality":[65,72],"measures":[66],"node":[68,140],"degree":[69],"betweenness":[71],"into":[73],"cost":[75],"function":[76],"optimized":[77],"via":[78],"relaxed":[80],"$\\ell_{1}$-norm":[81],"minimization.":[82],"proposed":[84],"approach":[85],"applicable":[87],"static":[89],"dynamic":[91,109],"scenarios":[93],"does":[95],"not":[96],"require":[97],"location":[98],"or":[99],"distance":[100],"estimation.":[101],"Through":[102],"simulations":[103],"across":[104],"various":[105],"models":[107],"conditions,":[110],"it":[111],"shown":[113],"method":[116],"achieves":[117],"faster":[118],"execution":[119],"times":[120],"(lower":[121],"complexity)":[122],"competitive":[124],"sparsity":[125],"compared":[126],"classical":[128],"greedy":[129],"genetic":[131],"algorithms":[132],"(GA),":[133],"offering":[134],"robust,":[136],"distributed,":[137],"cost-efficient":[139],"solution.":[142]},"counts_by_year":[],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2026-03-13T00:00:00"}