Results 11 - 20
of
309
On the lifetime of wireless sensor networks
- TOSN
"... Network lifetime has become the key characteristic for evaluating sensor networks in an application-specific way. Especially the availability of nodes, the sensor coverage, and the connectivity have been included in discussions on network lifetime. Even quality of service measures can be reduced to ..."
Abstract
-
Cited by 77 (12 self)
- Add to MetaCart
(Show Context)
Network lifetime has become the key characteristic for evaluating sensor networks in an application-specific way. Especially the availability of nodes, the sensor coverage, and the connectivity have been included in discussions on network lifetime. Even quality of service measures can be reduced to lifetime considerations. A great number of algorithms and methods were proposed to increase the lifetime of a sensor network—while their evaluations were always based on a particular definition of network lifetime. Motivated by the great differences in existing definitions of sensor network lifetime that are used in relevant publications, we reviewed the state of the art in lifetime definitions, their differences, advantages, and limitations. This survey was the starting point for our work towards a generic definition of sensor network lifetime for use in analytic evaluations as well as in simulation models—focusing on a formal and concise definition of accumulated network lifetime and total network lifetime. Our definition incorporates the components of existing lifetime definitions, and introduces some additional measures. One new concept is the ability to express the service disruption tolerance of a network. Another new concept is the notion of time-integration: in many cases, it is sufficient if a requirement is fulfilled over a certain period of time, instead of at every point in time. In addition, we combine coverage and connectivity to
Lightweight sensing and communication protocols for target enumeration and aggregation
- in: Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc
, 2003
"... The development of lightweight sensing and communication protocols is a key requirement for designing resource constrained sensor networks. This paper introduces a set of efficient protocols and algorithms, DAM, EBAM, and EMLAM, for constructing and maintaining sensor aggregates that collectively mo ..."
Abstract
-
Cited by 72 (2 self)
- Add to MetaCart
(Show Context)
The development of lightweight sensing and communication protocols is a key requirement for designing resource constrained sensor networks. This paper introduces a set of efficient protocols and algorithms, DAM, EBAM, and EMLAM, for constructing and maintaining sensor aggregates that collectively monitor target activity in the environment. A sensor aggregate comprises those nodes in a network that satisfy a grouping predicate for a collaborative processing task. The parameters of the predicate depend on the task and its resource requirements. Since the foremost purpose of a sensor network is to selectively gather information about the environment, the formation of appropriate sensor aggregates is crucial for optimally allocating resources to sensing and communication tasks. This paper makes minimal assumptions about node onboard processing and communication capabilities so as to allow possible implementations on resource-constrained hardware. Factors affecting protocol performance are discussed. The paper presents simulation results showing how the protocol performance varies as key network and task parameters are varied. It also provides probabilistic analyses of network behavior consistent with the simulation results. The protocols have been experimentally validated on a sensor network testbed comprising 25 Berkeley MICA sensor motes.
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.
Network localization in partially localizable networks
- IN PROCEEDINGS OF IEEE INFOCOM
, 2005
"... Knowing the positions of the nodes in a network is essential to many next generation pervasive and sensor network functionalities. Although many network localization systems have recently been proposed and evaluated, there has been no systematic study of partially localizable networks, i.e., netwo ..."
Abstract
-
Cited by 59 (10 self)
- Add to MetaCart
(Show Context)
Knowing the positions of the nodes in a network is essential to many next generation pervasive and sensor network functionalities. Although many network localization systems have recently been proposed and evaluated, there has been no systematic study of partially localizable networks, i.e., networks in which there exist nodes whose positions cannot be uniquely determined. There is no existing study which correctly identifies precisely which nodes in a network are uniquely localizable and which are not. This absence of a sufficient uniqueness condition permits the computation of erroneous positions that may in turn lead applications to produce flawed results. In this paper, in addition to demonstrating the relevance of networks that may not be fully localizable, we design the first framework for two dimensional network localization with an efficient component to correctly determine which nodes are localizable and which are not. Implementing this system, we conduct comprehensive evaluations of network localizability, providing guidelines for both network design and deployment. Furthermore, we study an integration of traditional geographic routing with geographic routing over virtual coordinates in the partially localizable network setting. We show that this novel cross-layer integration yields good performance, and argue that such optimizations will be likely be necessary to ensure acceptable application performance in partially localizable networks.
The effect of mobility-induced location errors on geographic routing in ad hoc and sensor networks: Analysis and improvement using mobility prediction
- IEEE Trans. on Mobile Computing
, 2004
"... Abstract- Geographic routing in mobile ad hoc networks has proved to provide drastic performance improvement over strictly address-centric routing schemes. While geographic routing has been shown to be correct and efficient when location information is accurate, its performance in the face of locati ..."
Abstract
-
Cited by 59 (4 self)
- Add to MetaCart
(Show Context)
Abstract- Geographic routing in mobile ad hoc networks has proved to provide drastic performance improvement over strictly address-centric routing schemes. While geographic routing has been shown to be correct and efficient when location information is accurate, its performance in the face of location errors is not well understood. In this paper, we study the effect of inaccurate location information caused by node mobility under a rich set of scenarios and mobility models. We identify two main problems, named LLNK and LOOP, that are caused by mobility-induced location errors. Based on analysis via ns-2 simulations, we propose two mobility prediction schemes--- neighbor location prediction (NLP) and destination location prediction (DLP) to mitigate these problems. Simulation results show noticeable improvement under all mobility models used in our study. Our schemes achieve up to 27 % improvement in packet delivery and 37 % reduction in network resource wastage on average without incurring any additional communication or intense computation. 1.
TTDD: Two-tier Data Dissemination in Large-scale Sensor Networks
- Wireless Networks
, 2002
"... Sink mobility brings new challenges to large-scale sensor networking. It suggests that information about each mobile sink's location be continuously propagated through the sensor field to keep all sensor nodes updated with the direction for forwarding data reports. Unfortunately frequent locati ..."
Abstract
-
Cited by 59 (0 self)
- Add to MetaCart
(Show Context)
Sink mobility brings new challenges to large-scale sensor networking. It suggests that information about each mobile sink's location be continuously propagated through the sensor field to keep all sensor nodes updated with the direction for forwarding data reports. Unfortunately frequent location updates from multiple sinks can lead to both excessive drain of sensors' limited battery power supply and increased collisions in wireless transmissions. In this paper we describe TTDD, a Two-Tier Data Dissemination approach that provides scalable and e#cient data delivery to multiple mobile sinks. In TTDD Each data source proactively builds a grid structure which enables mobile sinks to continuously receive data on the move by flooding queries within a local cell only. Exploiting the fact that sensor nodes are stationary and location-aware, TTDD constructs and maintains the grid structures with low overhead. We have evaluated TTDD performance through both analysis and extensive simulation experiments. Our results show that TTDD handles multiple mobile sinks e#ciently with performance comparable with that of stationary sinks.
Sensor networks and cooperative control,”
- European Journal of Control,
, 2005
"... Abstract This paper provides a tutorial-style overview of sensor networks from a systems and control theory perspective. We identify key sensor network design and operational control problems and present solution approaches that have been proposed to date. These include deployment, routing, schedul ..."
Abstract
-
Cited by 45 (2 self)
- Add to MetaCart
Abstract This paper provides a tutorial-style overview of sensor networks from a systems and control theory perspective. We identify key sensor network design and operational control problems and present solution approaches that have been proposed to date. These include deployment, routing, scheduling, and power control. In the case of mobile nodes, a sensor network is called upon to perform a "mission". We present solution approaches to two types of missions, both involving stochastic mission spaces and cooperative control: reward maximization missions, and coverage control missions. We conclude by outlining some fundamental research questions related to sensor networks and the convergence of communication, computing, and control.
State-Centric Programming for Sensor-Actuator Network Systems
, 2003
"... This article describes a state-centric, agent-based design methodology to mediate between a system developer's mental model of physical phenomena and the distributed execution of DSAN applications. Building on the ideas of data-centric networking, sensor databases, and proximity-based gro ..."
Abstract
-
Cited by 45 (0 self)
- Add to MetaCart
This article describes a state-centric, agent-based design methodology to mediate between a system developer's mental model of physical phenomena and the distributed execution of DSAN applications. Building on the ideas of data-centric networking, sensor databases, and proximity-based group formation, 3 we introduce the notion of collaboration groups, which abstracts common patterns in application-specific communication and resource allocation. An application developer specifies computations as the creation, aggregation, and transformation of states, which naturally map to the vocabulary used by signal processing and control engineers. More specifically, programmers write applications as algorithms for state update and retrieval, with input supplied by dynamically created collaboration groups. As a result, programs written in the state-centric framework are more invariant to system configuration changes, making the resulting software more modular and portable across multiple platforms. Using a distributed tracking application with sensor networks, we'll demonstrate how state-centric programming can raise the abstraction level for application developers
Distributed State Representation for Tracking Problems in Sensor Networks
- IN PROC. OF 3ND WORKSHOP ON INFORMATION PROCESSING IN SENSOR NETWORKS (IPSN
, 2004
"... This paper investigates the problem of designing decentralized representations to support monitoring and inferences in sensor networks. State-space models of physical phenomena such as those arising from tracking multiple interacting targets, while commonly used in signal processing and control, suf ..."
Abstract
-
Cited by 42 (2 self)
- Add to MetaCart
This paper investigates the problem of designing decentralized representations to support monitoring and inferences in sensor networks. State-space models of physical phenomena such as those arising from tracking multiple interacting targets, while commonly used in signal processing and control, suffer from the curse of dimensionality as the number of phenomena of interest increases. Furthermore, mapping an inference algorithm onto a distributed sensor network must appropriately allocate scarce sensing and communication resources. We address the state-space explosion problem by developing a distributed state-space model that switches between factored and joint state spaces as appropriate. We develop a collaborative group abstraction as a mechanism to e#ectively support the information flow within and across subspaces of the state-space model, which can be efficiently supported in a communication-constrained network. The approach has been implemented and demonstrated in a simulation of tracking multiple interacting targets.
ARRIVE: Algorithm for Robust Routing in Volatile Environments
, 2003
"... Wireless sensor networks for environmental monitoring and distributed control will be deployed on a large scale in the near future. Due to the low per-node cost, these networks are expected to be both large and dense. However, because of the limited computation, storage, and power available to each ..."
Abstract
-
Cited by 40 (2 self)
- Add to MetaCart
Wireless sensor networks for environmental monitoring and distributed control will be deployed on a large scale in the near future. Due to the low per-node cost, these networks are expected to be both large and dense. However, because of the limited computation, storage, and power available to each node, conventional ad-hoc routing techniques are not feasible in this domain, and more novel routing algorithms are required. Despite the need for a simpler approach, routing in sensor networks still needs to be both robust to failures and secure against compromised and malicious nodes. We propose ARRIVE, a probabilistic algorithm that leverages the high node density and the inherent broadcast medium found in sensor networks to achieve routing robust to both link failures and patterned node failures without resorting to periodic flooding of the network. Our algorithm is based on a tree-like topology rooted at the sink of the network, and nodes use localized observed behavior of the surrounding nodes to make probabilistic decisions for forwarding packets. We have found that ARRIVE adapts to large patterned failures within a relatively short period of time at the cost of only moderate increases in overall power consumption and source-to-sink latency.
