共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
Shamanth Nagaraju Sreejith V Lucy J. Gudino Bhushan V. Kadam Ramesha C. K. Joseph Rodrigues 《International Journal of Communication Systems》2020,33(4)
In common practice, sensor nodes are randomly deployed in wireless sensor network (WSN); hence, location information of sensor node is crucial in WSN applications. Localization of sensor nodes performed using a fast area exploration mechanism facilitates precise location‐based sensing and communication. In the proposed localization scheme, the mobile anchor (MA) nodes integrated with localization and directional antenna modules are employed to assist in localizing the static nodes. The use of directional antennas evades trilateration or multilateration techniques for localizing static nodes thereby resulting in lower communication and computational overhead. To facilitate faster area coverage, in this paper, we propose a hybrid of max‐gain and cost‐utility–based frontier (HMF) area exploration method for MA node's mobility. The simulations for the proposed HMF area exploration–based localization scheme are carried out in the Cooja simulator. The paper also proposes additional enhancements to the Cooja simulator to provide directional and sectored antenna support. This additional support allows the user with the flexibility to feed radiation pattern of any antenna obtained either from simulated data of the antenna design simulator, ie, high frequency structure simulator (HFSS) or measured data of the vector network analyzer (VNA). The simulation results show that the proposed localization scheme exhibits minimal delay, energy consumption, and communication overhead compared with other area exploration–based localization schemes. The proof of concept for the proposed localization scheme is implemented using Berkeley motes and customized MA nodes mounted with indigenously designed radio frequency (RF) switch feed network and sectored antenna. 相似文献
3.
This paper considers the problem of localizing a group of targets whose number is unknown by wireless sensor networks. At each time slot, to save energy and bandwidth resources, only part of sensor nodes are scheduled to activate to remain continuous monitoring of all the targets. The localization problem is formulated as a sparse vector recovery problem by utilizing the spatial sparsity of targets’ location. Specifically, each activated sensor records the RSS values of the signals received from the targets and sends the measurements to the sink node where a compressive sampling‐based localization algorithm is conducted to recover the number and locations of targets. We decompose the problem into two sub‐problems, namely, which sensor nodes to activate, and how to utilize the measurements. For the first subproblem, to reduce the effect of measurement noise, we propose an iterative activation algorithm to re‐assign the activation probability of each sensor by exploiting the previous estimate. For the second subproblem, to further improve the localization accuracy, a sequential recovery algorithm is proposed, which conducts compressive sampling on the least squares residual of the previous estimate such that all the previous estimate can be utilized. Under some mild assumptions, we provide the analytical performance bound of our algorithm, and the running time of proposed algorithm is given subsequently. Simulation results demonstrate the effectiveness of our algorithms.Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
4.
5.
针对MSP算法需要借助额外的外部扫描设备,不适合应用于对野外大规模部署的传感器网络进行定位这一缺点,提出了一种HG-MSP算法。该算法通过锚节点发出扫描信息,不需要额外的外部设备进行辅助定位,提高了算法的可用性。仿真实验表明,在去掉辅助设备的情况下,算法的定位精度并无明显下降。 相似文献
6.
为了有效延长无线传感器网络的生存时间,针对传感器节点能耗不均衡难题,提出一种改进遗传算法优化的无线传感器网络路由算法。首先对LEACH算法不足进行分析,然后构建簇头节点选择的目标函数,并将其作为遗传算法的搜索目标,最后通过遗传算法找到下一时刻簇头的候选节点,并针对遗传算法不足进行相应改进。采用仿真实验对算法的性能进行分析,结果表明,相对于其它无线传感器路由算法,本文算法可以保证无线传感器的节点能量均衡,延长了网络的生存时间。 相似文献
7.
针对DV-Hop距算法定位误差大的难题,提出一种改进离估计误差,并利用DV-Hop的传感器节点定位算法。首先修正知节点与信标节DV-Hop算法对节点进行定位;然后对进V-Hop算法定位误差行校正,最后在Matlab 2012平台上对算法性能进行仿真分析。仿真结果表明,本文算法可以较好地克服DV-Hop算法存在的不足,提高了传感器节点的定位精度。 相似文献
8.
9.
10.
The jamming detection approach based on fuzzy assisted multicriteria decision‐making system (JDA) is proposed to detect the presence of jamming in downstream communication for Cluster based Wireless Sensor Network (CWSN). The proposed approach is deployed in cluster head (CH). The JDA functions in two aspects: First, the CH periodically measures the jamming detection metrics namely Packet Delivery Ratio (PDR) and Received Signal Strength Indicator (RSSI) of every node in the cluster to determine the behavior of the sensor nodes. In order to determine the behavior of members in the cluster, the CH compares the measured PDR with the PDR threshold. If the measured PDR is lesser than the PDR threshold, then CH applies the TOPSIS method on the PDR and RSSI metrics to determine the presence of jamming. These metrics are considered as the criteria and the nodes or the members are considered to be the alternatives. Next, the fuzzy logic is applied on the results obtained from the TOPSIS method to optimize the jamming detection metrics and identify the presence of jamming accurately. The proposed jamming detection approach detects well and arrives at 99.6% jamming detection rate as shown in simulation. 相似文献
11.
12.
13.
14.
Noureddine Moussa Abdelbaki El Belrhiti El Alaoui 《International Journal of Communication Systems》2019,32(16)
Energy conservation and fault tolerance are two critical issues in the deployment of wireless sensor networks (WSNs). Many cluster‐based fault‐tolerant routing protocols have been proposed for energy conservation and network lifetime maximization in WSNs. However, these protocols suffer from high frequency of re‐clustering as well as extra energy consumption to tolerate failures and consider only some very normal parameters to form clusters without any verification of the energy sufficiency for data routing. Therefore, this paper proposes a cluster‐based fault‐tolerant routing protocol referred as CFTR. This protocol allows higher energy nodes to become Cluster Heads (CHs) and operate multiple rounds to diminish the frequency of re‐clustering. Additionally, for the sake to get better energy efficiency and balancing, we introduce a cost function that considers during cluster formation energy cost from sensor node to CH, energy cost from CH to sink, and another significant parameter, namely, number of cluster members in previous round. Further, the proposed CFTR takes care of nodes, which have no CH in their communication range. Also, it introduces a routing algorithm in which the decision of next hop CH selection is based on a cost function conceived to select routes with sufficient energy for data transfer and distribute uniformly the overall data‐relaying load among the CHs. As well, a low‐overhead algorithm to tolerate the sudden failure of CHs is proposed. We perform extensive simulations on CFTR and compare their results with those of two recent existing protocols to demonstrate its superiority in terms of different metrics. 相似文献
15.
16.
Jeong‐Min Choi Jong‐Seob Baek Jae‐Shin Han Jong‐Soo Seo 《Wireless Communications and Mobile Computing》2016,16(1):94-110
In this paper, we study the performance of a training‐based least square (LS) and linear minimum mean‐square‐error (LMMSE) channel estimation for both hop‐by‐hop and multi‐hop direct forwarding wireless sensor networks over frequency‐selective fading channels. Specifically, to investigate the properties of the channel estimation, we accomplish a theoretical analysis of MSE in terms of various link parameters. From the performance evaluation, we analytically present the effects of the number of hops on the MSE performance for channel estimations in both multi‐hop networks. Interesting observations of MSE behaviors under various conditions are discussed, and the receiver complexity and channel equalization performance are also analyzed. Finally, through the computer simulations, the analytical results and detection performance are demonstrated. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
17.
18.
Jing Teng Hichem Snoussi Cdric Richard 《Wireless Communications and Mobile Computing》2012,12(9):797-812
The key impediments to a successful wireless sensor network (WSN) application are the energy and the longevity constraints of sensor nodes. Therefore, two signal processing oriented cluster management strategies, the proactive and the reactive cluster management, are proposed to efficiently deal with these constraints. The former strategy is designed for heterogeneous WSNs, where sensors are organized in a static clustering architecture. A non‐myopic cluster activation rule is realized to reduce the number of hand‐off operations between clusters, while maintaining desired estimation accuracy. The proactive strategy minimizes the hardware expenditure and the total energy consumption. On the other hand, the main concern of the reactive strategy is to maximize the network longevity of homogeneous WSNs. A Dijkstra‐like algorithm is proposed to dynamically form active cluster based on the relation between the predictive target distribution and the candidate sensors, considering both the energy efficiency and the data relevance. By evenly distributing the energy expenditure over the whole network, the objective of maximizing the network longevity is achieved. The simulations evaluate and compare the two proposed strategies in terms of tracking accuracy, energy consumption and execution time. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
19.
In wireless sensor networks, data aggregation protocols are used to prolong the network lifetime. However, the problem of how to perform data aggregation while preserving data privacy is challenging. This paper presents a polynomial regression‐based data aggregation protocol that preserves the privacy of sensor data. In the proposed protocol, sensor nodes represent their data as polynomial functions to reduce the amount of data transmission. In order to protect data privacy, sensor nodes secretly send coefficients of the polynomial functions to data aggregators instead of their original data. Data aggregation is performed on the basis of the concealed polynomial coefficients, and the base station is able to extract a good approximation of the network data from the aggregation result. The security analysis and simulation results show that the proposed scheme is able to reduce the amount of data transmission in the network while preserving data privacy. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
20.
Guiyun Liu Hua Liu Hongbin Chen Chao Zhou Lei Shu 《Wireless Communications and Mobile Computing》2016,16(8):929-941
The problem of target location estimation in a wireless sensor network is considered, where due to the bandwidth and power constraints, each sensor only transmits one‐bit information to its fusion center. To improve the performance of estimation, a position‐based adaptive quantization scheme for target location estimation in wireless sensor networks is proposed to make a good choice of quantizer' thresholds. By the proposed scheme, each sensor node dynamically adjusts its quantization threshold according to a kind of position‐based information sequences and then sends its one‐bit quantized version of the original observation to a fusion center. The signal intensity received at local sensors is modeled as an isotropic signal intensity attenuation model. The position‐based maximum likelihood estimator as well as its corresponding position‐based Cramér–Rao lower bound are derived. Numerical results show that the position‐based maximum likelihood estimator is more accurate than the classical fixed‐quantization maximum likelihood estimator and the position‐based Cramér–Rao lower bound is less than its fixed‐quantization Cramér‐Rao lower bound. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献