当前热门的三维立体空间WSN覆盖方法应用在水下空间并不具有普适性。针对应用在水下的立体WSN覆盖方法通常存在覆盖率不高、节点移动能耗过大以及由此引起的节点能耗值差异较大等问题,结合现有的水下覆盖策略,提出一种新的基于降低节点...当前热门的三维立体空间WSN覆盖方法应用在水下空间并不具有普适性。针对应用在水下的立体WSN覆盖方法通常存在覆盖率不高、节点移动能耗过大以及由此引起的节点能耗值差异较大等问题,结合现有的水下覆盖策略,提出一种新的基于降低节点能耗、提高水下空间覆盖率的水下空间层次化覆盖增强算法(underwater hierarchical space coverage-enhancing algorithm,UHSCA)。理论分析及仿真结果表明该策略对水下节点的精确性部署进行了性能优化,在改善节点部署过程中能量消耗均衡性的基础上降低了节点的整体耗能,水下空间覆盖率也有相应提高,对应用在水下侦察、水文监测等水下立体空间的WSN具有较强的实用性。展开更多
For wireless sensor networks, a simple and accurate coordinate-free k-coverage hole detection scheme is proposed. First, an algorithm is presented to detect boundary cycles of 1-coverage holes. The algorithm consists ...For wireless sensor networks, a simple and accurate coordinate-free k-coverage hole detection scheme is proposed. First, an algorithm is presented to detect boundary cycles of 1-coverage holes. The algorithm consists of two components, named boundary edge detection and boundary cycle detection. Then, the 1-coverage hole detection algorithm is extended to k-coverage hole scenarios. A coverage degree reduction scheme is proposed to find an independent covering set of nodes in the covered region of the target field and to reduce the coverage degree by one through sleeping those nodes. Repeat the 1-coverage hole detection algorithm and the higher order of coverage holes can be found. By iterating the above steps for k-1 times, the boundary edges and boundary cycles of all k-coverage holes can be discovered. Finally, the proposed algorithm is compared with a location-based coverage hole detection algorithm. Simulation results indicate that the proposed algorithm can accurately detect over 99% coverage holes.展开更多
Ambient Assisted Living(AAL) is becoming an important research field. Many technologies have emerged related with pervasive computing vision, which can give support for AAL. One of the most reliable approaches is base...Ambient Assisted Living(AAL) is becoming an important research field. Many technologies have emerged related with pervasive computing vision, which can give support for AAL. One of the most reliable approaches is based on wireless sensor networks(WSNs). In this paper, we propose a coverage-aware unequal clustering protocol with load separation(CUCPLS) for data gathering of AAL applications based on WSNs. Firstly, the coverage overlap factor for nodes is introduced that accounts for the degree of target nodes covered. In addition, to balance the intra-cluster and inter-cluster energy consumptions, different competition radiuses of CHs are computed theoretically in different rings, and smaller clusters are formed near the sink. Moreover, two CHs are selected in each cluster for load separation to alleviate the substantial energy consumption difference between a single CH and its member nodes. Furthermore, a backoff waiting time is adopted during the selection of the two CHs to reduce the number of control messages employed. Simulation results demonstrate that the CUCPLS not only can achieve better coverage performance, but also balance the energy consumption of a network and prolong network lifetime.展开更多
Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied af...Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied after random deployment.In this paper,we study how mobile sensors can be efficiently relocated to achieve k-barrier coverage.In particular,two problems are studied:relocation of sensors with minimum number of mobile sensors and formation of k-barrier coverage with minimum energy cost.These two problems were formulated as 0–1 integer linear programming(ILP).The formulation is computationally intractable because of integrality and complicated constraints.Therefore,we relax the integrality and complicated constraints of the formulation and construct a special model known as RELAX-RSMN with a totally unimodular constraint coefficient matrix to solve the relaxed 0–1 ILP rapidly through linear programming.Theoretical analysis and simulation were performed to verify the effectiveness of our approach.展开更多
Recently, the barrier coverage was proposed and received much attention in wireless sensor network (WSN), and the degree of the barrier coverage, one of the critical parameters of WSN, must be re-studied due to the di...Recently, the barrier coverage was proposed and received much attention in wireless sensor network (WSN), and the degree of the barrier coverage, one of the critical parameters of WSN, must be re-studied due to the difference between the barrier coverage and blanket coverage. In this paper, we propose two algorithms, namely, local tree based no-way and back (LTNWB) algorithm and sensor minimum cut sets (SMCS) algorithm, for the opened and closed belt regions to determine the degree of the barrier coverage of WSN. Our main objective is to minimize the complexity of these algorithms. For the opened belt region, both algorithms work well, and for the closed belt region, they will still come into existence while some restricted conditions are taken into consideration. Finally, the simulation results demonstrate the feasibility of the proposed algorithms.展开更多
文摘当前热门的三维立体空间WSN覆盖方法应用在水下空间并不具有普适性。针对应用在水下的立体WSN覆盖方法通常存在覆盖率不高、节点移动能耗过大以及由此引起的节点能耗值差异较大等问题,结合现有的水下覆盖策略,提出一种新的基于降低节点能耗、提高水下空间覆盖率的水下空间层次化覆盖增强算法(underwater hierarchical space coverage-enhancing algorithm,UHSCA)。理论分析及仿真结果表明该策略对水下节点的精确性部署进行了性能优化,在改善节点部署过程中能量消耗均衡性的基础上降低了节点的整体耗能,水下空间覆盖率也有相应提高,对应用在水下侦察、水文监测等水下立体空间的WSN具有较强的实用性。
基金The National Natural Science Foundation of China(No.61601122,61471164,61741102)
文摘For wireless sensor networks, a simple and accurate coordinate-free k-coverage hole detection scheme is proposed. First, an algorithm is presented to detect boundary cycles of 1-coverage holes. The algorithm consists of two components, named boundary edge detection and boundary cycle detection. Then, the 1-coverage hole detection algorithm is extended to k-coverage hole scenarios. A coverage degree reduction scheme is proposed to find an independent covering set of nodes in the covered region of the target field and to reduce the coverage degree by one through sleeping those nodes. Repeat the 1-coverage hole detection algorithm and the higher order of coverage holes can be found. By iterating the above steps for k-1 times, the boundary edges and boundary cycles of all k-coverage holes can be discovered. Finally, the proposed algorithm is compared with a location-based coverage hole detection algorithm. Simulation results indicate that the proposed algorithm can accurately detect over 99% coverage holes.
基金supported by the National Nature Science Foundation of China (61170169, 61170168)
文摘Ambient Assisted Living(AAL) is becoming an important research field. Many technologies have emerged related with pervasive computing vision, which can give support for AAL. One of the most reliable approaches is based on wireless sensor networks(WSNs). In this paper, we propose a coverage-aware unequal clustering protocol with load separation(CUCPLS) for data gathering of AAL applications based on WSNs. Firstly, the coverage overlap factor for nodes is introduced that accounts for the degree of target nodes covered. In addition, to balance the intra-cluster and inter-cluster energy consumptions, different competition radiuses of CHs are computed theoretically in different rings, and smaller clusters are formed near the sink. Moreover, two CHs are selected in each cluster for load separation to alleviate the substantial energy consumption difference between a single CH and its member nodes. Furthermore, a backoff waiting time is adopted during the selection of the two CHs to reduce the number of control messages employed. Simulation results demonstrate that the CUCPLS not only can achieve better coverage performance, but also balance the energy consumption of a network and prolong network lifetime.
基金supported by the NSFC(U1536206,61232016,U1405254,61373133,61502242,71401176)BK20150925the PAPD fund
文摘Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied after random deployment.In this paper,we study how mobile sensors can be efficiently relocated to achieve k-barrier coverage.In particular,two problems are studied:relocation of sensors with minimum number of mobile sensors and formation of k-barrier coverage with minimum energy cost.These two problems were formulated as 0–1 integer linear programming(ILP).The formulation is computationally intractable because of integrality and complicated constraints.Therefore,we relax the integrality and complicated constraints of the formulation and construct a special model known as RELAX-RSMN with a totally unimodular constraint coefficient matrix to solve the relaxed 0–1 ILP rapidly through linear programming.Theoretical analysis and simulation were performed to verify the effectiveness of our approach.
文摘Recently, the barrier coverage was proposed and received much attention in wireless sensor network (WSN), and the degree of the barrier coverage, one of the critical parameters of WSN, must be re-studied due to the difference between the barrier coverage and blanket coverage. In this paper, we propose two algorithms, namely, local tree based no-way and back (LTNWB) algorithm and sensor minimum cut sets (SMCS) algorithm, for the opened and closed belt regions to determine the degree of the barrier coverage of WSN. Our main objective is to minimize the complexity of these algorithms. For the opened belt region, both algorithms work well, and for the closed belt region, they will still come into existence while some restricted conditions are taken into consideration. Finally, the simulation results demonstrate the feasibility of the proposed algorithms.
