共查询到20条相似文献,搜索用时 15 毫秒
1.
We consider the problem of guiding mobile agents to visit a subset of sensor nodes called event nodes in wireless sensor networks without location information, where the set of event nodes is not known in advance. As the set of event nodes changes over time, a path needs to be updated on-line. We propose a novel distributed algorithm to construct and update such a dynamic path to visit a set of event nodes. To the best of our knowledge, this is the first work to solve this problem using a distributed algorithm without any location information. Our approach is to maintain the Voronoi diagram of the dynamic set of event nodes implicitly in sensor networks. Doing so, we overcome the lack of location information and implement scalable distributed dynamic navigation. For computing an optimal path is NP-Hard, we prove that the ratio of the length of the constructed path by our algorithm to that of the optimal path is bounded by O(log k), where k is the number of event nodes, under a reasonable assumption. Our approach can be used to compute both an event visiting tour which requires to return to a starting point and an event visiting path which does not return to a starting point. We also extend our method to navigate multiple agents so that they collectively visit a set of event nodes. 相似文献
2.
Wireless Networks - Localization is one of the most important challenges of wireless sensor networks because the location information is typically used in other domains such as coverage,... 相似文献
3.
Wireless Networks - Recent trends of using wireless sensor network in various applications have reduced the significance of human intervention greatly. Due to the cost efficiency and energy... 相似文献
4.
Data mules are extensively used for data collection in wireless sensor networks (WSNs), which significantly reduces energy consumption at sensor nodes but increases the data delivery latency. In this paper, we focus on minimizing the length of the traveling path to reduce the data delivery latency. We first model the shortest path planning of a data mule as an optimization problem, and propose an optimal model and corresponding solving algorithm. The optimal model solution has high time complexity, mainly due to the parallel optimization of node visit arrangements and data access point (DAP) settings during the solution process, which is to obtain the shortest path result. In order to improve the computational efficiency, we next give the approximate model and its solving algorithm, which is mainly to decompose the path planning problem into the Traveling Salesman Problem (TSP) and nonlinear optimization problem, and optimize the two parts separately. The proposed approach is capable of expressing the influence of the communication range of each sensor node, which is suitable for more general application scenarios than the existing methods. Theoretical analysis and simulation results show that the solution has good performances in terms of path length and computational efforts. 相似文献
5.
As event detection is one of the main purposes of using wireless sensor networks (WSNs), the nodes location is essential to determine the location of that event when it occurs. Many localization models have been proposed in the literature. One of the solutions is to deploy a set of location-aware nodes, called anchors, to exchange information with the other nodes in order to help estimate their own location. Another promising proposal involves replacing these sets of anchors with only one mobile anchor. While this proposal seems to provide favorable results, it brings new challenges. The main challenge is to find an optimal path for the mobile anchor to follow while taking into account the need to provide highly accurate data and more localizable nodes in less time and with less energy. In this paper, we introduced a new static path planning model for mobile anchor-assisted localization in WSNs. Our proposed model guarantees that all nodes are able to receive the localization information, thus, estimate their own location with higher localization accuracy in comparison to similar static models. Moreover, this model overcomes the problem of collinearity and takes into account the metrics of precision and energy consumption as well as accuracy, localization ratio and the path length of the mobile anchor. 相似文献
6.
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper
bound of the transmission range, compute the minimum number of relay sensors such that the induced topology by all sensors
is globally connected. This problem is motivated by practically considering the tradeoff among performance, lifetime, and
cost when designing sensor networks. In our study, this problem is modelled by a NP-hard network optimization problem named
Steiner Minimum Tree with Minimum number of Steiner Points and bounded edge length (SMT-MSP). In this paper, we propose two approximate algorithms, and conduct detailed performance analysis. The first algorithm has
a performance ratio of 3 and the second has a performance ratio of 2.5.
Xiuzhen Cheng is an Assistant Professor in the Department of Computer Science at the George Washington University. She received her MS
and PhD degrees in Computer Science from the University of Minnesota - Twin Cities in 2000 and 2002, respectively. Her current
research interests include Wireless and Mobile Computing, Sensor Networks, Wireless Security, Statistical Pattern Recognition,
Approximation Algorithm Design and Analysis, and Computational Medicine. She is an editor for the International Journal on
Ad Hoc and Ubiquitous Computing and the International Journal of Sensor Networks. Dr. Cheng is a member of IEEE and ACM. She
received the National Science Foundation CAREER Award in 2004.
Ding-Zhu Du received his M.S. degree in 1982 from Institute of Applied Mathematics, Chinese Academy of Sciences, and his Ph.D. degree
in 1985 from the University of California at Santa Barbara. He worked at Mathematical Sciences Research Institutea, Berkeley
in 1985-86, at MIT in 1986-87, and at Princeton University in 1990-91. He was an associate-professor/professor at Department
of Computer Science and Engineering, University of Minnesota in 1991-2005, a professor at City University of Hong Kong in
1998-1999, a research professor at Institute of Applied Mathematics, Chinese Academy of Sciences in 1987-2002, and a Program
Director at National Science Foundation of USA in 2002-2005. Currently, he is a professor at Department of Computer Science,
University of Texas at Dallas and the Dean of Science at Xi’an Jiaotong University. His research interests include design
and analysis of algorithms for combinatorial optimization problems in communication networks and bioinformatics. He has published
more than 140 journal papers and 10 written books. He is the editor-in-chief of Journal of Combinatorial Optimization and
book series on Network Theory and Applications. He is also in editorial boards of more than 15 journals.
Lusheng Wang received his PhD degree from McMaster University in 1995. He is an associate professor at City University of Hong Kong. His
research interests include networks, algorithms and Bioinformatics. He is a member of IEEE and IEEE Computer Society.
Baogang Xu received his PhD degree from Shandong University in 1997. He is a professor at Nanjing Normal University. His research interests
include graph theory and algorithms on graphs. 相似文献
7.
Recent advances in electronics and wireless communication technologies have enabled the development of large-scale wireless sensor networks that consist of many low-power, low-cost, and small-size sensor nodes. Sensor networks hold the promise of facilitating large-scale and real-time data processing in complex environments. Security is critical for many sensor network applications, such as military target tracking and security monitoring. To provide security and privacy to small sensor nodes is challenging, due to the limited capabilities of sensor nodes in terms of computation, communication, memory/storage, and energy supply. In this article we survey the state of the art in research on sensor network security. 相似文献
8.
In scenarios where sensors are placed randomly, redundant deployment is essential for ensuring adequate field coverage. This redundancy needs to be efficiently exploited by periodically selecting a subset of nodes (referred to as a “cover”) that actively monitor the field, and putting the remaining nodes to sleep. We consider networks in which sensors are not aware of their locations or the relative directions of their neighbors. We develop several geometric and density-based tests that enable a location-unaware sensor to intelligently determine whether it should turn itself off without degrading the quality of field coverage. These tests rely on distance measurements and exchanged two-hop neighborhood information. We design an algorithm (LUC) that exploits these tests for computing covers. Based on this algorithm, we propose two distributed protocols (LUC-I and LUC-P) that periodically select covers and switch between them so as to extend the network lifetime and tolerate unexpected failures. Our protocols are highly efficient in terms of message overhead and processing complexity. We implement LUC-I in TinyOS and evaluate it using the TOSSIM simulator. Experimental results indicate that our approach significantly prolongs the network lifetime and achieves comparable performance to location-aware protocols. 相似文献
9.
Anomaly detection in wireless sensor networks is an important challenge for tasks such as fault diagnosis, intrusion detection, and monitoring applications. The algorithms developed for anomaly detection have to consider the inherent limitations of sensor networks in their design so that the energy consumption in sensor nodes is minimized and the lifetime of the network is maximized. In this survey article we analyze the state of the art in anomaly detection techniques for wireless sensor networks and discuss some open issues for research. 相似文献
10.
This paper discusses nonparametric distributed learning. After reviewing the classical learning model and highlighting the success of machine learning in centralized settings, the challenges that wireless sensor networks (WSN) pose for distributed learning are discussed, and research aimed at addressing these challenges is surveyed. 相似文献
11.
Since energy is scarce in sensor nodes, wireless sensor networks aim to transmit as few packets as possible. To achieve this goal, sensor protocols often aggregate measured data from multiple sensor nodes into a single packet. In this paper, a survey of aggregation techniques and methods is given. Based on this survey, it is concluded that there are currently several dependencies between the aggregation method and the behavior of the other network layers. As a result, existing aggregation methods can often not be combined with different routing protocols. To remedy this shortcoming, the paper introduces a new ‘non-intrusive’ aggregation approach which is independent of the routing protocol. The proposed aggregation method is evaluated and compared to traditional aggregation approaches using a large-scale sensor testbed of 200 TMoteSky sensor nodes. Our experimental results indicate that existing aggregation approaches are only suited for a limited set of network scenarios. In addition, it is shown both mathematically and experimentally that our approach outperforms existing non-intrusive techniques in a wide range of scenarios. 相似文献
13.
The technological advances in Micro ElectroMechanical Systems ( Mems) and wireless communications have enabled the realization of wireless sensor networks ( Wsn) comprised of large number of low-cost, low-power, multifunctional sensor nodes. These tiny sensor nodes communicate in short distances and collaboratively work toward fulfilling the application specific objectives of Wsn. However, realization of wide range of envisioned Wsn applications necessitates effective communication protocols which can address the unique challenges posed by the Wsn paradigm. Since many of these envisioned applications may also involve in collecting information in the form of multimedia such as audio, image, and video; additional challenges due to the unique requirements of multimedia delivery over Wsn, e.g., diverse reliability requirements, time constraints, high bandwidth demands, must be addressed as well. Thus far, vast majority of the research efforts has been focused on addressing the problems of conventional data communication in Wsn. Therefore, there exists an urgent need for research on the problems of multimedia communication in Wsn. In this paper, a survey of the research challenges and the current status of the literature on the multimedia communication in Wsn is presented. More specifically, the multimedia Wsn applications, factors influencing multimedia delivery over Wsn, currently proposed solutions in application, transport, and network layers, are pointed out along with their shortcomings and open research issues. 相似文献
14.
Wireless sensor networks (WSNs) have gradually emerged as one of the key growth areas for pervasive computing in the twenty-first century. Recent advances in WSN technologies have made possible the development of new wireless monitoring and environmental control applications. However, the nature of these applications and harsh environments also created significant challenges for sensor networks to maintain a high quality of service in potentially harsh environments. Therefore, efficient fault management and robust management architectures have become essential for WSNs. In this article, we address these challenges by surveying existing fault management approaches for WSNs. We divide the fault management process into three phases: fault detection, diagnosis, and recovery and classify existing approaches according to these phases. Finally, we outline future challenges for fault management in WSNs. 相似文献
15.
The operation principles of wireless body-area networks (WBANs) and requirements to their infrastructure are described. The new IEEE 802.15.6 WBAN standard, in which an ultrawideband (UWB) signal is used as an information carrier, is discussed. The general properties of the given standard and its distinctions from the existing wireless personal communications standards are analyzed. It is demonstrated that UWB direct chaotic transceivers are promising for use in the wireless sensor networks based on the new standard. 相似文献
16.
在信息化时代,信息的接收、处理及分析对用户而言至关重要。特别是信息的接收环节,若收集到的信息不全、有误或者接收不到,后续工作都将无法开展。无线传感器是专门用于接收信息的一类工具,通过网络操作,使人们收集到自己想要的信息。无线传感器网络节点的特点是智能化、功率损耗小、能接收大量信息,传感器的工作运行离不开网络。文章对无线传感器目前的发展现状、技术特点以及应用前景等方面进行了阐述。 相似文献
17.
In the recent years, the use of mobile sink has drawn enormous attention for data collection in wireless sensor networks (WSNs). Mobile sink is well known for solving hotspot or sinkhole problem. However, the design of an efficient path for mobile sink has tremendous impact on network lifetime and coverage in data collection process of WSNs. This is particularly an important issue for many critical applications of WSNs where data collection requires to be carried out in delay bound manner. In this paper, we propose a novel scheme for delay efficient trajectory design of a mobile sink in a cluster based WSN so that it can be used for critical applications without compromising the complete coverage of the target area. Given a set of gateways (cluster heads), our scheme determines a set of rendezvous points for designing path of the mobile sink for critical applications. The scheme is based on the Voronoi diagram. We also propose an efficient method for recovery of the orphan sensor nodes generated due to the failure of one or more cluster heads during data collection. We perform extensive simulations over the proposed algorithm and compare its results with existing algorithms to demonstrate the efficiency of the proposed algorithm in terms of network lifetime, path length, average waiting time, fault tolerance and adaptability etc. For the fault tolerance, we simulate the schemes using Weibull distribution and analyze their performances. 相似文献
18.
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). 相似文献
19.
Wireless Networks - Although many applications use battery-powered sensor nodes, in some applications battery- and mains-powered nodes coexist. In this paper, we present a distributed algorithm... 相似文献
20.
Fault-tolerance and data fusion have been considered as two fundamental functions in wireless sensor networks. In this paper, we propose a novel approach for distributed multiclass classification using a fault-tolerant fusion rule for wireless sensor networks. Binary decisions from local sensors, possibly in the presence of faults, are forwarded to the fusion center that determines the final classification result. Classification fusion in our approach is implemented via error correcting codes to incorporate fault-tolerance capability. This new approach not only provides an improved fault-tolerance capability but also reduces computation time and memory requirements at the fusion center. Code matrix design is essential for the design of such systems. Two efficient code matrix design algorithms are proposed in this paper. The relative merits of both algorithms are also studied. We also develop sufficient conditions for asymptotic detection of the correct hypothesis by the proposed approach. Performance evaluation of the proposed approach in the presence of faults is provided. These results show significant improvement in fault-tolerance capability as compared with conventional parallel fusion networks. 相似文献
|