|
无线传感器网络中一种启发式最小连通支配集算法
A Heuristic Minimum Connected Dominating Set Algorithm for Wireless Sensor Network
查看参考文献11篇
文摘
|
针对最小连通支配集问题设计了一种具有较高能量效率的启发式算法.算法首先把网络中所有的节点作为最小连通支配集的一个初始解,然后利用启发式修剪策略剔除冗余节点从而减小最小连通支配集的大小,直到没有冗余节点存在.文中将算法分成集中式和分布式两种情况进行了详细讨论.仿真结果表明,由于实现简便,该算法与其他已有算法相比较,在算法复杂性和算法稳定运行时间上有一定的优势. |
其他语种文摘
|
A new energy efficient heuristic algorithm is proposed for the minimum connected dominating set problem. The algorithm starts with an original solution containing all nodes of the network, and then reduces the size of the connected dominating set (CDS) by removing some redundant nodes using a heuristic policy until there are no redundant nodes. Both the centralized and distributed versions of this algorithm are discussed. The simulation results show that the presented algorithms are superior to other existing approaches in complexity and steady running time. |
来源
|
信息与控制
,2009,38(3):355-359,364 【核心库】
|
关键词
|
无线传感器网络
;
虚拟骨干
;
连通支配集
;
启发式算法
|
地址
|
中国科学院沈阳自动化研究所, 辽宁, 沈阳, 110606
|
语种
|
中文 |
文献类型
|
研究性论文 |
ISSN
|
1002-0411 |
学科
|
自动化技术、计算机技术 |
基金
|
国家自然科学基金
;
辽宁省"工业通信与控制系统"重点实验室资助项目
|
文献收藏号
|
CSCD:3524919
|
参考文献 共
11
共1页
|
1.
卞永钊. 无线传感器网络中的拓扑控制.
计算机应用研究,2008,25(10):3128-3133
|
被引
3
次
|
|
|
|
2.
Das B. Routing in ad-hoc networks using minimum connected dominating sets.
Proceedings of the IEEE International Conference on Communications,1997:376-380
|
被引
3
次
|
|
|
|
3.
Guha S. Approximation algorithms for connected dominating sets.
Proceedings of the Fourth Annual European Symposium on Algorithms,1996:179-193
|
被引
3
次
|
|
|
|
4.
Wu J. On calculating connected dominating set for efficient routing in ad hoc wireless networks.
Proceedings of the Third International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications,1999:7-14
|
被引
1
次
|
|
|
|
5.
Li Y S. On greedy construction of connected dominating sets in wireless networks.
Wireless Communications and Mobile Computing,2005,5(8):927-932
|
被引
4
次
|
|
|
|
6.
Stojmenovic I. Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks.
IEEE Transactions on Distributed Systems,2002,13(1):14-25
|
被引
27
次
|
|
|
|
7.
Dai F. An extended localized algorithm for connected dominating set formation in ad hoc wireless networks.
IEEE Transactions on Parallel and Distributed Systems,2004,15(10):908-920
|
被引
31
次
|
|
|
|
8.
Butenko S.
Recent Developments in Cooperative Control and Optimization,2004
|
被引
1
次
|
|
|
|
9.
Alzoubi K M. Distributed heuristics for connected dominating sets in wireless ad hoc networks.
Journal on Communications and Networks,2002,4(1):22-29
|
被引
14
次
|
|
|
|
10.
Butenko S.
Cooperative Control:Models,Applications and Algorithms,2003
|
被引
1
次
|
|
|
|
11.
Wan P J. Distributed construction of connected dominating set in wireless ad hoc networks.
Mobile Networks and Applications,2004,9(2):141-149
|
被引
20
次
|
|
|
|
|
|