共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
3.
已有的无线多媒体传感器网络(WMSNs)研究针对传感器放置在目标区域内的情况进行,且没有考虑节点通过云台的转动获得的整个可能感知区域对覆盖率的影响。本文首先针对节点放置点高于目标区域的应用进行研究,综合考虑节点感知区域和可能感知区域,建立了延时和无延时感知模型,并针对不同的感知模型提出了传感器网络部署控制算法(IVPDCA),算法中改进了虚拟势场算法,定义了节点质量的概念来表示节点间覆盖重叠的大小,建立受力模型,使得节点在合力作用下进行重新部署,同时关闭冗余节点,既延长了网络寿命,又提高了区域覆盖率。仿真结果验证了算法的有效性。 相似文献
4.
5.
Recently, many researches have been conducted to exploit the compressive sensing (CS) theory in wireless sensor networks (WSNs). One of the most important goals in CS is to prolong the lifetime of WSNs. But CS may suffer from some errors during the reconstruction phase. In addition, an adaptive version of CS named Bayesian compressive sensing has been studied to improve the reconstruction accuracy in WSNs. This paper investigates these adaptive methods and identifies their associated problems. Finally, a distributed and semi‐adaptive CS‐based data collection method is proposed. The proposed method tackles the aforementioned problems. Simulation results show that considering both lifetime and accuracy factors as a compound metric, the proposed method yields a 200% improvement compared with the Bayesian compressive sensing‐based method and outperforms other compared methods in the literature. 相似文献
6.
无线传感器网络中的节点众多,节点之间仅依靠频谱资源管理机制分配的频段进行数据传输会造成频谱资源紧张。针对这一问题,将认知无线电技术引入分簇的无线传感器网络,并且考虑分簇无线传感器网络节点的能量受限问题提出了一种节能的频谱感知方案。此方案首先让簇内的节点采取双门限能量检测的协作频谱感知方法,在满足目标检测概率和虚警概率的条件下,确定进行频谱感知的最少节点数,降低系统能耗。其次,通过选择合适的簇内节点进行频谱感知,使簇内节点的能耗均衡,簇的生命周期得到延长。 相似文献
7.
在无线传感网络(Wireless Sensor Networks,WSN)技术中,各传感节点覆盖区域的研究是这项技术应用的基础课题.文章对国外最近提出的部分覆盖技术进行了收集整理,对其技术特性做了分析和对比.从覆盖度、节点分布特性、节点类型以及网络拓扑结构4方面对这些技术进行比较.最后,对部分覆盖技术的未来可能的研究方... 相似文献
8.
In this paper, we study the one‐dimensional coverage problem in a wireless sensor network (WSN) and consider a network deployed along a one‐dimensional line according to a Poisson distribution. We analyze three important parameters that are related to the problem, i.e., expected k‐coverage proportion, full k‐coverage probability, and partial k‐coverage probability, and derive mathematical models that describe the relationships between the node density in the network and these parameters. The purpose is to calculate or estimate the node density required for achieving a given coverage probability, which is useful in the deployment of a one‐dimensional network for many applications. We first analyze the expected k‐coverage proportion, then analyze the full k‐coverage probability for k = 1 and the lower bound to the full k‐coverage probability for k > 1, and finally analyze the partial k‐coverage probability for k = 1 and give a brief discussion of the partial k‐coverage probability for k > 1. The mathematical models are validated through simulation. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
9.
Combining network coding and compressed sensing for error correction in wireless sensor networks 下载免费PDF全文
Siguang Chen Meng Wu Kun Wang Zhixin Sun Weifeng Lu 《International Journal of Communication Systems》2015,28(7):1303-1315
As the spatial and temporal correlations of sensor readings are common in wireless sensor networks, motivated by these features and the drawbacks of network coding (NC), we introduce compressed sensing (CS) into NC scheme and construct a cooperating coding mechanism, which performs over different data fields with a compatible transformation measure for the combination of NC and CS. This cooperating coding scheme can reduce the amount of redundant information transmission significantly, because the temporal and spatial correlations are explored fully. Meanwhile, the erasures and errors are considered simultaneously in relay transmission process; a NC decoding for error control is proposed to correct the erasures and errors. Although the decoding error of NC is existent, this error can be further reduced by the reconstruction process of CS; as a result, the relative recovery error is small enough in the sink. Finally, the reliability and performance analyses confirm that the proposed cooperating coding scheme obtains considerable compression gain as compared with conventional coding scheme of NC and transmits information reliably with high recovery precision. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
10.
11.
For the redundancy coverage of nodes leads to the phenomenon of low energy efficiency,Non-cooperative game theory was used to solve it.A revenue function was proposed,which considering the coverage of nodes and the residual energy.The lifetime of the node and network path gain were applied to revenue function.The network topology was built by nodes with the appropriate work strategy.Control algorithm coverage in wireless sensor network was proposed based on Non-cooperative game theory.A Nash equilibrium between the coverage rate and the residual energy was proved,and the return function converged to the Pareto optimal.Experiments show that the algorithm can provide reasonable coverage of network nodes and ensure energy efficiency. 相似文献
12.
针对水下移动无线传感器网络(MUWSN, mobile underwater wireless sensor networks)拓扑随洋流动态演化对其网络性能会产生很大影响,提出了一种基于拓扑重构的水下移动无线传感器网络拓扑优化方法,首先通过模拟鱼群行为对传感器节点位置进行调整,优化网络覆盖度;其次,利用冗余节点修复网络中不连通位置,消除关键节点,优化网络连通性,最后,通过仿真对比实验验证了该方法的合理性和有效性。实验结果表明,所提算法能在较低能耗下,保证网络覆盖度长期维持在97%左右,连通率达到89%以上。 相似文献
13.
基于不等簇半径轮换工作的传感器网络能量空洞避免研究 总被引:2,自引:0,他引:2
从理论上分析了分簇网络不同簇半径下的能量消耗情况,得到的结论是:1)给出了网络寿命最大时的簇半径τ的计算表达式;2)提出一种新颖而简单的采用不等簇半径轮换工作的能最空洞避免策略,其核心是:网络寿命取决于能量消耗最大节点的能量消耗,当采用不等的簇半径轮换工作时,其能量消耗最大的节点不是同一节点,因而其综合的能量消耗比采用最优的固定簇半径的能量消耗还少,从而可有效提高网络寿命.理论分析与模拟实验结果表明,该策略实施简单,又能够有效地避免能量空洞现象,并显著地延长了网络的存活时间. 相似文献
14.
Camera sensor networks have recently emerged as a critical research topic. In this paper, we investigate the coverage problem for camera sensor networks. Specially, compared to the coverage problem for target detection which has been intensively studied, this paper studies the coverage problem from the perspective of target localization. We first propose a novel localization‐oriented sensing model based on the perspective projection of the camera sensors. Then, under the random uniform deployment strategy, we analyze how the probability of the localization‐oriented coverage (L‐coverage for short) changes with the sensors number and the parameters of the proposed sensing model. Finally, we conduct extensive simulations to validate our model and theoretical analysis about L‐coverage probability. The obtained results show that our scheme can be effectively applied for practical scenarios. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
15.
16.
Nadeem Ahmed Salil S. Kanhere Sanjay Jha 《Wireless Communications and Mobile Computing》2011,11(1):23-45
Success of Wireless Sensor Networks (WSN) largely depends on whether the deployed network can provide desired area coverage with acceptable network lifetime. This paper seeks to address the problem of determining the current coverage achieved by the non‐deterministic deployment of static sensor nodes and subsequently enhancing the coverage using mobile sensors. We identify three key elements that are critical for ensuring effective area coverage in Hybrid WSN: (i) determining the boundary of the target region and evaluating the area coverage (ii) locating coverage holes and maneuvering mobile nodes to fill these voids, and (iii) maintaining the desired coverage over the entire operational lifetime of the network. We propose a comprehensive solution that addresses all of the aforementioned aspects of the area coverage, called MAPC (mobility assisted probabilistic coverage). MAPC is a distributed protocol that operates in three distinct phases. The first phase identifies the boundary nodes using the geometric right‐hand rule. Next, the static nodes calculate the area coverage and identify coverage holes using a novel probabilistic coverage algorithm (PCA). PCA incorporates realistic sensing coverage model for range‐based sensors. The second phase of MAPC is responsible for navigating the mobile nodes to plug the coverage holes. We propose a set of coverage and energy‐aware variants of the basic virtual force algorithm (VFA). Finally, the third phase addresses the problem of coverage loss due to faulty and energy depleted nodes. We formulate this problem as an Integer Linear Program (ILP) and propose practical heuristic solutions that achieve similar performance as that of the optimal ILP solution. A guiding principle in our design process has been to ensure that the MAPC can be readily implemented in real‐world applications. We implemented the boundary detection and PCA algorithm (i.e., Phase I) of the MAPC protocol on off‐the‐shelf sensor nodes and results show that the MAPC can successfully identify boundary nodes and accurately determine the area coverage in the presence of real radio irregularities observed during the experiments. Extensive simulations were carried out to evaluate the complete MAPC protocol and the results demonstrate that MAPC can enhance and maintain the area coverage, while reducing the total energy consumption by up to 70% as compared with the basic VFA. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
17.
MA Shu-hui JI Hong YUE Guang-xin School of Telecommunication Engineering Beijing University of Posts Telecommunications Beijing China 《中国邮电高校学报(英文版)》2007,14(2):7-13
A novel topology scheme, cell with multiple mobile sinks method (CMMSM), is proposed in this article for the collection of information and for the environment monitoring in wireless sensor networks. The system consists of many static sensors, scattered in a large scale sensing field and multiple mobile sinks, cruising among the clusters. Conservation of energy and simplification of protocol are important design considerations in this scheme. The noninterference topology scheme largely simplifies the full-distributed communication protocol with the ability of collision avoidance and random routing. The total number of cluster heads in such a topology was analyzed, and then an approximate evaluation of the total energy consumption in one round was carried out. Simulation results show that CMMSM can save considerable energy and obtain higher throughput than low-energy adaptive clustering hierarchy (LEACH) and geographical adaptive fidelity (GAF). 相似文献
18.
目前,大多数的拓扑控制算法采用的能耗模型不符合实际,仅仅只考虑了发送能耗,忽略了不同接收能耗对底层拓扑结构的影响。其次,通过构建最小能耗拓扑子图的拓扑控制算法并不能最大化网络生存期。基于真实的能耗模型主要研究异构传感器网络的拓扑控制问题,提出了一种适用于异构传感器网络生存期可延长的可调节结构(ALPH)来控制网络拓扑。理论和仿真实验表明:通过ALPH构造的拓扑图保持了网络的连通性和双向性;在不同的射频模块下,ALPH以最小能耗保留了任意节点对之间的最大生存期路径;ALPH可以依据不同电路能耗参数P R0进行调整,使得所生成的拓扑图在DRNG与MaxPower之间调节变化,并且允许节点有不同的路径损耗指数;基于网络设备的真实参数值,与先前的拓扑结构DRNG、DGG、EYG和MaxPower相比,ALPH可以有效地延长网络生存期。 相似文献
19.
在可充电无线传感器网络中的能量补给设备兼任数据采集设备的情况下,提出了可充电无线传感器网络时变动态拓扑模型,并在此基础上根据最大化能量补给设备驻站时间比为目标提出了最优化问题。通过分析不同时刻不同传感器节点和无线能量补给/数据采集设备的工作情况及需要遵循的约束条件,得到与原问题具有等优性的多状态线性规划问题。求解该优化问题,获得可充电无线传感器网络动态拓扑下的周期动态路由和无线能量补给/数据采集设备的工作策略。与之前的研究成果相比,优化目标值均有20%以上的提升。 相似文献