{"id":"https://openalex.org/W2131332586","doi":"https://doi.org/10.1109/wcnc.2011.5779233","title":"An improved greedy construction of minimum connected dominating sets in wireless networks","display_name":"An improved greedy construction of minimum connected dominating sets in wireless networks","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2131332586","doi":"https://doi.org/10.1109/wcnc.2011.5779233","mag":"2131332586"},"language":"en","primary_location":{"id":"doi:10.1109/wcnc.2011.5779233","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2011.5779233","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Wireless Communications and Networking Conference","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/A5103245820","display_name":"Ariyam Das","orcid":"https://orcid.org/0000-0003-0950-606X"},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Ariyam Das","raw_affiliation_strings":["Department of CSE, Jadavpur University, India","Department of CSE, Jadavpur University, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of CSE, Jadavpur University, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"Department of CSE, Jadavpur University, India#TAB#","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070830764","display_name":"Manish Aasawat","orcid":null},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]},{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Manish Aasawat","raw_affiliation_strings":["Department of CSE and School of IT, Indian Institute of Technology, Kharagpur, India","Department of CSE, Jadavpur University, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of CSE and School of IT, Indian Institute of Technology, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Department of CSE, Jadavpur University, India#TAB#","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027424392","display_name":"Chittaranjan Mandal","orcid":"https://orcid.org/0000-0002-5228-7002"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]},{"id":"https://openalex.org/I205051169","display_name":"Kingston University","ror":"https://ror.org/05bbqza97","country_code":"GB","type":"education","lineage":["https://openalex.org/I205051169"]}],"countries":["GB","IN"],"is_corresponding":false,"raw_author_name":"Chittaranjan Mandal","raw_affiliation_strings":["Department of Informatics and Operations Management, Kingston University, UK","Department of CSE and School of IT IIT Kharagpur, India"],"affiliations":[{"raw_affiliation_string":"Department of Informatics and Operations Management, Kingston University, UK","institution_ids":["https://openalex.org/I205051169"]},{"raw_affiliation_string":"Department of CSE and School of IT IIT Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058274734","display_name":"Chris Reade","orcid":null},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]},{"id":"https://openalex.org/I205051169","display_name":"Kingston University","ror":"https://ror.org/05bbqza97","country_code":"GB","type":"education","lineage":["https://openalex.org/I205051169"]}],"countries":["GB","IN"],"is_corresponding":false,"raw_author_name":"Chris Reade","raw_affiliation_strings":["Department of CSE, Jadavpur University, India","[Department of Informatics and Operations Management, Kingston University, UK]"],"affiliations":[{"raw_affiliation_string":"Department of CSE, Jadavpur University, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"[Department of Informatics and Operations Management, Kingston University, UK]","institution_ids":["https://openalex.org/I205051169"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103245820"],"corresponding_institution_ids":["https://openalex.org/I170979836"],"apc_list":null,"apc_paid":null,"fwci":2.1925,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.8865569,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"790","last_page":"795"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9997000098228455,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9997000098228455,"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.9994999766349792,"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.9944000244140625,"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/connected-dominating-set","display_name":"Connected dominating set","score":0.8682816028594971},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7849985361099243},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7261137366294861},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6919099688529968},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6170133352279663},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6071958541870117},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5098718404769897},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.5082128047943115},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48398518562316895},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4684683680534363},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.45910289883613586},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4254203736782074},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4100944399833679},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.40592771768569946},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38007786870002747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2830897271633148},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28263354301452637},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2532568871974945},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2392365038394928},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1692028045654297}],"concepts":[{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.8682816028594971},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7849985361099243},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7261137366294861},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6919099688529968},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6170133352279663},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6071958541870117},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5098718404769897},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.5082128047943115},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48398518562316895},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4684683680534363},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.45910289883613586},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4254203736782074},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4100944399833679},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.40592771768569946},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38007786870002747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2830897271633148},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28263354301452637},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2532568871974945},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2392365038394928},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1692028045654297},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/wcnc.2011.5779233","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2011.5779233","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Wireless Communications and Networking Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.kingston.ac.uk:19209","is_oa":false,"landing_page_url":"https://eprints.kingston.ac.uk/id/eprint/19209/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400991","display_name":"Research Repository (Kingston University London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801636071","host_organization_name":"Kingston Hospital NHS Trust","host_organization_lineage":["https://openalex.org/I2801636071"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4300000071525574,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1519751949","https://openalex.org/W1543191305","https://openalex.org/W1557449356","https://openalex.org/W1559599281","https://openalex.org/W2042626642","https://openalex.org/W2045349136","https://openalex.org/W2063572899","https://openalex.org/W2093381928","https://openalex.org/W2098502330","https://openalex.org/W2120170057","https://openalex.org/W2120185982","https://openalex.org/W2137996019","https://openalex.org/W2139023178","https://openalex.org/W2145797586","https://openalex.org/W2165275875","https://openalex.org/W2166237986","https://openalex.org/W2169848785","https://openalex.org/W3141863997","https://openalex.org/W6632436586","https://openalex.org/W6661245368"],"related_works":["https://openalex.org/W2662701","https://openalex.org/W2357985373","https://openalex.org/W2054473698","https://openalex.org/W2024884029","https://openalex.org/W2370165438","https://openalex.org/W2789984241","https://openalex.org/W1868459378","https://openalex.org/W2937242299","https://openalex.org/W3127652808","https://openalex.org/W2007607373"],"abstract_inverted_index":{"A":[0],"minimum":[1],"connected":[2],"dominating":[3],"set":[4,58],"(MCDS)":[5],"offers":[6],"an":[7,60,120],"optimized":[8],"way":[9],"of":[10,55,78,102,113,119,123,132],"sending":[11],"messages":[12],"in":[13,76],"wireless":[14],"networks.":[15],"However,":[16],"constructing":[17],"a":[18,21,41,56],"MCDS":[19,30],"is":[20,136],"NP-complete":[22],"problem.":[23],"Many":[24],"heuristics":[25],"based":[26,51],"approximation":[27,48],"algorithms":[28,75],"for":[29,94],"problems":[31],"have":[32],"been":[33],"previously":[34],"reported.":[35],"In":[36],"this":[37],"paper,":[38],"we":[39],"propose":[40],"new":[42],"degree-based":[43],"multiple":[44],"leaders":[45],"initiated":[46],"greedy":[47],"algorithm":[49],"(PSCASTS)":[50],"on":[52],"the":[53,108,117,124,128,137],"selection":[54],"pseudo-dominating":[57],"and":[59,81,99],"improved":[61],"Steiner":[62],"tree":[63],"construction.":[64],"We":[65],"also":[66],"show":[67,87],"that":[68,88],"our":[69],"PSCASTS":[70,89,106],"outperforms":[71],"existing":[72],"CDS":[73,79,122],"construction":[74,82],"terms":[77],"size":[80,118],"costs.":[83],"The":[84],"simulation":[85],"results":[86],"constructs":[90],"better":[91],"non-trivial":[92],"CDSs":[93],"networks":[95],"with":[96],"uniform,":[97],"nearly-uniform":[98],"random":[100],"distribution":[101],"sensor":[103],"nodes.":[104],"While":[105],"retains":[107],"current":[109],"best":[110,129],"performance":[111],"ratio":[112],"(4.8+ln5)|opt|+1.2,":[114],"|opt|":[115],"being":[116],"optimal":[121],"network,":[125],"it":[126],"has":[127],"time":[130],"complexity":[131],"O(D),":[133],"where":[134],"D":[135],"network":[138],"diameter.":[139]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}