期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Approximation Designs for Energy Harvesting Relay Deployment in Wireless Sensor Networks
1
作者 王怿 刘忆雪 +2 位作者 朱舜佳 高晓沨 田臣 《Journal of Computer Science & Technology》 SCIE EI CSCD 2022年第4期779-796,共18页
Energy harvesting technologies allow wireless devices to be recharged by the surrounding environment, providing wireless sensor networks (WSNs) with higher performance and longer lifetime. However, directly building a... Energy harvesting technologies allow wireless devices to be recharged by the surrounding environment, providing wireless sensor networks (WSNs) with higher performance and longer lifetime. However, directly building a wireless sensor network with energy harvesting nodes is very costly. A compromise is upgrading existing networks with energy harvesting technologies. In this paper, we focus on prolonging the lifetime of WSNs with the help of energy harvesting relays (EHRs). EHRs are responsible for forwarding data for sensor nodes, allowing them to become terminals and thus extending their lifetime. We aim to deploy a minimum number of relays covering the whole network. As EHRs have several special properties such as the energy harvesting and depletion rate, it brings great research challenges to seek an optimal deployment strategy. To this end, we propose an approximation algorithm named Effective Relay Deployment Algorithm, which can be divided into two phases: disk covering and connector insertion using the partitioning technique and the Steinerization technique, respectively. Based on probabilistic analysis, we further optimize the performance ratio of our algorithm to (5 + 6/K) where K is an integer denoting the side length of a cell after partitioning. Our extensive simulation results show that our algorithm can reduce the number of EHRs to be deployed by up to 45% compared with previous work and thus validate the efficiency and effectiveness of our solution. 展开更多
关键词 approximation algorithm constraint relay deployment energy harvesting wireless sensor network
原文传递
Joint relay station deployment and frequency reuse scheme for two-hop cellular networks
2
作者 CHEN Hao-kai YIN Hui +2 位作者 LIANG Jian LI Zhong-nian LIU Shou-yin 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2012年第2期74-80,共7页
To fully exploit the performance benefits of relay station (RS), in the two-hop cellular networks covering hotspots, when the number of RSs is predetermined, both RS deployment and frequency reuse scheme are jointly... To fully exploit the performance benefits of relay station (RS), in the two-hop cellular networks covering hotspots, when the number of RSs is predetermined, both RS deployment and frequency reuse scheme are jointly optimized for the purpose of maximizing the system capacity based on the constraints of system demand of capacity and the maximum number of outage demand nodes (MNDN). Further, considering the overhead of increasing RSs, it is desired to use minimum number of RSs. The joint RS deployment and frequency reuse scheme (JRDFR) problem is formulated into a mixed integer nonlinear programming, which is non-deterministic polynomial-time hard in general. A heuristic approach based on genetic algorithm is proposed to tackle the JRDFR problem. The computational experiment of the heuristic approach is achieved and optimized RS deployment and frequency reuse scheme is obtained. Finally, we discuss the impacts of MNDN and the number of RSs on the system performance. 展开更多
关键词 relay station deployment frequency reuse scheme two-hop cellular networks
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部