太原理工大学计算机科学与技术学院
纸质出版:2015
移动端阅览
[1]赵煜,降爱莲.一种参考能量的最小连通支配集近似算法[J].传感器与微系统,2015,34(01):145-147.
ZHAO Yu, JIANG Ai-lian. A reference energy approximation algorithm for minimum connected dominating set[J]. 2015, 34(1): 145-147.
[1]赵煜,降爱莲.一种参考能量的最小连通支配集近似算法[J].传感器与微系统,2015,34(01):145-147. DOI: 10.13873/J.1000-9787(2015)01-0145-03.
ZHAO Yu, JIANG Ai-lian. A reference energy approximation algorithm for minimum connected dominating set[J]. 2015, 34(1): 145-147. DOI: 10.13873/J.1000-9787(2015)01-0145-03.
在无线传感器网络中
能量效率问题至关重要
构造精简的虚拟骨干网可以节约有限资源
这等同于在图论中求解最小连通支配集(MCDS)问题。由此
提出一种构造MCDS的启发式算法。首先根据均值公式为顶点建立次序表
其次构造极大独立集(MIS)
再次连接MIS节点
最后优化。仿真实验表明:该算法能够在短时间内找到规模较小的连通支配集(CDS)
并且有效地均衡了各节点能量
延长了网络生命周期。
To make efficient use of limited energy resources is significant in WSNs
a major way to save limited energy resources is constructing a smaller virtual backbone
which is equivalent to find the minimum connected dominating set( MCDS) in graph theory. Thus
a heuristic algorithm to construct the MCDS is proposed. Firstly
according to average formula
establish ordered list for vertex
then construct the maximum independent set( MIS)
and then connect nodes of MIS
finally
optimize CDS. Simulation experiments show that the algorithm can find smaller connected dominating set in short time
and effectively balances energy of each node to extend lifetime of network.
无线传感器网络中使用连通支配集的最小能耗广播算法 [J]. 黄行波,程红举. 小型微型计算机系统 . 2014(01)
WSNs中基于能量代价的最小权和支配集拓扑控制算法 [J]. 孙超,尹荣荣,郝晓辰,刘彬. 电子与信息学报 . 2010(04)
无线传感器网络中一种启发式最小连通支配集算法 [J]. 卞永钊,于海斌,曾鹏. 信息与控制 . 2009(03)
一种求解最小连通支配集的高效近似算法 [J]. 廖飞雄,马良,范炳全. 小型微型计算机系统 . 2008(05)
The Broadcast Storm Problem in a Mobile Ad Hoc Network [J] . Yu-Chee Tseng,Sze-Yao Ni,Yuh-Shyan Chen,Jang-Ping Sheu. Wireless Networks . 2002 (2-3)
A Routing Algorithm for Wireless Ad Hoc Networks with Unidirectional Links [J] . Ravi Prakash. Wireless Networks . 2001 (6)
0
浏览量
73
下载量
3
CSCD
关联资源
相关文章
相关作者
相关机构