Ring Clustering Algorithm for wireless ad hoc networks

Hassan, D.S.M.,Fahmy, H.M.A.,Bahaa, A.M.

Valletta（2010）

引用 2|浏览3

暂无评分

摘要

This paper presents a new connected dominating set clustering algorithm called the Ring-Clustering Algorithm (RCA) for the formation of virtual backbones in wireless ad hoc networks. Since determining the minimum connected dominated set is an NP-hard problem, RCA heuristically finds the Connected Dominated Set (CDS). The algorithm uses one-hop neighboring data to determine ring-nodes, which are responsible for establishing the CDS. The simulation study shows that RCA is more effective in reducing the size of CDS against recently proposed algorithms.

查看译文

关键词

ad hoc networks,computational complexity,np-hard problem,connected dominated set,ring clustering algorithm,ring-nodes,set clustering algorithm,virtual backbones,wireless ad hoc networks,spine,computer networks,broadcasting,intrusion detection,mobile ad hoc networks,np hard problem,algorithm design and analysis,energy states,approximation algorithms,wireless ad hoc network,clustering algorithms

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要