Results 1 - 10
of
678
Sensor networks: Evolution, opportunities, and challenges
- PROCEEDINGS OF THE IEEE
, 2003
"... Wireless microsensor networks have been identified as one of the most important technologies for the 21st century. This paper traces the history of research in sensor networks over the past three decades, including two important programs of the Defense Advanced Research Projects Agency (DARPA) spann ..."
Abstract
-
Cited by 655 (1 self)
- Add to MetaCart
Wireless microsensor networks have been identified as one of the most important technologies for the 21st century. This paper traces the history of research in sensor networks over the past three decades, including two important programs of the Defense Advanced Research Projects Agency (DARPA) spanning this period: the Distributed Sensor Networks (DSN) and the Sensor
Event-to-Sink Reliable Transport in Wireless Sensor Networks
- IEEE/ACM Trans. Networking
, 2005
"... Abstract—Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective information provided by source nodes and not on any individual report. However, conventional end-to-end reliab ..."
Abstract
-
Cited by 376 (11 self)
- Add to MetaCart
Abstract—Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective information provided by source nodes and not on any individual report. However, conventional end-to-end reliability definitions and solutions are inapplicable in the WSN regime and would only lead to a waste of scarce sensor resources. Hence, the WSN paradigm necessitates a collective event-to-sink reliability notion rather than the traditional end-to-end notion. To the best of our knowledge, reliable transport in WSN has not been studied from this perspective before. In order to address this need, a new reliable transport scheme for WSN, the event-to-sink reliable transport (ESRT) protocol, is presented in this paper. ESRT is a novel transport solution developed to achieve reliable event detection in WSN with minimum energy expenditure. It includes a congestion control component that serves the dual purpose of achieving reliability and conserving energy. Importantly, the algorithms of ESRT mainly run on the sink, with minimal functionality required at resource constrained sensor nodes. ESRT protocol operation is determined by the current network state based on the reliability achieved and congestion condition in the network. This self-configuring nature of ESRT makes it robust to random, dynamic topology in WSN. Furthermore, ESRT can also accommodate multiple concurrent event occurrences in a wireless sensor field. Analytical performance evaluation and simulation results show that ESRT converges to the desired reliability with minimum energy expenditure, starting from any initial network state. Index Terms—Congestion control, energy conservation, event-to-sink reliability, reliable transport protocols, wireless sensor networks. I.
The impact of spatial correlation on routing with compression in wireless sensor networks
- In ACM/IEEE International Symposium on Information Processing in Sensor Networks (IPSN 2004
"... The efficacy of data aggregation in sensor networks is a function of the degree of spatial correlation in the sensed phenomenon. The recent literature has examined a variety of schemes that achieve greater data aggregation by routing data with regard to the underlying spatial correlation. A well kno ..."
Abstract
-
Cited by 203 (16 self)
- Add to MetaCart
(Show Context)
The efficacy of data aggregation in sensor networks is a function of the degree of spatial correlation in the sensed phenomenon. The recent literature has examined a variety of schemes that achieve greater data aggregation by routing data with regard to the underlying spatial correlation. A well known conclusion from these papers is that the nature of optimal routing with compression depends on the correlation level. In this work, we show the existence of a simple, practical and static correlation-unaware clustering scheme that satisfies a min-max near-optimality condition. The implication for system design is that a static correlation-unaware scheme can perform as well as sophisticated adaptive schemes for joint routing and compression.
Programming pervasive and mobile computing applications with the tota middleware
- PerCom 2004. Proceedings of the Second IEEE Annual Conference on
, 2004
"... Pervasive and mobile computing call for suitable middleware and programming models to support the activities of complex software systems in dynamic network environments. In this paper we present TOTA (“Tuples On The Air”), a novel middleware and programming approach for supporting adaptive context-a ..."
Abstract
-
Cited by 123 (33 self)
- Add to MetaCart
Pervasive and mobile computing call for suitable middleware and programming models to support the activities of complex software systems in dynamic network environments. In this paper we present TOTA (“Tuples On The Air”), a novel middleware and programming approach for supporting adaptive context-aware activities in pervasive and mobile computing scenarios. The key idea in TOTA is to rely on spatially distributed tuples, adaptively propagated across a network on the basis of application-specific rules, for both representing contextual information and supporting uncoupled interactions between application components. TOTA promotes a simple way of programming that facilitates access to distributed information, navigation in complex environments, and achievement of complex coordination tasks in a fully distributed and adaptive way, mostly freeing programmers and system managers form the need to take care of lowlevel issues related to network dynamics. This paper includes both application examples to clarify concepts and performance figures to show the feasibility of the approach.
Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime
- Proceedings of the 38th Annual Hawaii International Conference on System Sciences
, 2005
"... Abstract—This paper explores the idea of exploiting the mobil-ity of data collection points (sinks) for the purpose of increasing the lifetime of a wireless sensor network with energy-constrained nodes. We give a novel linear programming formulation for the joint problems of determining the movement ..."
Abstract
-
Cited by 110 (2 self)
- Add to MetaCart
(Show Context)
Abstract—This paper explores the idea of exploiting the mobil-ity of data collection points (sinks) for the purpose of increasing the lifetime of a wireless sensor network with energy-constrained nodes. We give a novel linear programming formulation for the joint problems of determining the movement of the sink and the sojourn time at different points in the network that induce the maximum network lifetime. Differently from previous solutions, our objective function maximizes the overall network lifetime (here defined as the time till the first node “dies ” because of energy depletion) rather than minimizing the energy consumption at the nodes. For wireless sensor networks with up to 256 nodes our model produces sink movement patterns and sojourn times leading to a network lifetime up to almost five times that obtained with a static sink. Simulation results are performed to determine the distribution of the residual energy at the nodes over time. These results confirm that energy consumption varies with the current sink location, being the nodes more drained those in the proximity of the sink. Furthermore, the proposed solution for computing the sink movement results in a fair balancing of the energy depletion among the network nodes. I.
Recent and Emerging Topics in Wireless Industrial Communications: A Selection
, 2007
"... In this paper we discuss a selection of promising and interesting research areas in the design of protocols and systemsforwirelessindustrialcommunications.Wehaveselected topicsthathaveeitheremergedashottopicsintheindustrial communicationscommunityinthelastfewyears(likewireless sensornetworks),orwhi ..."
Abstract
-
Cited by 96 (1 self)
- Add to MetaCart
(Show Context)
In this paper we discuss a selection of promising and interesting research areas in the design of protocols and systemsforwirelessindustrialcommunications.Wehaveselected topicsthathaveeitheremergedashottopicsintheindustrial communicationscommunityinthelastfewyears(likewireless sensornetworks),orwhichcouldbeworthwhileresearchtopicsin thenextfewyears(forexamplecooperativediversitytechniques for error control, cognitive radio/opportunistic spectrum access for mitigation of external interferences).
Network Information Flow with Correlated Sources
- TO APPEAR IN THE IEEE TRANSACTIONS ON INFORMATION THEORY
, 2005
"... Consider the following network communication setup, originating in a sensor networking application we refer to as the “sensor reachback ” problem. We have a directed graph G = (V, E), where V = {v0v1...vn} and E ⊆ V × V. If (vi, vj) ∈ E, then node i can send messages to node j over a discrete memor ..."
Abstract
-
Cited by 93 (7 self)
- Add to MetaCart
(Show Context)
Consider the following network communication setup, originating in a sensor networking application we refer to as the “sensor reachback ” problem. We have a directed graph G = (V, E), where V = {v0v1...vn} and E ⊆ V × V. If (vi, vj) ∈ E, then node i can send messages to node j over a discrete memoryless channel (Xij, pij(y|x), Yij), of capacity Cij. The channels are independent. Each node vi gets to observe a source of information Ui (i = 0...M), with joint distribution p(U0U1...UM). Our goal is to solve an incast problem in G: nodes exchange messages with their neighbors, and after a finite number of communication rounds, one of the M + 1 nodes (v0 by convention) must have received enough information to reproduce the entire field of observations (U0U1...UM), with arbitrarily small probability of error. In this paper, we prove that such perfect reconstruction is possible if and only if H(US|US c) < i∈S,j∈S c for all S ⊆ {0...M}, S = ∅, 0 ∈ S c. Our main finding is that in this setup a general source/channel separation theorem holds, and that Shannon information behaves as a classical network flow, identical in nature to the flow of water in pipes. At first glance, it might seem surprising that separation holds in a
RCRT: Rate-Controlled Reliable Transport . . .
"... Emerging high-rate applications (imaging, structural monitoring, acoustic localization) will need to transport large volumes of data concurrently from several sensors. These applications are also loss-intolerant. A key requirement for such applications, then, is a protocol that reliably transport se ..."
Abstract
-
Cited by 87 (6 self)
- Add to MetaCart
(Show Context)
Emerging high-rate applications (imaging, structural monitoring, acoustic localization) will need to transport large volumes of data concurrently from several sensors. These applications are also loss-intolerant. A key requirement for such applications, then, is a protocol that reliably transport sensor data from many sources to one or more sinks without incurring congestion collapse. In this paper, we discuss RCRT, a rate-controlled reliable transport protocol suitable for constrained sensor nodes. RCRT uses end-to-end explicit loss recovery, but places all the congestion detection and rate adaptation functionality in the sinks. This has two important advantages: efficiency and flexibility. Because sinks make rate allocation decisions, they are able to achieve greater efficiency since they have a more comprehensive view of network behavior. For the same reason, it is possible to alter the rate allocation decisions (for example, from one that ensures that all nodes get the same rate, to one that ensures that nodes get rates in proportion to their demands), without modifying sensor code at all. We evaluate RCRT extensively on a 40-node wireless sensor network testbed and show that RCRT achieves 1.7 times the rate achieved by IFRC and 1.4 times that of WRCP, two recently proposed interference-aware distributed rate-control protocols. We also present results from a 3-month-long 19-node real world deployment of RCRT in an imaging application and show that RCRT works well in real long-term deployments.
Programming Wireless Sensor Networks: Fundamental Concepts and State-of-the-Art
"... Wireless sensor networks (WSNs) are attracting great interest in a number of application domains concerned with monitoring and control of physical phenomena, as they enable dense and untethered deployments at low cost and with unprecedented flexibility. However, application development is still one ..."
Abstract
-
Cited by 81 (12 self)
- Add to MetaCart
(Show Context)
Wireless sensor networks (WSNs) are attracting great interest in a number of application domains concerned with monitoring and control of physical phenomena, as they enable dense and untethered deployments at low cost and with unprecedented flexibility. However, application development is still one of the main hurdles to a wide adoption of WSN technology. In current real-world WSN deployments, programming is typically carried out very close to the operating system, therefore requiring the programmer to focus on low-level system issues. This not only shifts the focus of the programmer away from the application logic, but also requires a technical background that is rarely found among application domain experts. The need for appropriate high-level programming abstractions, capable to simplify the programming chore without sacrificing efficiency, has been long recognized and several solutions have been hitherto proposed, which differ along many dimensions. In this paper, we survey the state-of-the-art in programming approaches for WSNs. We begin by presenting a taxonomy of WSN applications, to identify the fundamental requirements programming platforms must deal with. Then, we introduce a taxonomy of WSN programming approaches that captures the fundamental differences among existing solutions, and constitutes the core contribution of this paper. Our presentation style relies on concrete examples and code snippets taken from programming platforms representative of the taxonomy dimensions being discussed. We use the taxonomy to provide an exhaustive classification of existing approaches. Moreover, we also map existing approaches back to the application requirements, therefore providing not only a complete view of the state-of-the-art, but also useful insights for selecting the programming abstraction most appropriate to the application at hand.
Information fusion for wireless sensor networks: methods, models, and classifications,”
- Article ID 1267073,
, 2007
"... ..."
