Results 11 - 20
of
288
VBF: Vector-Based Forwarding Protocol for Underwater Sensor Networks
- In Proc. of IFIP Networking
, 2005
"... Underwater Sensor Networks (UWSNs) are significantly different from land-based sensor networks. In UWSNs, the new features: low bandwidth, high latency, high network dynamics, high error probability, and 3-dimensional space, bring big challenges to network protocol design. In this technical report ..."
Abstract
-
Cited by 80 (20 self)
- Add to MetaCart
(Show Context)
Underwater Sensor Networks (UWSNs) are significantly different from land-based sensor networks. In UWSNs, the new features: low bandwidth, high latency, high network dynamics, high error probability, and 3-dimensional space, bring big challenges to network protocol design. In this technical report, we tackle one fundamental problem in UWSNs: scalable and energy efficient routing. We propose a novel routing protocol, called vector-based forwarding (VBF) to address these new challenges. VBF is scalable and energy efficient. In VBF, no state information is required on the sensor nodes and only a small fraction of the nodes are involved in routing. Moreover, we develop a localized and distributed self-adaptation algorithm to enhance the performance of VBF. The self-adaptation algorithm allows the nodes to weigh the benefit to forward packets and reduce energy consumption by discarding the low benefit packets. We evaluate the performance of VBF through extensive simulations. Our experiment results show that for networks with small or medium node mobility (2 m/s-10 m/s), VBF can effectively accomplish the goals of energy efficiency, high success of data delivery and low end-to-end delay.
The holes problem in wireless sensor networks: A survey
- ACM Sigmobile Mobile Computing and Communication Review
"... Several anomalies can occur in wireless sensor networks that impair their desired function-alities i.e., sensing and communication. Different kinds of holes can form in such networks creating geographically correlated problem areas such as coverage holes, routing holes, jamming holes, sink/black hol ..."
Abstract
-
Cited by 65 (1 self)
- Add to MetaCart
(Show Context)
Several anomalies can occur in wireless sensor networks that impair their desired function-alities i.e., sensing and communication. Different kinds of holes can form in such networks creating geographically correlated problem areas such as coverage holes, routing holes, jamming holes, sink/black holes and worm holes, etc. We detail in this paper different types of holes, discuss their characteristics and study their effects on successful working of a sensor network. We present state-of-the-art in research for addressing the holes related problems in wireless sensor networks and discuss the relative strengths and short-comings of the proposed solutions for combating different kinds of holes. We conclude by highlight-ing future research directions. I.
IGF: A State-Free Robust Communication Protocol for Wireless Sensor Networks
, 2003
"... Wireless Sensor Networks (WSNs) are being designed to solve a gamut of interesting real-world problems. Limitations on available energy and bandwidth, message loss, high rates of node failure, and communication restrictions pose challenging requirements for these systems. Beyond these inherent limit ..."
Abstract
-
Cited by 63 (3 self)
- Add to MetaCart
(Show Context)
Wireless Sensor Networks (WSNs) are being designed to solve a gamut of interesting real-world problems. Limitations on available energy and bandwidth, message loss, high rates of node failure, and communication restrictions pose challenging requirements for these systems. Beyond these inherent limitations, both the possibility of node mobility and energy conserving protocols that power down nodes introduce additional complexity to routing protocols that depend on up to date routing or neighborhood tables. Such state-based protocols suffer excessive delay or message loss, as system dynamics require expensive upkeep of these tables. Utilizing characteristics of high node density and location awareness, we introduce IGF, a location-aware routing protocol that is robust and works without knowledge of the existence of neighboring nodes (state-free). We compare our work against established routing protocols to demonstrate the efficacy of our solution when nodes are mobile or periodically sleep to conserve energy. We show that IGF far outperforms these protocols, in some cases delivering close to 100% of the packets transmitted while alternate solutions fail to even find a path between a source and destination. Specifically, we show that our protocol demonstrates a vast improvement over prior work using metrics of delivery ratio, control overhead, and end-to-end delay.
A survey of multimedia streaming in wireless sensor networks
- IEEE Communications Survey & Tutorials
, 2008
"... Abstract—A wireless sensor network with multimedia capa-bilities typically consists of data sensor nodes, which sense, for instance, sound or motion, and video sensor nodes, which capture video of events of interest. In this survey, we focus on the video encoding at the video sensors and the real-ti ..."
Abstract
-
Cited by 60 (2 self)
- Add to MetaCart
(Show Context)
Abstract—A wireless sensor network with multimedia capa-bilities typically consists of data sensor nodes, which sense, for instance, sound or motion, and video sensor nodes, which capture video of events of interest. In this survey, we focus on the video encoding at the video sensors and the real-time transport of the encoded video to a base station. Real-time video streams have stringent requirements for end-to-end delay and loss during network transport. In this survey, we categorize the requirements of multimedia traffic at each layer of the network protocol stack and further classify the mechanisms that have been proposed for multimedia streaming in wireless sensor networks at each layer of the stack. Specifically, we consider the mechanisms operating at the application, transport, network, and MAC layers. We also review existing cross-layer approaches and propose a few possible cross-layer solutions to optimize the performance of a given wireless sensor network for multimedia streaming applications. Index Terms—Cross-layer mechanisms, medium access con-trol, multimedia, video streaming, wireless sensor networks. I.
Modeling the Performance of Wireless Sensor Networks
- In IEEE Infocom
, 2004
"... A critical issue in wireless sensor networks is represented by the limited availability of energy within network nodes; therefore making good use of energy is a must. A widely employed energy-saving technique is to place nodes in sleep mode, corresponding to a low-power consumption as well as to red ..."
Abstract
-
Cited by 59 (1 self)
- Add to MetaCart
(Show Context)
A critical issue in wireless sensor networks is represented by the limited availability of energy within network nodes; therefore making good use of energy is a must. A widely employed energy-saving technique is to place nodes in sleep mode, corresponding to a low-power consumption as well as to reduced operational capabilities. In this work, we develop a Markov model of a sensor network whose nodes may enter a sleep mode, and we use this model to investigate the system performance in terms of energy consumption, network capacity, and data delivery delay. Furthermore, the proposed model enables us to investigate the trade-offs existing between these performance metrics and the sensor dynamics in sleep/active mode. Analytical results present an excellent matching with simulation results for a large variety of system scenarios showing the accuracy of our approach.
Multi-query optimization for sensor networks
- In DCOSS
, 2005
"... Abstract. The widespread dissemination of small-scale sensor nodes has sparked interest in a powerful new database abstraction for sensor networks: Clients “program” the sensors through queries in a high-level declarative language permitting the system to perform the low-level optimizations necessar ..."
Abstract
-
Cited by 55 (4 self)
- Add to MetaCart
(Show Context)
Abstract. The widespread dissemination of small-scale sensor nodes has sparked interest in a powerful new database abstraction for sensor networks: Clients “program” the sensors through queries in a high-level declarative language permitting the system to perform the low-level optimizations necessary for energy-efficient query processing. In this paper we consider multi-query optimization for aggregate queries on sensor networks. We develop a set of distributed algorithms for processing multiple queries that incur minimum communication while observing the computational limitations of the sensor nodes. Our algorithms support incremental changes to the set of active queries and allow for local repairs to routes in response to node failures. A thorough experimental analysis shows that our approach results in significant energy savings, compared to previous work. 1
Resource allocation and performance analysis of wireless video sensors",
- IEEE Transactions on Circuits and Systems for Video Technology, vol.16, no.5, pp.590 -- 599,
, 2006
"... ..."
(Show Context)
An Entity Maintenance and Connection Service for Sensor Networks
- In The First Intl. Conference on Mobile Systems, Applications, and Services (MobiSys
, 2003
"... In this paper, we present a middleware architecture for coordination services in sensor networks that facilitates interaction between groups of sensors which monitor different environmental events. It sits on top of the native routing infrastructure and exports the abstraction of mobile communicatio ..."
Abstract
-
Cited by 51 (14 self)
- Add to MetaCart
(Show Context)
In this paper, we present a middleware architecture for coordination services in sensor networks that facilitates interaction between groups of sensors which monitor different environmental events. It sits on top of the native routing infrastructure and exports the abstraction of mobile communication endpoints maintained at the locations of such events. A single logical destination is created and maintained for every environmental event of interest. Such destinations are uniquely labeled and can be used for communication by application-level algorithms for coordination and sensory data management between the different event locales. For example, they may facilitate coordination, in a distributed intrusion scenario, among nodes in the vicinity of the intruders.
Statistical En-route Detection and Filtering of Injected False Data in Sensor Networks
, 2004
"... In a large-scale sensor network individual sensors are subject to security compromises. A compromised node can inject bogus sensing reports into the network. If undetected, these bogus reports would be forwarded to the data collection point (i.e. the sink). Such attacks by compromised sensors can ca ..."
Abstract
-
Cited by 48 (2 self)
- Add to MetaCart
In a large-scale sensor network individual sensors are subject to security compromises. A compromised node can inject bogus sensing reports into the network. If undetected, these bogus reports would be forwarded to the data collection point (i.e. the sink). Such attacks by compromised sensors can cause not only false alarms but also the depletion of the finite amount of energy in a battery powered network. In this paper we present a Statistical Enroute Filtering (SEF) mechanism that can detect and drop such false reports. SEF requires that each sensing report be validated by multiple keyed message authentication codes (MACs), each generated by a node that detects the same event. As the report is forwarded, each node along the way verifies the correctness of the MACs probabilistically and drops those with invalid MACs at earliest points. The sink further filters out remaining false reports that escape the en-route filtering. SEF exploits the network scale to determine the truthfulness of each report through collective decision-making by multiples detecting nodes and collective false-report-detection by multiple forwarding nodes. Our analysis and simulations show that, with an overhead of 14 bytes per report, SEF is able to drop 8090% falsely injected reports by a compromised node within 10 forwarding hops.
Toward resilient security in wireless sensor networks
- in MobiHoc ’05: Proceedings of the 6th ACM international symposium on Mobile
, 2005
"... Node compromise poses severe security threats in wireless sensor networks. Unfortunately, existing security designs can address only a small, fixed threshold number of compromised nodes; the security protection completely breaks down when the threshold is exceeded. In this paper, we seek to overcome ..."
Abstract
-
Cited by 46 (1 self)
- Add to MetaCart
Node compromise poses severe security threats in wireless sensor networks. Unfortunately, existing security designs can address only a small, fixed threshold number of compromised nodes; the security protection completely breaks down when the threshold is exceeded. In this paper, we seek to overcome the threshold limitation and achieve resiliency against an increasing number of compromised nodes. To this end, we propose a novel location-based approach in which the secret keys are bound to geographic locations, and each node stores a few keys based on its own location. The location-binding property constrains the scope for which individual keys can be (mis)used, thus limiting the damages caused by a collection of compromised nodes. We illustrate this approach through the problem of report fabrication attacks, in which the compromised nodes forge non-existent events. We evaluate our design through extensive analysis, implementation and simulations, and demonstrate its graceful performance degradation in the presence of an increasing number of compromised nodes.
