1,720,961 research outputs found
DAIM: A distributed algorithm for isolating malfunctioning nodes in wireless sensor networks
No full textIt has been identified that as complexity of computing and communication devices increases, fault-tolerance will gain more and more importance. Wireless sensor networks (WSNs) are exceptionally complex distributed systems where a variety of components interact in a complex way and should therefore help narrow down failures and diagnose their causes, as much as possible, with minimal physical access and interactivity. In this paper, we present an algorithm for isolating malfunctioning nodes in WSNs and provide two parallel variants of it: Naïve and Greedy. The algorithm is based on the idea that a covered node can be turned off and that turning off a malfunctioning node causes the WSN to function properly. The experiments we conducted show that the Naïve Approach is very precise in locating malfunctioning nodes whereas the Greedy Approach is very fast in finding a cover free of such nodes. © 2011 Springer-Verlag Berlin Heidelberg
A position-based routing algorithm in 3D sensor networks
No full textAs large-scale sensor networks become more feasible, properties such as stateless nature and low maintenance overhead make position-based routing increasingly more attractive. Motivated by the fact that sensor networks would probably be deployed in a three-dimensional space, we present a novel 3D geographical routing (3DGR) algorithm that makes use of the position information to route packets from sources to destinations with high path quality and reliability. The locality and high scalability of this algorithm make it suitable for wireless sensor networks. It provides high adaptability to changes in topology and recovery of link failures which increases its reliability. We also incorporate battery-aware energy efficient schemes to increase the overall lifetime of the network. To reduce latency, a method of keeping a small record of recent paths is used. We also show that location errors will still result in good performance of our algorithm while the same assumptions might yield bad performance or even complete failures in other popular geographical routing algorithms. We evaluate the 3DGR protocol using simulation. Compared to other geographic routing algorithms, we find that 3DGR exhibits noticeably longer network lifetime, smaller path stretch, smaller end-to-end delay, and better packet delivery ratio. Copyright © 2010 John Wiley and Sons, Ltd.Akyildiz I. F., 2005, AD HOC NETW, V3, P257; [Anonymous], NASA JPL SENS WEBS P; Basagni S., 1998, 4 ANN ACM IEEE INT C, P76; Blazevic L, 2001, IEEE COMMUN MAG, V39, P166, DOI 10.1109-35.925685; Braginsky D., 2002, 1 ACM INT WORKSH WIR, P22, DOI 10.1145-570738.570742; Caruso A, 2005, IEEE INFOCOM SER, P150; Commuri S, 2006, INT J DISTRIB SENS N, V2, P333, DOI 10.1080-15501320600719151; Durocher S, 2008, ICDCN, P546; Flury Roland, 27 ANN IEEE C COMP C; Fonseca R, 2005, 2 S NETW SYST DES IM, P329; Funke S, 2007, IEEE INFOCOM SER, P1244, DOI 10.1109-INFCOM.2007.148; He T., 2003, 9 ANN INT C MOB COMP, P81, DOI DOI 10.1145-938994.938995]; Hong X, 2001, IEEE MIL COMM C MILC; Kao G. S.-C., 2005, P 17 CAN C COMP GEOM, P88; Karp B., 2000, 6 ANN INT C MOB COMP, P243; Kim Y., 2004, ACM SIGMOBILE MOBILE, V8, P48, DOI 10.1145-980159.980168; Kim Y-J, 2005, 2 S NETW SYST DES IM, P217; Kranakis E., 1999, 11 CAN C COMP GEOM, P51; Kuhn F, 2003, 4 ACM INT S MOB AD H; Li J., 2000, 6 ANN ACM IEEE INT C, P120; Liang B, 2006, USENIX S NETW SYST D; Ma C, 2006, MOBILE NETW APPL, V11, P757, DOI 10.1007-s11036-006-7800-2; Mauve M, 2001, IEEE NETWORK, V15, P30, DOI 10.1109-65.967595; Moscibroda T, 2004, ACM JOINT WORKSH FDN; Perkins C. E., 1994, SIGCOMM, P234; Perkins C. E., 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications, DOI 10.1109-MCSA.1999.749281; Ren Z, 2005, IEEE INT C MECH AUT, P2222; Rao R, 2003, COMPUTER, V36, P77, DOI 10.1109-MC.2003.1250886; Witt M, 2006, INT C WIR MOB COMM J, P7622
A hybrid security protocol for sensor networks
No full textSensor nodes used to transmit sensitive data, especially in military applications, require securing the data transmitted through the WSNs to maintain the confidentiality of the data and authenticate the participating sensor nodes. Since sensor nodes suffer from limited resources, in memory storage, computing power, energy capabilities and transmission rates, available network security protocols are inadequate. Symmetric algorithms cannot provide the same degree of security as public key algorithms, leading us to devise a new algorithm SHESP that uses public keys within the limitations of sensor nodes. This paper presents a way to utilise existing public key algorithms such as RSA, Diffie-Hellmann and elliptic curve in the field of WSN security by dividing the network into clusters. Our algorithm supplies data confidentiality, node authentication and data integrity while remaining within acceptable memory, time and energy constraints. We provide theoretical and experimental evidence to validate our algorithms. Results reveal significant improvement in data availability, data confidentiality and authenticity while reducing the communication and computation overhead. Copyright © 2009 Inderscience Enterprises Ltd.
A benchmarking tool for Wireless Sensor Network embedded operating systems
No full textThe emergence of the technology of Wireless Sensor Networks (WSNs) has lead to many changes in current and traditional computational techniques in order to adapt to their harsh and scarce requirements. A WSN consists of sensor nodes with wireless communication abilities that allow them to form a network. New system architectures have emerged to overcome sensor network limitations. Each architecture follows one of the two traditional design concepts, event-driven or thread-driven design. Although event-driven systems were assumed to generally perform better for embedded systems, tests have shown that event-driven systems tend to save more energy and space, while the thread-driven systems provide more concurrency and predictability, hence creating a tradeoff depending on the requirements of the application at hand. Performance analyzers are often used to accurately measure the performance of a certain system when such a tradeoff is evident. Performance analyzers can also locate deficiencies in a certain system for future improvements. The ever increasing complexity of applications executed by WSNs and the evolving nature of the underlying Embedded Operating Systems (EOSs) has led to the need for an accurate evaluation technique to guide practitioners in the field. This paper presents a novel approach towards providing a benchmarking and performance evaluation tool for comparing and analyzing the performance of WSN EOSs. © 2014 ACADEMY PUBLISHER
BARC: A Battery Aware Reliable Clustering algorithm for sensor networks
No full textClustering in wireless sensor networks (WSNs) provides scalability and robustness for the network; it allows spatial reuse of the bandwidth, simpler routing decisions, and results in decreased energy dissipation of the whole system by minimizing the number of nodes that take part in long distance communication. Clustering allows for data aggregation which reduces congestion and energy consumption. Recent study in battery technology reveals that batteries tend to discharge more power than needed and reimburse the over-discharged power if they are recovered. In this paper, we first provide an online mathematical battery model suitable for implementation in sensor networks. Using our battery model, we propose a new Battery Aware Reliable Clustering (BARC) algorithm for WSNs. BARC incorporates many features which are missing in many other clustering algorithms. It rotates cluster heads (CHs) according to a battery recovery scheme and it also incorporates a trust factor for selecting cluster heads thus increasing reliability. Most importantly, our proposed algorithm relaxes many of the rigid assumptions that the other algorithms impose such as the ability of the cluster head to communicate directly with the base station and having a fixed communication radius for intra-cluster communication. BARC uses Z-MAC which has several advantages over other MAC protocols. Simulation results show that using BARC prolongs the network lifetime greatly in comparison to other clustering techniques. © 2009 Elsevier Ltd. All rights reserved.Akyildiz IF, 2002, COMPUT NETW, V38, P393, DOI 10.1016-S1389-1286(01)00302-4; Bandyonpadhyay S., 2003, P IEEE INFOCOM 2003, P1713; Bandyopadhyay S, 2003, IEEE INFOCOM SER, P1713; Banerjee S., 2001, P IEEE INFOCOM APR; CERPA A, 2002, P IEEE INFOCOM NEW Y; Chatterjee M., 2002, Cluster Computing, V5, DOI 10.1023-A:1013941929408; Chiasserini CF, 2001, IEEE J SEL AREA COMM, V19, P1385, DOI 10.1109-49.932705; Chiasserini CF, 2001, IEEE J SEL AREA COMM, V19, P1235, DOI 10.1109-49.932692; Commuri S, 2006, INT J DISTRIB SENS N, V2, P333, DOI 10.1080-15501320600719151; GERLA M, 2000, P WCNC; GHOSH T, 2004, 29 ANN IEEE INT C NO, P224, DOI 10.1109-LCN.2004.36; Heinzelman WB, 2002, IEEE T WIREL COMMUN, V1, P660, DOI 10.1109-TWC.2002.804190; JAYASHREE L, 2006, IFIP INT C WIR OPT C, P7; Maihofer C, 2004, IEEE COMMUN SURV TUT, V6, P32, DOI 10.1109-COMST.2004.5342238; MHATRE V, 2003, DESIGN GUIDELINES WI, P45; Panigrahi D., 2001, P 14 INT C VLSI DES, P57; Rakhmatov D., 2003, ACM T EMBED COMPUT S, V2, P277, DOI 10.1145-860176.860179; Rakhmatov D., 2001, P 2001 IEEE ACM INT, P488; Rhee I., 2005, P 3 INT C EMB NETW S, P90, DOI 10.1145-1098918.1098929; Rao R, 2003, COMPUTER, V36, P77, DOI 10.1109-MC.2003.1250886; Watfa M., 2006, J NETWORKS JNW, V1, P10; Watfa M. K., 2007, International Journal of Sensor Networks, V2; WEN CY, 2005, EURASIP J WIREL COMM, P686; Yi S, 2007, COMPUT COMMUN, V30, P2842, DOI 10.1016-j.comcom.2007.05.034; Younis O, 2004, IEEE T MOBILE COMPUT, V3, P366, DOI 10.1109-TMC.2004.41128
An energy efficient approach to dynamic coverage in wireless sensor networks
No full textTracking of mobile targets is an important application of sensor networks. This is a non-trivial problem as the increased accuracy of tracking results in an overall reduction in the lifetime of the sensor network. In this paper, the tracking issue is first addressed through the determination of a reduced cover for the region of interest. Tracking algorithms are then developed using a reduced set of sensor nodes. The tradeoffs involved in the energy efficient tracking of the target are studied and the performance of the distributed tracking algorithms is compared with well known strategies from the literature. It is shown that the gain in energy savings comes at the expense of reduced quality of tracking. The algorithms guarantee the robustness and accuracy of tracking as well as the extension of the overall system lifetime. Numerical simulations are presented to validate the performance of the proposed algorithms. © 2006 ACADEMY PUBLISHER.1
Boundary coverage and coverage boundary problems in wireless sensor networks
No full textThe extent of coverage of a Wireless Sensor Network (WSN) is of fundamental importance and determines the utility and effectiveness of the deployment. Determining the least number of sensors required to cover the boundary of a region (boundary coverage) as well as determining the boundary of the sensor cover (coverage boundary) are required for a variety of applications. In this paper, these problems are rigorously analysed and computationally simple algorithms are developed for their distributed implementation. The 'Coverage Hole' problem in sensor networks is also analysed and a distributed algorithm is developed that can identify the boundary of the holes in the sensor cover. Numerical simulations show that the reduced boundary cover has better energy efficiency compared to the standard Random Deployment (RD) of sensor nodes in terms of the overall system lifetime. The proposed algorithms are easy to implement and their computational efficiency is validated through complexity analysis. Copyright © 2007 Inderscience Enterprises Ltd.
Self organization of sensor networks for energy-efficient border coverage
No full textNetworking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications. © 2009 KICS.Akyildiz IF, 2002, COMPUT NETW, V38, P393, DOI 10.1016-S1389-1286(01)00302-4; Akyildiz I.F., 2005, J AD HOC NETWORKS, V3, P257; ASLEM J, 2003, P 1 INT C EMB NETW S, P150; Capkun S., 2002, Cluster Computing, V5, DOI 10.1023-A:1013933626682; Carbunar B., 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems (ICPADS 2004), DOI 10.1109-ICPADS.2004.1316137; Cardie M., 2002, J INTERCONNECTION NE, V3, P213, DOI 10.1142-S021926590200063X; CBUNAR B, 2006, ACM T SENSOR NETWORK, V2, P94; Chu M., 2002, INT J HIGH PERFORM C, V16, P90; Commuri S, 2006, INT J DISTRIB SENS N, V2, P333, DOI 10.1080-15501320600719151; COXETER HSM, 1962, T NEW YORK ACAD SCI, P320; FANG Q, 2003, P 4 ACM INT S MOB AD, P165; GAGE DW, 2002, P 19 ANN AUVS TECH S, P22; Ghrist R., 2005, P 4 INT S INF PROC S, P254; GO Y, 2004, P 5 WORLD C INT CONT; GUO Y, 2004, P WORLD C INT CONTR, P4899; Gupta H, 2003, P 4 ACM INT S MOB AD, P189; Gupta P., 2001, COMMUNICATIONS INFOR, V1, P33; Gupta P, 2000, IEEE T INFORM THEORY, V46, P388, DOI 10.1109-18.825799; HONG X, 2001, P IEEE MILCOM OCT, P112; Kershner R, 1939, AM J MATH, V61, P665, DOI 10.2307-2371320; KOTWWITZ D, 1991, ACTA CRYSTALLOGR A, P158; Kumar S., 2005, P 11 ANN INT C MOB C, P284, DOI 10.1145-1080829.1080859; KUROZUMI Y, 1982, COMPUT VISION GRAPH, V19, P248, DOI 10.1016-0146-664X(82)90011-9; Lieska K., 1998, P IEEE INT S PERS IN, V1, P318; Meguerdichian S., 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), DOI 10.1109-INFCOM.2001.916633; Pompili Dario, 2005, Proceedings of the Second ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks PE-WASUN'05, DOI 10.1145-1089803.1089988; Proakis JG, 2001, IEEE COMMUN MAG, V39, P114, DOI 10.1109-35.965368; Savarese C., 2002, Proceedings of the General Track. 2002 USENIX Annual Technical Conference; Slijepcevic S., 2001, P IEEE INT C COMM IC, P472; Sohrabi K, 2000, IEEE PERS COMMUN, V7, P16, DOI 10.1109-98.878532; Verblunsky S., 1949, J LOND MATH SOC, V24, P164; Wang XQ, 2003, PROCEEDINGS OF THE 2003 INTERNATIONAL CONFERENCE ON CONSTRUCTION and REAL ESTATE MANAGEMENT, P28, DOI 10.1145-958491.958496; Warneke B A, 2002, P 9 INT C EL CIRC SY, P291, DOI 10.1109-ICECS.2002.1045391; Watfa M., 2006, J NETWORKS JNW, V1, P10; Watfa M., 2007, INT J AD HOC UBIQ CO, V2, P121; Zhang H., 2005, INT J WIRELESS AD HO, V1, P89; Zong C., 1999, SPHERE PACKINGS; 2004, EXTREME SCALE WIRELE10
A battery aware clustering technique
No full textClustering allows for data aggregation which reduces congestion and energy consumption. Recent study in battery technology reveals that batteries tend to discharge more power than needed and reimburse the over-discharged power if they are recovered. In this paper, we first provide an online mathematical battery model suitable for implementation in sensor networks. Using our battery model, we propose a new Battery Aware Reliable Clustering algorithm for WSNs (BARC). BARC incorporates many features which are missing in many other clustering algorithms. It rotates cluster heads according to a battery recovery scheme and it also incorporates a trust factor for selecting cluster heads thus increasing reliability. Most importantly, our proposed algorithm relaxes many of the rigid assumptions that the other algorithms impose such as the ability of the cluster head to communicate directly with the base station and having a fixed communication radius for intra-cluster communication. BARC uses Z-MAC which has several advantages over other MAC protocols. Simulation results show that using BARC prolongs the network lifetime greatly in comparison to other clustering techniques. © 2008 IEEE
Reactive localisation in underwater wireless sensor networks with self-healing
No full textIn this paper, we present a novel technique for localising an event of interest in an underwater environment monitored by an underwater sensor network. Instead of proactively localising every single node in the network as all proposed techniques set out to do, we approach localisation from a reactive angle. We reduce the localisation problem to the problem of finding 4-Node Coverage. Whenever a node detects an event, it is reactively localised using the anchor nodes, and the sink is supplied with the necessary information. By limiting the sensing range of the sensor nodes, once we have obtained the location of the node that has detected the event, we have a rough estimation of the location of the event. We show that in terms of energy consumption, this localisation technique far surpasses others. © 2013 Inderscience Enterprises Ltd
- …
