图书馆 | 所内网 | 所长信箱 | English | 中国科学院
站内搜索  
 
首 页 新闻 机构概况 机构设置 科研成果 研究队伍 研究生教育 国际交流 院地合作 学术期刊 创新文化 党群园地 科学传播
 
科研成果
概况介绍
论文
专著
专利
成果转化
研究所图库
园区一角南区办公楼实验楼(R楼)园区一角科研楼(A楼)自动化所鸟瞰自动化所正门
相关链接
ARP Email 所报
 您现在的位置:首页 > 科研成果 >论文
论文题目: Delay constrained relay node placement in two-tiered wireless sensor networks: A set-covering-based algorithm
第一作者: Ma CF(马超凡);Liang W(梁炜);Zheng M(郑萌)
参与作者:
联系作者:
发表刊物: Journal of Network and Computer Applications
发表年度: 2017
卷,期,页: 93,,76-90
论文出处:
第一作者所在部门:
论文编号:
论文摘要: As Wireless Sensor Networks (WSNs) are widely used in time-critical applications, e.g., factory automation and smart grid, the importance of Delay Constrained Relay Node Placement (DCRNP) problem is becoming increasingly noticeable. Considering the benefits in terms of energy efficiency and scalability brought by the two-tiered topology, this paper studies the DCRNP problem in two-tiered WSNs. To address the NP-hardness, a Two-phase Set-Covering-based Algorithm (TSCA) is proposed to approximately solve this problem. To be specific, in the first phase, a Connectivity-aware Covering Algorithm (CCA) places Relay Nodes (RNs) to fully cover distributed sensor nodes with respect to delay constraints, and meanwhile CCA tries to reduce the number of connected components in the topology constructed in this phase so as to save the RNs deployed to build network connectivity. In the second phase, the network connectivity is built in obedience to delay constraints by a Set-Covering-based Algorithm (SCA) through an iterative manner, which formulates the deployment of RNs at each iteration as the set covering problem and solves this problem using a classic set covering algorithm. In addition, the elaborated analysis of time complexity and approximation ratio of the proposed algorithms is given out. Finally, extensive simulations demonstrate that TSCA can significantly save deployed RNs in comparison to existing algorithms.
论文全文:
其他备注:
附件下载:
 
中国科学院沈阳自动化研究所 版权所有 1996-2009 辽ICP备05000867 联系我们
地址:中国辽宁省沈阳市东陵区南塔街114号 邮编:110016 留言反馈 网站地图