共查询到20条相似文献,搜索用时 15 毫秒
1.
Guangjie Han Huihui Xu Jinfang Jiang Lei Shu Takahiro Hara Shojiro Nishio 《Wireless Communications and Mobile Computing》2013,13(14):1324-1336
In wireless sensor networks (WSNs), many applications require sensor nodes to obtain their locations. Now, the main idea in most existing localization algorithms has been that a mobile anchor node (e.g., global positioning system‐equipped nodes) broadcasts its coordinates to help other unknown nodes to localize themselves while moving according to a specified trajectory. This method not only reduces the cost of WSNs but also gets high localization accuracy. In this case, a basic problem is that the path planning of the mobile anchor node should move along the trajectory to minimize the localization error and to localize the unknown nodes. In this paper, we propose a Localization algorithm with a Mobile Anchor node based on Trilateration (LMAT) in WSNs. LMAT algorithm uses a mobile anchor node to move according to trilateration trajectory in deployment area and broadcasts its current position periodically. Simulation results show that the performance of our LMAT algorithm is better than that of other similar algorithms. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
2.
3.
针对MSP算法需要借助额外的外部扫描设备,不适合应用于对野外大规模部署的传感器网络进行定位这一缺点,提出了一种HG-MSP算法。该算法通过锚节点发出扫描信息,不需要额外的外部设备进行辅助定位,提高了算法的可用性。仿真实验表明,在去掉辅助设备的情况下,算法的定位精度并无明显下降。 相似文献
4.
针对DV-Hop距算法定位误差大的难题,提出一种改进离估计误差,并利用DV-Hop的传感器节点定位算法。首先修正知节点与信标节DV-Hop算法对节点进行定位;然后对进V-Hop算法定位误差行校正,最后在Matlab 2012平台上对算法性能进行仿真分析。仿真结果表明,本文算法可以较好地克服DV-Hop算法存在的不足,提高了传感器节点的定位精度。 相似文献
5.
6.
7.
8.
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. 相似文献
9.
10.
Nikhath Tabassum Geetha D. Devanagavi Rajashekhar C. Biradar Mihai T. Lazarescu 《International Journal of Communication Systems》2020,33(15)
Wireless sensor networks find extensive applications, such as environmental and smart city monitoring, structural health, and target location. To be useful, most sensor data must be localized. We propose a node localization technique based on bilateration comparison (BACL) for dense networks, which considers two reference nodes to determine the unknown position of a third node. The mirror positions resulted from bilateration are resolved by comparing their coordinates with the coordinates of the reference nodes. Additionally, we use network clustering to further refine the location of the nodes. We show that BACL has several advantages over Energy Aware Co‐operative Localization (EACL) and Underwater Recursive Position Estimation (URPE): (1) BACL uses bilateration (needs only two reference nodes) instead of trilateration (that needs three reference nodes), (2) BACL needs reference (anchor) nodes only on the field periphery, and (3) BACL needs substantially less communication and computation. Through simulation, we show that BACL localization accuracy, as root mean square error, improves by 53% that of URPE and by 40% that of EACL. We also explore the BACL localization error when the anchor nodes are placed on one or multiple sides of a rectangular field, as a trade‐off between localization accuracy and network deployment effort. Best accuracy is achieved using anchors on all field sides, but we show that localization refinement using node clustering and anchor nodes only on one side of the field has comparable localization accuracy with anchor nodes on two sides but without clustering. 相似文献
11.
12.
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. 相似文献
13.
14.
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. 相似文献
15.
针对现存无线传感器网络定位算法中需要采集、存储和处理大量数据导致运算量较大与能耗过高的问题,提出了一种改进的基于贝叶斯压缩感知的多目标定位算法.该算法利用锚节点对监控区域的划分,结合贝叶斯压缩感知理论将多目标定位问题转换为稀疏信号重构的问题.针对传统观测矩阵难以实现的缺陷,该算法中改进观测矩阵的设计可实现且与稀疏变换基相关性较低,进而使得算法的重构性能较高,从而降低了定位的误差.仿真结果表明,与现有的一些方法相比,所提算法在保证较低的计算复杂度的情况下更加充分地利用了网络节点,有效提高了定位精度,同时具有较强的鲁棒性. 相似文献
16.
Ataul Bari Arunita Jaekel Subir Bandyopadhyay 《Wireless Communications and Mobile Computing》2009,9(7):920-937
In hierarchical sensor networks using relay nodes, sensor nodes are arranged in clusters and higher powered relay nodes can be used as cluster heads. The lifetime of such a network is determined primarily by the lifetime of the relay nodes. In this paper, we propose two new integer linear programs (ILPs) formulations for optimal data gathering, which maximize the lifetime of the upper tier relay node network. Unlike most previous approaches considered in the literature, our formulations can generate optimal solutions under the non‐flow‐splitting model. Experimental results demonstrate that our approach can significantly extend network lifetime, compared to traditional routing schemes, for the non‐flow‐splitting model. The lifetime can be further enhanced by periodic updates of the routing strategy based on the residual energy at each relay node. The proposed rescheduling scheme can be used to handle single or multiple relay node failures. We have also presented a very simple and straightforward algorithm for the placement of relay nodes. The placement algorithm guarantees that all the sensor nodes can communicate with at least one relay node and that the relay node network is at least 2‐connected. This means that failure of a single relay node will not disconnect the network, and data may be routed around the failed node. The worst case performance of the placement algorithm is bounded by a constant with respect to any optimum placement algorithm. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
17.
In this paper, a clustering algorithm is proposed based on the high correlation among the overlapped field of views for the wireless multimedia sensor networks. Firstly, by calculating the area of the overlapped field of views (FoVs) based on the gird method, node correlations have been obtained. Then, the algorithm utilizes the node correlations to partition the network region in which there are high correlation multimedia sensor nodes. Meanwhile, in order to minimize the energy consumption for transmitting images, the strategy of the cluster heads election is proposed based on the cost estimation, which consists of signal strength and residual energy as well as the node correlation. Simulation results show that the proposed algorithm can balance the energy consumption and extend the network lifetime effectively. 相似文献
18.
面向认知无线电网络中能量高效协作感知任务需求,提出了面向单次协作感知过程的能量最小化节点选择问题EMNS和面向在线协作感知的能量高效节点选择问题OENS。证明了两问题均为NP-hard难题。针对EMNS问题,提出采用分枝定界算法BAB求最优解和贪婪节点选择算法GS求近似解。针对OENS问题,提出为每个节点引入考虑能量消耗负载均衡的动态权重系数,基于BAB和GS算法设计了启发式的在线节点选择算法OBAB、OGS1。仿真实验结果表明,提出的算法可显著增加网络完成的协作感知过程次数,可有效延长网络"生存期"。 相似文献
19.
为了有效延长无线传感器网络的生存时间,针对传感器节点能耗不均衡难题,提出一种改进遗传算法优化的无线传感器网络路由算法。首先对LEACH算法不足进行分析,然后构建簇头节点选择的目标函数,并将其作为遗传算法的搜索目标,最后通过遗传算法找到下一时刻簇头的候选节点,并针对遗传算法不足进行相应改进。采用仿真实验对算法的性能进行分析,结果表明,相对于其它无线传感器路由算法,本文算法可以保证无线传感器的节点能量均衡,延长了网络的生存时间。 相似文献