共查询到20条相似文献,搜索用时 0 毫秒
1.
非均匀分布下无线传感器网络节点调度机制 总被引:3,自引:0,他引:3
针对传统依赖精确位置信息的计算复杂和无位置信息部署受限性等弊端,从理论上对节点部署方式进行分析,提出一种非均匀分布下的无线传感器网络节点调度NDNS(non-uniform distribution node scheduling)机制,该机制利用节点与邻居节点的距离信息,对节点覆盖冗余进行判别,适应于任意分布下的网络部署方式。通过实验对机制进行了性能分析和验证,结果表明该方案在保证网络覆盖的前提下,有效地延长了网络生存时间。 相似文献
2.
3.
4.
Xu Lu Rongjun Chen Jun Liu Lianglun Cheng 《International Journal of Communication Systems》2018,31(8)
Wireless passive sensor networks play an important role in solving the energy limitation of nodes in the Internet of Things, and node scheduling is a significant method used to improve the energy utilization of nodes. In this work, an unused energy model based on analyzing the energy consumption characteristics of passive nodes is proposed because no unified model of passive sensor nodes is reported in previous studies. A rapid square partition clustering method is proposed according to the analysis of the relation between the sensing and communication radii of nodes, and the secondary grouping and node scheduling in each cluster are implemented to ensure the coverage rate of networks. Experimental results show that the state distribution of nodes in the proposed algorithm is favorable. The performance of the proposed algorithm is significantly affected by the P ratio between the working and charging powers of nodes. When the value of P is less than 100, the network coverage and connectivity rate are maintained at more than 95% and 90%, respectively, and are both higher than the existing algorithm. 相似文献
5.
6.
Bang Wang Kee Chaing Chua Vikram Srinivasan 《International Journal of Communication Systems》2008,21(11):1181-1203
Coverage is an important issue in wireless sensor networks (WSNs) and is often used to measure how well a sensor field is monitored by the deployed sensors. If the area covered by a sensor can also be covered by some other sensors, this sensor can go into an energy‐saving sleep state without sacrificing the coverage requirement. In this paper, we study the problem of how to select active sensors with the constraints that the selected active sensors can provide complete field coverage and are completely connected. We propose to use the notion of information coverage, which is based on estimation theory to exploit the collaborative nature of WSNs, instead of using the conventional definition of coverage. Owing to the use of information coverage, a point that is not within the sensing disk of any sensor can still be considered to be covered without loss of estimation reliability. We propose a heuristic to approximately solve our problem. The basic idea is to grow a connected sensor tree to maximize the profit from the covered points of the selected sensors in each step. Simulations are used to validate the effectiveness of the proposed algorithm and the results illustrate that the number of active sensors to provide area coverage can be greatly reduced by using the notion of information coverage compared with that by using the conventional definition of coverage. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
7.
8.
针对无线传感器网络中存在的热区问题,采用非均匀部署方案,并在此基础上提出基于能量预测的无线传感器网络节点覆盖调度算法。并对算法进行了仿真实验和性能分析。结果表明该算法可以延长的网络生命周期并在较长的时间里保持较高的网络覆盖率,能够达到网络内大多数节点能耗均衡的设计目标。 相似文献
9.
10.
针对MSP算法需要借助额外的外部扫描设备,不适合应用于对野外大规模部署的传感器网络进行定位这一缺点,提出了一种HG-MSP算法。该算法通过锚节点发出扫描信息,不需要额外的外部设备进行辅助定位,提高了算法的可用性。仿真实验表明,在去掉辅助设备的情况下,算法的定位精度并无明显下降。 相似文献
11.
12.
To balancing energy consumption in wireless sensor networks, we proposed a fixed time interval node broadcasting scheme under variational acceleration straight-line movement model. Simulation results show that the approach proposed in this paper has a superior performance on energy consumption balance compared to uniform broadcasting methods. 相似文献
13.
Application reconfiguration is essential to achieving flexibility and adaptability of wireless sensor networks (WSNs) used in environment monitoring. In this paper, we present an integrated reconfiguration scheme (IRS) for implementing environment adaptive application reconfiguration (EAAR) in WSNs. In our scheme, application reconfiguration is implemented with the push‐based paradigm for densely distributed nodes and the cluster‐based hybrid reconfiguration (CHR) paradigm for sparsely distributed nodes. We demonstrate the energy‐efficiency and scalability of our scheme by analyzing the energy consumption based on a randomly deployed sensor network. Moreover, we derive the density threshold of reconfiguration nodes (RNs) for determining if the nodes are densely or sparsely distributed, and choose the mode of operation for IRS. We use extensive simulation experiments to demonstrate the effectiveness of our scheme. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
14.
Sensing coverage is one of fundamental problems in wireless sensor networks. In this paper, we investigate the polytype target coverage problem in heterogeneous wireless sensor networks where each sensor is equipped with multiple sensing units and each type of sensing unit can sense an attribute of multiple targets. How to schedule multiple sensing units of a sensor to cover multiple targets becomes a new challenging problem. This problem is formulated as an integer linear programming problem for maximizing the network lifetime. We propose a novel energy‐efficient target coverage algorithm to solve this problem based on clustering architecture. Being aware of the coverage capability and residual energy of sensor nodes, the clusterhead node in each cluster schedules the appropriate sensing units of sensor nodes that are in the active status to cover multiple targets in an optimal way. Extensive simulations have been carried out to validate the effectiveness of the proposed scheme. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
15.
16.
Chi Lin Guowei Wu Tie Qiu Jing Deng 《International Journal of Communication Systems》2016,29(7):1251-1268
Wireless sensor networks (WSNs) have many micro devices that are easy to capture. In node capture attacks, the adversary physically captures sensors and extracts all information including key information from their memories, trying to compromise the system's security protection. However, the robust and random nature of many WSN security designs makes it difficult to compromise the system even with the capture of some sensors. In this paper, we approach WSN security from an adversarial point of view and investigate low‐cost and efficient algorithms to identify sensors in a WSN in the shortest time with the lowest cost. Instead of randomly capturing sensors, an intelligent attacker should choose the next target based on the known topology so far. Because the identification of such has been proven to be NP‐hard (non‐deterministic polynomial‐time hard), we propose to transform the problem into a set covering problem and develop a greedy minimum cost node capture attack algorithm (MCA) to lower cost of attack. Extensive simulations have been implemented to evaluate the performance of MCA and to compare it with several related schemes. It is shown that MCA lowers the cost of compromising WSNs by 16%. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
17.
As a special type of wireless sensor network, the chain‐type wireless sensor networks can be used to monitor narrow and long regions, such as roads, underground mine tunnels, rivers, and bridges. In this study, a perpendicular bisector division (PB) method was first presented, in which the location may be divided into more location sub‐areas by a perpendicular bisector of each of two location nodes. Compared with the triangulation division method in Approximate Point‐in‐Triangulation Test (APIT), the computable complexity of PB is lower, and the number of division areas is larger. Furthermore, in order to locate targets under rare location nodes, a virtual location node‐perpendicular bisector division (VPB) was presented by a virtual location node based on the geographic shape of the monitored area. Virtual location nodes increase the density of location nodes, which can improve the accuracy of the location in the location algorithm. Second, two range‐free location algorithms were proposed: the location algorithm based on PB (LAPB) and the location algorithm based on VPB (LAVPB). In the end, the location errors performance of APIT, LAPB, and LAVPB for locating miners in an underground mine tunnel was tested. The results show that LAPB and LAVPB have higher location accuracy and are more robust than APIT. LAVPB is more suitable for locating targets in harsh environments. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
18.
19.
无线传感器网络中最小化能量广播算法 总被引:4,自引:0,他引:4
在无线传感器网络广播中,为保证所有节点都接收到广播的数据包并调节节点功率以最小化广播总能耗,在Cartigny等人提出的面向相对邻图的广播算法RBOP(relative neighborhood graph broadcast oriented protocol)的基础上,提出了更为节能的增强的面向相对邻图的广播算法ERBOP(enhanced relative neighborhood graph broadcast oriented protocol)。首先在相对邻图上删除较长边得到相对邻图的子图,该子图是连通稀疏图且包含了原图的最小生成树,然后在该子图上构造1-支配的连通支配集,只有支配点才参与数据包转发。仿真显示ERBOP有效节约了能量。 相似文献
20.
Hassan Artail Abdelkarim Ajami Tania Saouma Malak Charaf 《Wireless Communications and Mobile Computing》2016,16(14):1956-1971
This paper presents a faulty node detection approach for wireless sensor networks that aggregate measurement data on their way toward the sink (base station). The approach is based on the idea of commanding sensor nodes on the aggregation paths to temporarily stop including their readings in the received aggregated readings from their upstream neighbors. The scheme is dependent on the ability of the sink to detect faulty nodes through changes in the received aggregated readings at the sink using a Markov Chain Controller (MCC). The algorithm that is run in the sink uses the MCC to assign a state to each sensor node based on transitions that are triggered by receiving aggregated path readings, and accordingly deduces the nodes that may be faulty. The experimental results show at least 98% detection rate at the cost of reasonable detection delays and generated wireless network traffic. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献