共查询到20条相似文献,搜索用时 15 毫秒
1.
Monte Carlo localization for mobile wireless sensor networks 总被引:5,自引:0,他引:5
Localization is crucial to many applications in wireless sensor networks. In this article, we propose a range-free anchor-based localization algorithm for mobile wireless sensor networks that builds upon the Monte Carlo localization algorithm. We concentrate on improving the localization accuracy and efficiency by making better use of the information a sensor node gathers and by drawing the necessary location samples faster. To do so, we constrain the area from which samples are drawn by building a box that covers the region where anchors’ radio ranges overlap. This box is the region of the deployment area where the sensor node is localized. Simulation results show that localization accuracy is improved by a minimum of 4% and by a maximum of 73% (average 30%), for varying node speeds when considering nodes with knowledge of at least three anchors. The coverage is also strongly affected by speed and its improvement ranges from 3% to 55% (average 22%). Finally, the processing time is reduced by 93% for a similar localization accuracy. 相似文献
2.
Sun Guolin Guo Wei 《电子科学学刊(英文版)》2006,23(3):413-416
This paper studies the relationship between mobility, navigation and localization in the context of wireless sensor networks with mobile beacons. It is observed that mobility can aid in network node localization and that once localized, the network nodes can localize and track a mobile object and guide its navigation. A distributed kernel-based algorithm is proposed that enables the nodes to establish confident position estimates in the presence of ranging inaccuracies. The proposed approach features robustness with respect to range measurement inaccuracies, low complexity and distributed implementation, using only local information. Simulation validates our approach viable. 相似文献
3.
Abidalrahman Moh’d Nauman Aslam William Phillips William Robertson 《Ad hoc Networks》2013,11(8):2588-2604
This paper presents a novel link-layer encryption protocol for wireless sensor networks. The protocol design aims to reduce energy consumption by reducing security related communication overhead. This is done by merging security related data of consecutive packets. The merging (or combining packets) based on simple mathematical operations helps to reduce energy consumption by eliminating the requirement to send security related fields in headers and trailers. We name our protocol as the Compact Security Protocol referred to as C-Sec. In addition to energy savings, the C-Sec protocol also includes a unique security feature of hiding the packet header information. This feature makes it more difficult to trace the flow of wireless communication, and helps to minimize the cost of defending against replay attacks. We performed rigorous testing of the C-Sec protocol and compared it with well-known protocols including TinySec, MiniSec, SNEP and Zigbee. Our performance evaluation demonstrates that the C-Sec protocol outperforms other protocols in terms of energy savings. We also evaluated our protocol with respect to other performance metrics including queuing delay and error probability. 相似文献
4.
《Digital Communications & Networks》2016,2(1):1-14
The US Department of Defense (DoD) routinely uses wireless sensor networks (WSNs) for military tactical communications. Sensor node die-out has a significant impact on the topology of a tactical WSN. This is problematic for military applications where situational data is critical to tactical decision making. To increase the amount of time all sensor nodes remain active within the network and to control the network topology tactically, energy efficient routing mechanisms must be employed. In this paper, we aim to provide realistic insights on the practical advantages and disadvantages of using established routing techniques for tactical WSNs. We investigate the following established routing algorithms: direct routing, minimum transmission energy (MTE), Low Energy Adaptive Cluster Head routing (LEACH), and zone clustering. Based on the node die out statistics observed with these algorithms and the topological impact the node die outs have on the network, we develop a novel, energy efficient zone clustering algorithm called EZone. Via extensive simulations using MATLAB, we analyze the effectiveness of these algorithms on network performance for single and multiple gateway scenarios and show that the EZone algorithm tactically controls the topology of the network, thereby maintaining significant service area coverage when compared to the other routing algorithms. 相似文献
5.
Yuan ZhangAuthor Vitae Shutang LiuAuthor VitaeXiuyang ZhaoAuthor Vitae Zhongtian JiaAuthor Vitae 《Ad hoc Networks》2012,10(3):623-634
Node self-localization has become an essential requirement for realistic applications over wireless sensor networks (WSNs). Although many distributed localization algorithms have been proposed, fundamental theoretic analysis of unique localization is still in its early stage of development. This paper aims at a synthetic and homogeneous survey of the theoretical basis on WSN localization problem carried out thus far. Specifically, subsequent to establishing a technological context of relevant terms, we construct a graph and then a formation for each WSN to present current state-of-the-art by analyzing possible conditions for unique localization, as well as corresponding verification algorithms, by drawing on the powerful results from rigidity theory, distance geometry, geometric constraints in CAD, and combinatorial theory. We show that the unique localization problem is well understood in two-dimension, however, only partial analogous results are available in three-dimension. 相似文献
6.
Youngbae Kong Younggoo Kwon Jeungwon Choi Jonghwan Ko Gwitae Park 《AEUE-International Journal of Electronics and Communications》2012,66(12):1026-1031
In wireless sensor networks (WSNs), irregularly deployed nodes can significantly degrade the performance of the localization system. In this paper, we propose a novel localization scheme for the irregularly deployed WSNs. The basic approach is to control the transmission of location messages by using the fuzzy c-means (FCM) clustering algorithm. Next, each node selects its localization method according to the node density. Simulation studies show that the proposed approach can enhance the localization accuracy, while reducing the retransmission messages in the irregularly deployed WSNs. 相似文献
7.
A precise localization for mobile target in wireless sensor networks is presented in this letter,where a geometrical relationship is explored to improve the location estimation for mobile target,instead of a simple centroid approach.The equations of location compensation algorithm for mobile target are derived based on linear trajectory prediction and sensor selective activation.The results based on extensive simulation experiments show that the compensation algorithm gets better performance in metrics of quality of tracking and energy efficiency with the change of sensor sensing range,the ratio of sensing range and sensor activation range,and the data sampling rate than traditional methods,which means our proposing can achieve better quality-energy tradeoff for mobile target in wireless sensor networks. 相似文献
8.
The conventional clustering method has the unique potential to be the framework for power-conserving ad hoc networks. In this environment, studies on energy-efficient strategies such as sleeping mode and redirection have been reported, and recently some have even been adopted by some standards like Bluetooth and IEEE 802.11. However, consider wireless sensor networks. The devices employed are power-limited in nature, introducing the conventional clustering approach to the sensor networks provides a unique challenge due to the fact that cluster-heads, which are communication centers by default, tend to be heavily utilized and thus drained of their battery power rapidly. In this paper, we introduce a re-clustering strategy and a redirection scheme for cluster-based wireless sensor networks in order to address the power-conserving issues in such networks, while maintaining the merits of a clustering approach. Based on a practical energy model, simulation results show that the improved clustering method can obtain a longer lifetime when compared with the conventional clustering method. 相似文献
9.
In this paper we focus on the problems of high latency and low throughput arising from the periodic operation of MAC protocols for wireless sensor networks. In order to meet both design criteria we propose an energy-efficient, low delay, fast-periodic MAC algorithm, namely FP-MAC, that is exclusively designed for 802.15.4-like networks utilizing in full the standard’s physical layer. Our proposal relies on the short periodic communication operation of the nodes comprising the WSN. This is achieved by decreasing the actions that a node needs to perform at the start of every communication period and by incorporating a variable radio-on operation. Moreover, the algorithm introduces differences in nodes’ scheduling to further reduce delay. Local synchronization and the crucial task of determining the proper timing for transmission and reception of data is achieved through the periodic broadcast of special synchronization frames at the beginning of each on-period. FP-MAC is evaluated and compared to S-MAC and T-MAC through extensive simulations, showing a significant improvement in terms of low energy consumption and average MAC delay. 相似文献
10.
11.
12.
13.
14.
《AEUE-International Journal of Electronics and Communications》2014,68(7):578-580
Indoor localization systems are becoming very popular because they enable the creation of very interesting location-based applications. This paper provides a short introduction about localization systems based on a sensor network and the actual state of the art. Important topics related to indoor localization like the necessary infrastructure, available technologies and their expected accuracy are treated. Additionally, the results of previous work referred to the performance evaluation of localization algorithms are shortly described. Finally, some ideas related to further investigations are presented. 相似文献
15.
Secure probabilistic location verification in randomly deployed wireless sensor networks 总被引:2,自引:0,他引:2
Security plays an important role in the ability to deploy and retrieve trustworthy data from a wireless sensor network. Location verification is an effective defense against attacks which take advantage of a lack, or compromise, of location information. In this work, a secure probabilistic location verification method for randomly deployed dense sensor networks is proposed. The proposed Probabilistic Location Verification (PLV) algorithm leverages the probabilistic dependence of the number of hops a broadcast packet traverses to reach a destination and the Euclidean distance between the source and the destination. A small number of verifier nodes are used to determine the plausibility of the claimed location, which is represented by a real number between zero and one. Using the calculated plausibility metric, it is possible to create arbitrary number of trust levels in the location claimed. Simulation studies verify that the proposed solution provides high performance in face of various types of attacks. 相似文献
16.
Energy balanced data propagation in wireless sensor networks 总被引:1,自引:0,他引:1
We study the problem of energy-balanced data propagation in wireless sensor networks. The energy balance property guarantees that the average per sensor energy dissipation
is the same for all sensors in the network, during the entire execution of the data propagation protocol. This property is
important since it prolongs the network’:s lifetime by avoiding early energy depletion of sensors.
We propose a new algorithm that in each step decides whether to propagate data one-hop towards the final destination (the sink), or to send data directly
to the sink. This randomized choice balances the (cheap) one-hop transimssions with the direct transimissions to the sink,
which are more expensive but “bypass” the sensors lying close to the sink. Note that, in most protocols, these close to the sink sensors tend to be overused and die out early.
By a detailed analysis we precisely estimate the probabilities for each propagation choice in order to guarantee energy balance. The needed estimation can easily be performed
by current sensors using simple to obtain information. Under some assumptions, we also derive a closed form for these probabilities.
The fact (shown by our analysis) that direct (expensive) transmissions to the sink are needed only rarely, shows that our
protocol, besides energy-balanced, is also energy efficient.
This work has been partially supported by the IST/FET/GC Programme of the European Union under contract numbers IST-2001-33135
(CRESCCO) and 6FP 001907 (DELIS). A perliminary version of the work appeared in WMAN 2004 [11].
Charilaos Efthymiou graduated form the Computer Engineering and Informatics Department (CEID) of the University of Patras, Greece. He received
his MSc from the same department with advisor in S. Nikoletseas. He currently continuous his Ph.D studies in CEID with advisor
L. Kirousis. His research interest include Probabilistic Techniques and Random Graphs, Randomized Algorithms in Computationally
Hard Problems, Stochastic Processes and its Applications to Computer Science.
Dr. Sotiris Nikoletseas is currently a Senior Researcher and Managing Director of Research Unit 1 (“Foundations of Computer Science, Relevant Technologies
and Applications”) at the Computer Technology Institute (CTI), Patras, Greece and also a Lecturer at the Computer Engineering
and Informatics Department of Patras University, Greece. His research interests include Probabilistic Techniques and Random
Graphs, Average Case Analysis of Graph Algorithms and Randomized Algorithms, Fundamental Issues in Parallel and Distributed
Computing, Approximate Solutions to Computationally Hard Problems. He has published scientific articles in major international
conferences and journals and has co-authored (with Paul Spirakis) a book on Probabilistic Techniques. He has been invited
speaker in important international scientific events and Universities. He has been a referee for the Theoretical Computer
Science (TCS) Journal and important international conferences (ESA, ICALP). He has participated in many EU funded R&D projects
(ESPRIT/ALCOM-IT, ESPRIT/GEPPCOM). He currently participates in 6 Fifth Framework projects: ALCOM-FT, ASPIS, UNIVERSAL, EICSTES
(IST), ARACNE, AMORE (IMPROVING).
Jose Rolim is Full Professor at the Department
of Computer Science of the University of Geneva where he leads the Theoretical Computer Science and Sensor Lab (TCSensor Lab).
He received his Ph.D. degree in Computer Science at the University of California, Los Angeles working together with Prof.
S. Greibach. He has published several articles on the areas of distributed systems, randomization and computational complexity
and leads two major projects on the area of Power Aware Computing and Games and Complexity, financed by the Swiss National
Science Foundation. Prof. Rolim participates in the editorial board of several journals and conferences and he is the Steering
Committee Chair and General Chair of the IEEE Distributed Computing Conference in Sensor Systems. 相似文献
17.
Energy aware efficient geographic routing in lossy wireless sensor networks with environmental energy supply 总被引:2,自引:0,他引:2
Wireless sensor networks are characterized by multihop wireless lossy links and resource constrained nodes. Energy efficiency
is a major concern in such networks. In this paper, we study Geographic Routing with Environmental Energy Supply (GREES) and
propose two protocols, GREES-L and GREES-M, which combine geographic routing and energy efficient routing techniques and take
into account the realistic lossy wireless channel condition and the renewal capability of environmental energy supply when
making routing decisions. Simulation results show that GREESs are more energy efficient than the corresponding residual energy
based protocols and geographic routing protocols without energy awareness. GREESs can maintain higher mean residual energy
on nodes, and achieve better load balancing in terms of having smaller standard deviation of residual energy on nodes. Both
GREES-L and GREES-M exhibit graceful degradation on end-to-end delay, but do not compromise the end-to-end throughput performance.
Kai Zeng received his B.E. degree in Communication Engineering and M.E. degree in Communication and Information System both from Huazhong
University of Science and Technology, China, in 2001 and 2004, respectively. He is currently a Ph.D. student in the Electrical
and Computer Engineering department at Worcester Polytechnic Institute. His research interests are in the areas of wireless
ad hoc and sensor networks with emphases on energy-efficient protocol, cross-layer design, routing, and network security.
Kui Ren received his B. Eng. and M. Eng. both from Zhejiang University, China, in 1998 and 2001, respectively. He worked as a research
assistant at Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences from March 2001 to
January 2003, at Institute for Infocomm Research, Singapore from January 2003 to August 2003, and at Information and Communications
University, South Korea from September 2003 to June 2004. Currently he is a PhD candidate in the ECE department at Worcester
Polytechnic Institute. His research interests include ad hoc/sensor network security, wireless mesh network security, Internet
security, and security and privacy in ubiquitous computing environments.
Wenjing Lou is an assistant professor in the Electrical and Computer Engineering department at Worcester Polytechnic Institute. She obtained
her Ph.D. degree in Electrical and Computer Engineering from University of Florida in 2003. She received the M.A.Sc. degree
from Nanyang Technological University, Singapore, in 1998, the M.E. degree and the B.E. degree in Computer Science and Engineering
from Xi’an Jiaotong University, China, in 1996 and 1993 respectively. From December 1997 to July 1999, she worked as a Research
Engineer in Network Technology Research Center, Nanyang Technological University. Her current research interests are in the
areas of ad hoc and sensor networks, with emphases on network and system security and routing.
Patrick J. Moran received his MSEE from Carnegie Mellon University, 1993. He is currently the CTO and Founder of AirSprite Technologies Inc,
and is driving the company to utilize advanced networking protocols for low-power wireless network systems. His interests
include architecture, protocols and high performance implementation of emerging communication technologies. Patrick has been
involved in deployment of communication and signal processing technologies since graduating from the University of Minn. in
1986. He holds several patents and publications relating to storage, medical and data processing information systems. He is
a member of the IEEE. 相似文献
18.
19.
Stefano Basagni Alessio Carosi Emanuel Melachrinoudis Chiara Petrioli Z. Maria Wang 《Wireless Networks》2008,14(6):831-858
This paper demonstrates the advantages of using controlled mobility in wireless sensor networks (WSNs) for increasing their
lifetime, i.e., the period of time the network is able to provide its intended functionalities. More specifically, for WSNs
that comprise a large number of statically placed sensor nodes transmitting data to a collection point (the sink), we show
that by controlling the sink movements we can obtain remarkable lifetime improvements. In order to determine sink movements,
we first define a Mixed Integer Linear Programming (MILP) analytical model whose solution determines those sink routes that
maximize network lifetime. Our contribution expands further by defining the first heuristics for controlled sink movements
that are fully distributed and localized. Our Greedy Maximum Residual Energy (GMRE) heuristic moves the sink from its current location to a new site as if drawn toward the area where nodes have the
highest residual energy. We also introduce a simple distributed mobility scheme (Random Movement or RM) according to which the sink moves uncontrolled and randomly throughout the network. The different mobility schemes
are compared through extensive ns2-based simulations in networks with different nodes deployment, data routing protocols,
and constraints on the sink movements. In all considered scenarios, we observe that moving the sink always increases network
lifetime. In particular, our experiments show that controlling the mobility of the sink leads to remarkable improvements,
which are as high as sixfold compared to having the sink statically (and optimally) placed, and as high as twofold compared
to uncontrolled mobility.
Stefano Basagni holds a Ph.D. in electrical engineering from the University of Texas at Dallas (December 2001) and a Ph.D. in computer science
from the University of Milano, Italy (May 1998). He received his B.Sc. degree in computer science from the University of Pisa,
Italy, in 1991. Since Winter 2002 he is on faculty at the Department of Electrical and Computer Engineering at Northeastern
University, in Boston, MA. From August 2000 to January 2002 he was professor of computer science at the Department of Computer
Science of the Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas.
Dr. Basagni’s current research interests concern research and implementation aspects of mobile networks and wireless communications
systems, Bluetooth and sensor networking, definition and performance evaluation of network protocols and theoretical and practical
aspects of distributed algorithms.
Dr. Basagni has published over four dozens of referred technical papers and book chapters. He is also co-editor of two books.
Dr. Basagni served as a guest editor of the special issue of the Journal on Special Topics in Mobile Networking and Applications
(MONET) on Multipoint Communication in Wireless Mobile Networks, of the special issue on mobile ad hoc networks of the Wiley’s
Interscience’s Wireless Communications & Mobile Networks journal, and of the Elsevier’s journal Algorithmica on algorithmic
aspects of mobile computing and communications.
Dr. Basagni serves as a member of the editorial board and of the technical program committee of ACM and IEEE journals and
international conferences. He is a senior member of the ACM (including the ACM SIGMOBILE), senior member of the IEEE (Computer
and Communication societies), and member of ASEE (American Society for Engineering Education).
Alessio Carosi received the M.S. degree “summa cum laude” in Computer Science in 2004 from Rome University “La Sapienza.” He is currently
a Ph.D. candidate in Computer Science at Rome University “La Sapienza.” His research interests include protocols for ad hoc
and sensor networks, underwater systems and delay tolerant networking.
Emanuel Melachrinoudis received the Ph.D. degree in industrial engineering and operations research from the University of Massachusetts, Amherst,
MA. He is currently the Director of Industrial Engineering and Associate Chairman of the Department of Mechanical and Industrial
Engineering at Northeastern University, Boston, MA. His research interests are in the areas of network optimization and multiple
criteria optimization with applications to telecommunication networks, distribution networks, location and routing. He is
a member of the Editorial Board of the International Journal of Operational Research. He has published in journals such as
Management Science, Transportation Science, Networks, European Journal of Operational Research, Naval Research Logistics and
IIE Transactions.
Chiara Petrioli received the Laurea degree “summa cum laude” in computer science in 1993, and the Ph.D. degree in computer engineering in
1998, both from Rome University “La Sapienza,” Italy. She is currently Associate Professor with the Computer Science Department
at Rome University “La Sapienza.” Her current work focuses on ad hoc and sensor networks, Delay Tolerant Networks, Personal
Area Networks, Energy-conserving protocols, QoS in IP networks and Content Delivery Networks where she contributed around
sixty papers published in prominent international journals and conferences. Prior to Rome University she was research associate
at Politecnico di Milano and was working with the Italian Space agency (ASI) and Alenia Spazio. Dr. Petrioli was guest editor
of the special issue on “Energy-conserving protocols in wireless Networks” of the ACM/Kluwer Journal on Special Topics in
Mobile Networking and Applications (ACM MONET) and is associate editor of IEEE Transactions on Vehicular Technology, the ACM/Kluwer
Wireless Networks journal, the Wiley InterScience Wireless Communications & Mobile Computing journal and the Elsevier Ad Hoc
Networks journal. She has served in the organizing committee and technical program committee of several leading conferences
in the area of networking and mobile computing including ACM Mobicom, ACM Mobihoc, IEEE ICC,IEEE Globecom. She is member of
the steering committee of ACM Sensys and of the international conference on Mobile and Ubiquitous Systems: Networking and
Services (Mobiquitous) and serves as member of the ACM SIGMOBILE executive committee. Dr. Petrioli was a Fulbright scholar.
She is a senior member of IEEE and a member of ACM.
Z. Maria Wang received her Bachelor degree in Electrical Engineering with the highest honor from Beijing Institute of Light Industry in
China, her M.S. degree in Industrial Engineering/Operations Research from Dalhousie University, Canada and her Ph.D. in Industrial
Engineering/Operations Research from Northeastern University, Boston. She served as a R&D Analyst for General Dynamics. Currently
MS. Wang serves as an Optimization Analyst with Nomis Solutions, Inc. 相似文献
20.
Security and accuracy are two issues in the localization of wireless sensor networks (WSNs) that are difficult to balance in hostile indoor environments. Massive numbers of malicious positioning requests may cause the functional failure of an entire WSN. To eliminate the misjudgments caused by malicious nodes, we propose a compressive‐sensing–based multiregional secure localization (CSMR_SL) algorithm to reduce the impact of malicious users on secure positioning by considering the resource‐constrained nature of WSNs. In CSMR_SL, a multiregion offline mechanism is introduced to identify malicious nodes and a preprocessing procedure is adopted to weight and balance the contributions of anchor nodes. Simulation results show that CSMR_SL may significantly improve robustness against attacks and reduce the influence of indoor environments while maintaining sufficient accuracy levels. 相似文献