%0 Journal Article
%T Distributed MCDS constructing algorithm in Ad hoc networks<br>自组织网络分布式最小连通支配集创建算法*
%A WANG Ling-yan
%A ZHANG Qi
%A LIU Ai-min
%A <br>王凌燕
%A 张奇
%A 刘爱民
%J 计算机应用研究
%D 2009
%I 
%X For the NP-hard problem of constructing minimum connected dominating set(MCDS) in Ad hoc networks,this paper proposed a novel distributed MCDS constructing algorithm called DMCA.DMCA constructed a MCDS for Ad hoc networks based on a maximal independent set(MIS).In DMCA,each node only required the knowledge of its one-hop neighbors and there existed only one shortest path connecting two dominators these were at most three hops away.The theoretical analysis shows that DMCA was fully localized,had a constant a...
%K distributed algorithm
%K minimum connected dominating set
%K Ad hoc networks<br>分布式算法
%K 最小连通支配集
%K 自组织网络
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=6016758B2E475CBA757627C197BEE027&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=B31275AF3241DB2D&sid=0919ABED4B23AD8B&eid=ACC52FE434DCDA93&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=8