共查询到20条相似文献,搜索用时 15 毫秒
1.
Hosein Mohamadi Shaharuddin Salleh Abdul Samad Ismail 《Wireless Personal Communications》2014,79(3):2323-2338
In recent years, directional sensor networks composed of directional sensors have attracted a great deal of attention due to their extensive applications. The main difficulties associated with directional sensors are their limited battery power and restricted sensing angle. Moreover, each target may have a different coverage quality requirement that can make the problem even more complicated. Therefore, satisfying the coverage quality requirement of all the targets in a specific area and maximizing the network lifetime, known as priority-based target coverage problem, has remained a challenge. As sensors are often densely deployed, organizing the sensor directions into several cover sets and then activating these cover sets successively is a promising solution to this problem. In this paper, we propose a learning automata-based algorithm to organize the directional sensors into several cover sets in such a way that each cover set can satisfy coverage quality requirement of all the targets. In order to verify the performance of the proposed algorithm, several simulations were conducted. The obtained results showed that the proposed algorithm was successful in extending the network lifetime. 相似文献
2.
Hosein Mohamadi Abdul Samad Ismail Shaharuddin Salleh 《Wireless Personal Communications》2014,75(1):447-463
Recent years have witnessed a significant increase in employing wireless sensor networks (WSNs) for a variety of applications. Monitoring a set of discrete targets and, at the same time, extending the network lifetime is a critical issue in WSNs. One method to solve this problem is designing an efficient scheduling algorithm that is able to organize sensor nodes into several cover sets in such a way that each cover set could monitor all the targets. This study presents three learning automata-based scheduling algorithms to solve the problem. Moreover, several pruning rules are devised to avoid the selection of redundant sensors and manage critical sensors for extending the network lifetime. To evaluate the performance of proposed algorithms, we conducted several experiments, and the obtained results indicated that Algorithm 3 was more successful in terms of extending the network lifetime. 相似文献
3.
4.
In wireless sensor networks, when each target is covered by multiple sensors, we can schedule sensor nodes to monitor deployed targets in order to improve lifetime of network. In this paper, we propose an efficient scheduling method based on learning automata, in which each node is equipped with a learning automaton, which helps the node to select its proper state (active or sleep), at any given time. To study the performance of the proposed method, computer simulations are conducted. Results of these simulations show that the proposed scheduling method can better prolong the lifetime of the network in comparison to similar existing methods. 相似文献
5.
Saadi Nora Bounceur Ahcène Euler Reinhardt Lounis Massinissa Bezoui Madani Kerkar Moussa Pottier Bernard 《Wireless Personal Communications》2020,111(3):1525-1543
Wireless Personal Communications - The challenge in the deployment of wireless sensor networks is to ensure the coverage of targets with high energy efficiency, particularly when coverage and... 相似文献
6.
《Networking, IEEE/ACM Transactions on》2008,16(6):1378-1391
7.
当节点采用概率感知模型且融合多个节点的数据进行联合感知的情况下,提出了一个新的无线传感器网络的覆盖优化问题:基于融合的k-集覆盖优化问题.首先,将优化问题建模为融合覆盖博弈,证明该博弈是势博弈,且势函数与优化目标函数一致,因此,最优解是一个纯策略Nash均衡解.其次,给出了节点间融合覆盖效用独立的判定条件,进而分别提出同步、异步控制的、基于局部信息的、分布式的覆盖优化算法,证明了算法收敛到纯策略Nash均衡.最后,仿真实验结果表明,当算法收敛时,网络能达到高的覆盖率且具有好的覆盖稳定性. 相似文献
8.
定向传感器网络中的最小化覆盖间隙和最大化网络生命时间问题的研究 总被引:2,自引:0,他引:2
本文研究了定向传感器网络中最小化覆盖间隙和最大化网络生命时间的问题.本文采用的定向感知天线模型,每个传感器有多个感应方向.在无线传感器网络中,最大化网络生命时间和最小化覆盖间隙是两个冲突的目标.为了在两者之间做出权衡,文章研究了在生命时间受约束的情况下最小化覆盖间隙问题(MCBLC)和在覆盖间隙受约束的条件下最大化网络生命时间问题(MLCBC).对于MCBLC问题,我们首先将它模型化为整数规划问题,并提出两个启发式算法(MCBLC-G和MCBLC-G-1).基于MCBLC-G(MCBLC-G-1)算法,利用二分搜索技术得到MLCBC问题的算法.最后,模拟验证了算法的性能. 相似文献
9.
针对有向传感器网络中的时空覆盖调度问题进行研究,从有向传感器节点感知模型出发,设计了基于网格划分的网络基本区域生成方法,在此基础上提出了节点最大覆盖调度迭代选择MaxGreedy算法.通过仿真实验验证了网格划分方法的有效性,设计了一系列的时空覆盖算法对比实验,深入评估MaxGreedy算法的性能.对比试验结果表明,MaxGreedy算法可以高效地生成网络的节点调度模式,并在一定程度上提高网络的时空覆盖率. 相似文献
10.
One way to reduce energy consumption in wireless sensor networks is to reduce the number of active nodes in the network. When sensors are redundantly deployed, a subset of sensors should be selected to actively monitor the field (referred to as a "cover"), whereas the rest of the sensors should be put to sleep to conserve their batteries. In this paper, a learning automata based algorithm for energy-efficient monitoring in wireless sensor networks (EEMLA) is proposed. Each node in EEMLA algorithm is equipped with a learning automaton which decides for the node to be active or not at any time during the operation of the network. Using feedback received from neighboring nodes, each node gradually learns its proper state during the operation of the network. Experimental results have shown that the proposed monitoring algorithm in comparison to other existing methods such as Tian and LUC can better prolong the network lifetime. 相似文献
11.
12.
13.
Izadi-Ghodousi Zahra Hosseinpour Mahsa Safaei Fatemeh Mohajerzadeh Amir Hossein Alishahi Mohammad 《Wireless Personal Communications》2019,109(3):1925-1954
Wireless Personal Communications - In this paper we have considered an efficient adapted Unscented Kalman Filter based target tracking in directional wireless sensor networks while observations are... 相似文献
14.
Mobile Networks and Applications - Ad-hoc networks of sensor nodes are in general semi-permanently deployed. However, the topology of such networks continuously changes over time, due to the power... 相似文献
15.
Coverage in Hybrid Mobile Sensor Networks 总被引:1,自引:0,他引:1
Wang Wei Srinivasan Vikram Chua Kee-Chaing 《Mobile Computing, IEEE Transactions on》2008,7(11):1374-1387
This paper considers the coverage problem for hybrid networks which comprise both static and mobile sensors. The mobile sensors in our network only have limited mobility, i.e., they can move only once over a short distance. In random static sensor networks, sensor density should increase as O(log L + k log log L) to provide k-coverage in a network with a size of L. As an alternative, an all-mobile network can provide k-coverage with a constant density of O(k), independent of network size L. We show that the maximum distance for mobile sensors is O( 1/sqrt(k) log^(4/3)(kL)). We then propose a hybrid network structure, comprising static sensors and a small fraction of O( 1/sqrt(k)) of mobile sensors. For this network structure, we prove that k-coverage is also achievable with a constant sensor density of O(k). Furthermore, for this hybrid structure, we prove that the maximum distance which any mobile sensor has to move is bounded as O(log^(3/4)L). We then propose a distributed relocation algorithm, where each mobile sensor only requires local information in order to optimally relocate itself. We verify our analysis via extensive numerical evaluations and show an implementation of the mobility algorithm on real mobile sensor platforms. 相似文献
16.
无线传感器网络中覆盖问题的研究 总被引:3,自引:0,他引:3
简要介绍了无线传感器网络体系结构、特点和应用领域.针对无线传感器网络节点覆盖问题进行了研究,提出了基于最短路径的覆盖算法,并给出了仿真结果. 相似文献
17.
18.
Sung-Yeop Pyun Dong-Ho Cho 《Communications Letters, IEEE》2009,13(2):130-132
We address the multiple-target coverage problem (MTCP) in wireless sensor networks (WSNs). We also propose an energy-efficient sensor-scheduling algorithm for multiple-target coverage (MTC) that considers both the transmitting energy for collected data and overlapped targets. We introduce two algorithms: one optimal, the other heuristic. Simulation results show that the proposed algorithms can contribute to extending the lifetime of network and that the heuristic algorithm is more practical than the optimal algorithm with respect to complexity. 相似文献
19.
提出了一种与节点位置无关的、能量感知的无线传感器网络覆盖控制协议EACCP(an Energy-Aware Coverage Control Protocol for wireless sensor networks),EACCP采用基于节点分层成簇的思想,根据节点邻居平均能量与自身剩余能量等参数竞选活动节点.理论分析与模拟实验表明EACCP协议不但能够提供高质量的网络覆盖率,而且可以有效地适应于节点能量异构的网络应用场景,并且减少活动节点选取过程中的控制消息开销. 相似文献
20.
System lifetime of wireless sensor networks (WSN) is inversely proportional to the energy consumed by critically energy-constrained sensor nodes during RF transmission. In that regard, modulated backscattering (MB) is a promising design choice, in which sensor nodes send their data just by switching their antenna impedance and reflecting the incident signal coming from an RF source. Hence, wireless passive sensor networks (WPSN) designed to operate using MB do not have the lifetime constraints of conventional WSN. However, the communication performance of WPSN is directly related to the RF coverage provided over the field the passive sensor nodes are deployed. In this letter, RF communication coverage in WPSN is analytically investigated. The required number of RF sources to obtain interference-free communication connectivity with the WPSN nodes is determined and analyzed in terms of output power and the transmission frequency of RF sources, network size, RF source and WPSN node characteristics. 相似文献