{"id":"https://openalex.org/W2014492395","doi":"https://doi.org/10.1109/wcnc.2010.5506390","title":"Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks","display_name":"Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks","publication_year":2010,"publication_date":"2010-04-01","ids":{"openalex":"https://openalex.org/W2014492395","doi":"https://doi.org/10.1109/wcnc.2010.5506390","mag":"2014492395"},"language":"en","primary_location":{"id":"doi:10.1109/wcnc.2010.5506390","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2010.5506390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Wireless Communication 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/A5020665050","display_name":"Hossein Kassaei","orcid":null},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Hossein Kassaei","raw_affiliation_strings":["Department of Computer Science, Concordia University, Montreal, QUE, Canada","Department of Computer Science, Concordia University, Montr\u00e9al, QC, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Concordia University, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Department of Computer Science, Concordia University, Montr\u00e9al, QC, Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003376422","display_name":"Mona Mehrandish","orcid":null},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mona Mehrandish","raw_affiliation_strings":["Department of Computer Science, Concordia University, Montreal, QUE, Canada","Department of Computer Science, Concordia University, Montr\u00e9al, QC, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Concordia University, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Department of Computer Science, Concordia University, Montr\u00e9al, QC, Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067542317","display_name":"Lata Narayanan","orcid":"https://orcid.org/0000-0002-3875-0371"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Lata Narayanan","raw_affiliation_strings":["Department of Computer Science, Concordia University, Montreal, QUE, Canada","Department of Computer Science, Concordia University, Montr\u00e9al, QC, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Concordia University, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Department of Computer Science, Concordia University, Montr\u00e9al, QC, Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113680960","display_name":"Jaroslav Opatrny","orcid":null},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jaroslav Opatrny","raw_affiliation_strings":["Department of Computer Science, Concordia University, Montreal, QUE, Canada","Department of Computer Science, Concordia University, Montr\u00e9al, QC, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Concordia University, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Department of Computer Science, Concordia University, Montr\u00e9al, QC, Canada","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5020665050"],"corresponding_institution_ids":["https://openalex.org/I60158472"],"apc_list":null,"apc_paid":null,"fwci":1.7806,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.85107204,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"lncs 1499","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9983000159263611,"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.9959999918937683,"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/computer-science","display_name":"Computer science","score":0.7985475063323975},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.6792782545089722},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6205304265022278},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.5757941603660583},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4987053871154785},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4949738383293152},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.44495147466659546},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.4327138364315033},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43229928612709045},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.428288996219635},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3849828243255615},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.14144346117973328},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13801789283752441}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7985475063323975},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.6792782545089722},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6205304265022278},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.5757941603660583},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4987053871154785},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4949738383293152},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.44495147466659546},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.4327138364315033},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43229928612709045},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.428288996219635},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3849828243255615},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.14144346117973328},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13801789283752441},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wcnc.2010.5506390","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2010.5506390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Wireless Communication and Networking Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W25150355","https://openalex.org/W1499595654","https://openalex.org/W1787734157","https://openalex.org/W1823570578","https://openalex.org/W1978887885","https://openalex.org/W1984529698","https://openalex.org/W2042626642","https://openalex.org/W2045349136","https://openalex.org/W2054910423","https://openalex.org/W2063572899","https://openalex.org/W2093056188","https://openalex.org/W2120170057","https://openalex.org/W2124297703","https://openalex.org/W2145797586","https://openalex.org/W2155984879","https://openalex.org/W6638491407"],"related_works":["https://openalex.org/W2381592006","https://openalex.org/W2361040037","https://openalex.org/W2067462320","https://openalex.org/W2163353097","https://openalex.org/W2316343185","https://openalex.org/W2051679112","https://openalex.org/W2100496711","https://openalex.org/W2513384424","https://openalex.org/W2091564411","https://openalex.org/W2117063816"],"abstract_inverted_index":{"A":[0],"Connected":[1],"Dominating":[2],"Set":[3],"(CDS)":[4],"can":[5,27],"be":[6,45],"used":[7,46],"as":[8],"a":[9,17,35,66,85,137],"routing":[10,49],"backbone":[11,26,53],"in":[12,21,40,61,87,100,126,143],"ad":[13],"hoc":[14],"networks":[15],"and":[16,43,92,105,161],"data":[18],"gathering/dissemination":[19],"infrastructure":[20],"sensor":[22],"networks.":[23],"This":[24],"virtual":[25],"efficiently":[28],"narrow":[29],"down":[30],"the":[31,38,41,52,56,62,101,108,122,129,132,149,154,157,162,165],"search":[32],"space":[33],"for":[34],"route":[36],"to":[37,83,151],"nodes":[39,60,104],"CDS":[42,68,86],"thus":[44],"by":[47],"any":[48],"protocol.":[50],"Ideally,":[51],"should":[54],"constitute":[55],"smallest":[57],"percentage":[58],"of":[59,95,103,107,128,131,140,159,164],"network.":[63,109],"However,":[64],"finding":[65],"Minimum":[67],"(MCDS)":[69],"is":[70,98],"an":[71,79],"NP-hard":[72],"problem.":[73],"In":[74],"this":[75,119],"paper,":[76],"we":[77],"propose":[78],"efficient":[80],"distributed":[81,123],"algorithm":[82,97,120,142,147],"construct":[84],"general":[88],"graphs.":[89],"The":[90],"time":[91],"message":[93],"complexity":[94],"our":[96,141],"linear":[99],"number":[102],"degree":[106,158],"Extensive":[110],"simulations":[111],"on":[112],"Unit":[113],"Disk":[114],"Graphs":[115],"(UDGs)":[116],"show":[117],"that":[118],"outperforms":[121],"algorithms":[124],"proposed":[125],"terms":[127],"size":[130,163],"CDS.":[133,167],"We":[134],"also":[135],"present":[136],"local":[138],"implementation":[139],"location-aware":[144],"UDGs.":[145],"Our":[146],"provides":[148],"flexibility":[150],"arbitrarily":[152],"adjust":[153],"tradeoff":[155],"between":[156],"locality":[160],"generated":[166]},"counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}