考虑时延约束的无线传感器网络中继节点部署算法

CORC > 沈阳自动化研究所 > 中国科学院沈阳自动化研究所 > 工业控制网络与系统研究室

	考虑时延约束的无线传感器网络中继节点部署算法
	马超凡; 郑萌; 梁炜
刊名	中国科学:信息科学
	2015
卷号	45 期号:6 页码:766-782
关键词	无线传感器网络时延约束中继节点部署最短路径树 NP-hard问题
ISSN号	1674-7267
其他题名	Delay constrained relay node placement in wireless sensor networks
产权排序	1
中文摘要	无线传感器网络中考虑时延约束的中继节点部署(delay constrained relay node placement,DCRNP)问题通过部署最少数量的中继节点使得所有传感器节点与汇聚节点之间都有满足时延约束条件的通路.DCRNP问题已经被证明是NP-hard问题.本文提出基于汇合点及剪枝技术的中继节点部署(convergence-pruning-based relay node placement,CPRNP)算法近似求解DCRNP问题.CPRNP算法分为两个阶段,第1阶段找出所有可能使满足时延约束的通路相交的汇合点,并生成一棵以汇聚节点为根节点连接所有传感器节点的最短路径树;在第2阶段...
英文摘要	The delay constrained relay node placement (DCRNP) problem minimizes the quantity of deployed relay nodes that are employed to build at least one path between a sink and each sensor node and guarantees that the delay constraints for the built paths are fulfilled. It has been proven that the DCRNP problem is NP-hard. This paper proposes a convergence-pruning-based relay node placement (CPRNP) algorithm to approximately solve the DCRNP problem. The CPRNP algorithm consists of two stages. In the first stage, CPRNP identifies the convergences of all the paths meeting the delay constraint and forms a shortest-path tree that is rooted at the sink and connects all the sensors. In the second stage, the CPRNP gradually reduces the number of deployed relay nodes by deleting or substituting the nodes on the shortest-path tree. The simulation results confirm that CPRNP can significantly save deployed relay nodes compared to existing algorithms.
收录类别	CSCD
语种	中文
CSCD记录号	CSCD:5448641
公开日期	2015-08-31
内容类型	期刊论文
源URL	[http://ir.sia.ac.cn/handle/173321/16864]
专题	沈阳自动化研究所_工业控制网络与系统研究室
推荐引用方式 GB/T 7714	马超凡,郑萌,梁炜. 考虑时延约束的无线传感器网络中继节点部署算法[J]. 中国科学:信息科学,2015,45(6):766-782.
APA	马超凡,郑萌,&梁炜.(2015).考虑时延约束的无线传感器网络中继节点部署算法.中国科学:信息科学,45(6),766-782.
MLA	马超凡,et al."考虑时延约束的无线传感器网络中继节点部署算法".中国科学:信息科学 45.6(2015):766-782.