{"id":"https://openalex.org/W1995336683","doi":"https://doi.org/10.1145/1582379.1582410","title":"Modeling and algorithm for topology construction with delay and traffic constraints","display_name":"Modeling and algorithm for topology construction with delay and traffic constraints","publication_year":2009,"publication_date":"2009-06-21","ids":{"openalex":"https://openalex.org/W1995336683","doi":"https://doi.org/10.1145/1582379.1582410","mag":"1995336683"},"language":"en","primary_location":{"id":"doi:10.1145/1582379.1582410","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1582379.1582410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly","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/A5100698504","display_name":"Yongjin Lee","orcid":"https://orcid.org/0000-0001-8166-2935"},"institutions":[{"id":"https://openalex.org/I141074810","display_name":"Korea National University of Education","ror":"https://ror.org/03c9fpk55","country_code":"KR","type":"education","lineage":["https://openalex.org/I141074810"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yong-Jin Lee","raw_affiliation_strings":["Korea National University of Education, Chungbuk, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korea National University of Education, Chungbuk, Korea","institution_ids":["https://openalex.org/I141074810"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5115589024","display_name":"Dong-Woo Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I85389745","display_name":"Woosong University","ror":"https://ror.org/02srty072","country_code":"KR","type":"education","lineage":["https://openalex.org/I85389745"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Dong-Woo Lee","raw_affiliation_strings":["Woosong University, Daejeon, Korea","Woosong University, Daejeon, Korea#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Woosong University, Daejeon, Korea","institution_ids":["https://openalex.org/I85389745"]},{"raw_affiliation_string":"Woosong University, Daejeon, Korea#TAB#","institution_ids":["https://openalex.org/I85389745"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07358691,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"138","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9990000128746033,"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9977999925613403,"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7613070011138916},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6882564425468445},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6626071333885193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.614588737487793},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.610158383846283},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6029301881790161},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5549309849739075},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5476275682449341},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.5215011239051819},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5180587768554688},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5116662979125977},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48755162954330444},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.4555739760398865},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4475819766521454},{"id":"https://openalex.org/keywords/broadcasting","display_name":"Broadcasting (networking)","score":0.43663471937179565},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3567991852760315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25600481033325195},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09822878241539001}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7613070011138916},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6882564425468445},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6626071333885193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.614588737487793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.610158383846283},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6029301881790161},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5549309849739075},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5476275682449341},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.5215011239051819},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5180587768554688},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5116662979125977},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48755162954330444},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.4555739760398865},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4475819766521454},{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.43663471937179565},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3567991852760315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25600481033325195},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09822878241539001},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":1,"locations":[{"id":"doi:10.1145/1582379.1582410","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1582379.1582410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5880472587","display_name":null,"funder_award_id":"MOEHRD (KRF-2008-313-D00897)","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1517846550","https://openalex.org/W1972674272","https://openalex.org/W1999437872","https://openalex.org/W2047194039","https://openalex.org/W2052862856","https://openalex.org/W2106627221","https://openalex.org/W2134251245","https://openalex.org/W2155589809","https://openalex.org/W2161996398","https://openalex.org/W4231022671","https://openalex.org/W6683025709"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2899787781","https://openalex.org/W2418231958","https://openalex.org/W2381121915","https://openalex.org/W2387385213","https://openalex.org/W2074214908","https://openalex.org/W4242086819","https://openalex.org/W2390742649","https://openalex.org/W2384589661","https://openalex.org/W2363076693"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4,49],"the":[5,26,32,42,50,61,75,82,93],"delay-bound":[6],"capacitated":[7],"minimum":[8,20],"spanning":[9,22],"tree":[10,38],"(DB-CMST)":[11],"problem,":[12],"which":[13],"consists":[14],"of":[15,19,36,95],"finding":[16],"a":[17,67],"set":[18],"cost":[21,52,97],"trees":[23,98],"to":[24,80,92],"satisfy":[25],"traffic":[27],"requirements":[28,35],"at":[29],"end-nodes":[30],"and":[31,48,105],"mean":[33],"delay":[34],"each":[37],"simultaneously.":[39],"We":[40],"formulate":[41],"DB-CMST":[43,83],"problem":[44],"using":[45],"analytical":[46],"model":[47],"least":[51,96],"heuristic":[53,87],"algorithm":[54,63,78,88],"for":[55,99,106],"solution.":[56],"Experimental":[57],"results":[58,73],"show":[59],"that":[60],"proposed":[62,86],"can":[64,89],"produce,":[65],"in":[66,101,109],"very":[68],"short":[69],"computation":[70],"time,":[71],"better":[72],"than":[74],"previous":[76],"CMST":[77],"modified":[79],"solve":[81],"problem.":[84],"The":[85],"be":[90],"applied":[91],"construction":[94],"broadcasting":[100],"local":[102],"computer":[103],"network":[104],"data":[107],"aggregation":[108],"wireless":[110],"sensor":[111],"network.":[112]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}