{"id":"https://openalex.org/W2147926631","doi":"https://doi.org/10.1142/s1793830909000348","title":"EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS","display_name":"EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2147926631","doi":"https://doi.org/10.1142/s1793830909000348","mag":"2147926631"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830909000348","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830909000348","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-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/A5045151661","display_name":"James K. V. Willson","orcid":"https://orcid.org/0000-0002-8496-3597"},"institutions":[{"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":true,"raw_author_name":"JAMES K. WILLSON","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, 2601 North Floyd Road, Richardson, TX 75083, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, 2601 North Floyd Road, Richardson, TX 75083, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019439900","display_name":"Xiaofeng Gao","orcid":"https://orcid.org/0000-0003-1776-8799"},"institutions":[{"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":"XIAOFENG GAO","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, 2601 North Floyd Road, Richardson, TX 75083, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, 2601 North Floyd Road, Richardson, TX 75083, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006747873","display_name":"Zhonghua Qu","orcid":null},"institutions":[{"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":"ZHONGHUA QU","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, 2601 North Floyd Road, Richardson, TX 75083, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, 2601 North Floyd Road, Richardson, TX 75083, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014773580","display_name":"Yi Zhu","orcid":"https://orcid.org/0000-0003-0507-7042"},"institutions":[{"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":"YI ZHU","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, 2601 North Floyd Road, Richardson, TX 75083, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, 2601 North Floyd Road, Richardson, TX 75083, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046635673","display_name":"Yingshu Li","orcid":"https://orcid.org/0000-0002-1906-7112"},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"YINGSHU LI","raw_affiliation_strings":["Department of Computer Science, Georgia State University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Georgia State University, USA","institution_ids":["https://openalex.org/I181565077"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070037321","display_name":"Weili Wu","orcid":"https://orcid.org/0000-0001-8747-6340"},"institutions":[{"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":"WEILI WU","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, 2601 North Floyd Road, Richardson, TX 75083, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, 2601 North Floyd Road, Richardson, TX 75083, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5045151661"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":7.9671,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.97659264,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"01","issue":"04","first_page":"437","last_page":"461"},"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.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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9983000159263611,"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.7299788594245911},{"id":"https://openalex.org/keywords/topology-control","display_name":"Topology control","score":0.6435214281082153},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5700903534889221},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.556090235710144},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.48874354362487793},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4861152172088623},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4626418650150299},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.45222052931785583},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4227887690067291},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4213769733905792},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3589822053909302},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3431190252304077},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.33607184886932373},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.3337218165397644},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3277670741081238},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3090434670448303},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.24692684412002563},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19261035323143005},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19137859344482422}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7299788594245911},{"id":"https://openalex.org/C2778034918","wikidata":"https://www.wikidata.org/wiki/Q3689301","display_name":"Topology control","level":5,"score":0.6435214281082153},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5700903534889221},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.556090235710144},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.48874354362487793},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4861152172088623},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4626418650150299},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.45222052931785583},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4227887690067291},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4213769733905792},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3589822053909302},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3431190252304077},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.33607184886932373},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.3337218165397644},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3277670741081238},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3090434670448303},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.24692684412002563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19261035323143005},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19137859344482422},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C41971633","wikidata":"https://www.wikidata.org/wiki/Q6398155","display_name":"Key distribution in wireless sensor networks","level":4,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s1793830909000348","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830909000348","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.157.3192","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.3192","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.gsu.edu/~cscysl/papers/dmaa09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.9200000166893005}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W207978117","https://openalex.org/W1530712874","https://openalex.org/W1551538842","https://openalex.org/W1576353514","https://openalex.org/W1984385455","https://openalex.org/W2011039300","https://openalex.org/W2022082910","https://openalex.org/W2024884029","https://openalex.org/W2028738060","https://openalex.org/W2042626642","https://openalex.org/W2045349136","https://openalex.org/W2056316084","https://openalex.org/W2059453880","https://openalex.org/W2063572899","https://openalex.org/W2066577300","https://openalex.org/W2100496711","https://openalex.org/W2100806474","https://openalex.org/W2105925045","https://openalex.org/W2117063816","https://openalex.org/W2126976589","https://openalex.org/W2135183968","https://openalex.org/W2139349113","https://openalex.org/W2156760067","https://openalex.org/W2166237986","https://openalex.org/W2166329551","https://openalex.org/W2435603672","https://openalex.org/W2542503137","https://openalex.org/W4253935083"],"related_works":["https://openalex.org/W2003604383","https://openalex.org/W2072451590","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W3188033804","https://openalex.org/W1594413663","https://openalex.org/W2100496711","https://openalex.org/W189401716","https://openalex.org/W2397211304","https://openalex.org/W2898570308"],"abstract_inverted_index":{"A":[0,26],"Connected":[1],"Dominating":[2],"Set":[3],"(CDS)":[4],"can":[5,29,111],"be":[6],"used":[7],"to":[8,19,57,185],"construct":[9],"a":[10,49,53,67,83,93,97,138,171],"virtual":[11,27],"backbone":[12,28,51],"for":[13,52,92,145],"wireless":[14],"and":[15,24,40,61,159,175,207,219],"mobile":[16],"ad-hoc":[17],"networks":[18],"make":[20],"the":[21,122,125,129,191,196,202,209],"system":[22],"hierarchical":[23],"efficient.":[25],"significantly":[30],"improve":[31],"network":[32,38,54],"throughput,":[33],"optimize":[34],"broadband":[35],"utilization,":[36],"extend":[37],"lifetime,":[39],"reduce":[41,58],"interference":[42],"as":[43,45,124,152],"well":[44],"packet":[46],"retransmissions.":[47],"Calculating":[48],"minimum":[50,94],"is":[55,66,190],"critical":[56],"routing":[59,135],"computation":[60],"energy":[62],"consumption.":[63],"This":[64],"problem":[65,85,151],"well-known":[68],"NP-hard":[69],"optimization":[70],"problem,":[71],"which":[72,90,132],"has":[73],"various":[74],"applications":[75],"in":[76,96,195],"practice.":[77],"In":[78],"this":[79,117,150],"paper,":[80],"we":[81,169],"propose":[82,170],"new":[84],"based":[86],"on":[87,136],"customer":[88],"fairness,":[89],"looks":[91],"CDS":[95,118,139],"given":[98,197],"communication":[99],"model":[100],"with":[101,113,119,181,221],"shortest":[102,153],"path":[103,127,154],"constraints.":[104],"It":[105],"guarantees":[106],"that":[107,134],"any":[108],"two":[109],"clients":[110],"communicate":[112],"each":[114],"other":[115],"through":[116],"hop":[120],"counts":[121],"same":[123],"best":[126],"from":[128,165],"original":[130],"graph,":[131],"means":[133],"such":[137],"will":[140],"not":[141],"bring":[142],"additional":[143],"traffic":[144],"every":[146],"client.":[147],"We":[148,199],"name":[149],"connected":[155],"dominating":[156],"set":[157],"(SPCDS)":[158],"prove":[160],"its":[161],"NP-hardness":[162],"by":[163,215],"reduction":[164],"Hitting":[166],"Set.":[167],"Then":[168],"centralized":[172],"greedy":[173],"algorithm":[174,180],"an":[176],"efficient":[177],"distributed":[178,213],"approximation":[179,182],"ratio":[183],"\u0394":[184,189],"solve":[186],"SPCDS,":[187],"where":[188],"maximum":[192],"vertex":[193],"degree":[194],"topology.":[198],"also":[200],"analyze":[201],"time":[203],"complexity,":[204,206],"message":[205],"evaluate":[208],"efficiency":[210],"of":[211],"our":[212],"heuristic":[214],"several":[216],"numerical":[217],"experiments":[218],"comparisons":[220],"previous":[222],"literatures.":[223]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":14}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}