By Topic

2006 5th International Conference on Information Processing in Sensor Networks

19-21 April 2006

Filter Results

Displaying Results 1 - 25 of 71
  • [Front cover]

    Publication Year: 2006, Page(s): C1
    IEEE is not the copyright holder of this material | PDF file iconPDF (807 KB)
    Freely Available from IEEE
  • The Fifth International Conference on Information Processing in Sensor Networks (IEEE Cat. No. 06EX1353)

    Publication Year: 2006
    Request permission for commercial reuse | PDF file iconPDF (1376 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2006, Page(s): ii
    IEEE is not the copyright holder of this material | PDF file iconPDF (87 KB)
    Freely Available from IEEE
  • General Chair's message

    Publication Year: 2006, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (98 KB) | HTML iconHTML
    Freely Available from IEEE
  • TPC Chair's message

    Publication Year: 2006, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (162 KB) | HTML iconHTML
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2006, Page(s):v - ix
    IEEE is not the copyright holder of this material | PDF file iconPDF (550 KB)
    Freely Available from IEEE
  • Conference committee

    Publication Year: 2006, Page(s):x - xii
    Request permission for commercial reuse | PDF file iconPDF (472 KB)
    Freely Available from IEEE
  • Security in sensor networks: industry trends, present and future research directions

    Publication Year: 2006
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • Near-optimal sensor placements: maximizing information while minimizing communication cost

    Publication Year: 2006, Page(s):2 - 10
    Cited by:  Papers (108)  |  Patents (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4040 KB) | HTML iconHTML

    When monitoring spatial phenomena with wireless sensor networks, selecting the best sensor placements is a fundamental task. Not only should the sensors be informative, but they should also be able to communicate efficiently. In this paper, we present a data-driven approach that addresses the three central aspects of this problem: measuring the predictive quality of a set of sensor locations (rega... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Utility-based sensor selection

    Publication Year: 2006, Page(s):11 - 18
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3029 KB) | HTML iconHTML

    Sensor networks consist of many small sensing devices that monitor an environment and communicate using wireless links. The lifetime of these networks is severely curtailed by the limited battery power of the sensors. One line of research in sensor network lifetime management has examined sensor selection techniques, in which applications judiciously choose which sensors' data should be retrieved ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global connectivity from local geometric constraints for sensor networks with various wireless footprints

    Publication Year: 2006, Page(s):19 - 26
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2341 KB) | HTML iconHTML

    Adaptive power topology control (APTC) is a local algorithm for constructing a one-parameter family of thetas-graphs, where each node increases power until it has a neighbor in every thetas sector around it. We show it is possible to use such a local geometric thetas-constraint to ensure full network connectivity, and consider tradeoffs between assumptions about the wireless footprint and constrai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simultaneous localization, calibration, and tracking in an ad hoc sensor network

    Publication Year: 2006, Page(s):27 - 33
    Cited by:  Papers (57)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2804 KB) | HTML iconHTML

    We introduce simultaneous localization and tracking, called SLAT, the problem of tracking a target in a sensor network while simultaneously localizing and calibrating the nodes of the network. Our proposed solution, LaSLAT, is a Bayesian filter that provides on-line probabilistic estimates of sensor locations and target tracks. It does not require globally accessible beacon signals or accurate ran... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed localization of networked cameras

    Publication Year: 2006, Page(s):34 - 42
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4806 KB) | HTML iconHTML

    Camera networks are perhaps the most common type of sensor network and are deployed in a variety of real-world applications including surveillance, intelligent environments and scientific remote monitoring. A key problem in deploying a network of cameras is calibration, i.e., determining the location and orientation of each sensor so that observations in an image can be mapped to locations in the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data gathering tours in sensor networks

    Publication Year: 2006, Page(s):43 - 50
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3014 KB) | HTML iconHTML

    A basic task in sensor networks is to interactively gather data from a subset of the sensor nodes. When data needs to be gathered from a selected set of nodes in the network, existing communication schemes often behave poorly. In this paper, we study the algorithmic challenges in efficiently routing a fixed-size packet through a small number of nodes in a sensor network, picking up data as the que... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized compression and predistribution via randomized gossiping

    Publication Year: 2006, Page(s):51 - 59
    Cited by:  Papers (51)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2510 KB) | HTML iconHTML

    Developing energy efficient strategies for the extraction, transmission, and dissemination of information is a core theme in wireless sensor network research. In this paper we present a novel system for decentralized data compression and predistribution. The system simultaneously computes random projections of the sensor data and disseminates them throughout the network using a simple gossiping al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Active learning for adaptive mobile sensing networks

    Publication Year: 2006, Page(s):60 - 68
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4376 KB) | HTML iconHTML

    This paper investigates data-adaptive path planning schemes for wireless networks of mobile sensor platforms. We focus on applications of environmental monitoring, in which the goal is to reconstruct a spatial map of environmental factors of interest. Traditional sampling theory deals with data collection processes that are completely independent of the target map to be estimated, aside from possi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geographic gossip: efficient aggregation for sensor networks

    Publication Year: 2006, Page(s):69 - 76
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3052 KB) | HTML iconHTML

    Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain environments. However, gossip algorithms can waste significant energy by essentially passing around redundant information multiple times. For realistic sensor network model topologies like grids and random geometric graphs,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differential games in large-scale sensor-actuator networks

    Publication Year: 2006, Page(s):77 - 84
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1323 KB) | HTML iconHTML

    Surveillance systems based on sensor network technology have been shown to successfully detect, classify and track targets of interest over a large area. State information collected via the sensor network also enables these systems to actuate mobile agents so as to achieve surveillance goals such as target capture and asset protection. But satisfying these goals is complicated by the fact that tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Active wireless sensing for rapid information retrieval in sensor networks

    Publication Year: 2006, Page(s):85 - 92
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3412 KB) | HTML iconHTML

    Most existing information extraction schemes in sensor networks rely on in-network processing that requires information routing and coordination between sensor nodes and incurs a corresponding overhead in delay and energy consumption. In this paper, we propose a viable alternative-active wireless sensing (AWS)-in which a wireless information retriever (WIR) queries a select ensemble of nodes to ob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Kinetically stable task assignment for networks of microservers

    Publication Year: 2006, Page(s):93 - 101
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5140 KB) | HTML iconHTML

    This paper studies task assignment in a network of resource constrained computing platforms (called microservers). A task is an abstraction of a computational agent or data that is hosted by the microservers. For example, in an object tracking scenario, a task represents a mobile tracking agent, such as a vehicle location update computation, that runs on microservers, which can receive sensor data... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random distributed multiresolution representations with significance querying

    Publication Year: 2006, Page(s):102 - 108
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2096 KB) | HTML iconHTML

    We propose random distributed multiresolution representations of sensor network data, so that the most significant encoding coefficients are easily accessible by querying a few sensors, anywhere in the network. Less significant encoding coefficients are available by querying a larger number of sensors, local to the region of interest. Significance can be defined in a multiresolution way, without a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Slip surface localization in wireless sensor networks for landslide prediction

    Publication Year: 2006, Page(s):109 - 116
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3621 KB) | HTML iconHTML

    A landslide occurs when the balance between a hill's weight and the countering resistance forces is tipped in favor of gravity. While the physics governing the interplay between these competing forces is fairly well understood, prediction of landslides has been hindered thus far by the lack of field measurements over large temporal and spatial scales necessary to capture the inherent heterogeneity... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond sensorwebs: Closing the loop in network embedded systems

    Publication Year: 2006, Page(s): 117
    Request permission for commercial reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE
  • Coverage for target localization in wireless sensor networks

    Publication Year: 2006, Page(s):118 - 125
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5238 KB) | HTML iconHTML

    Target tracking and localization are important applications in wireless sensor networks. Although the coverage problem for target detection has been intensively studied, few consider the coverage problem from the perspective of target localization. In this paper, we propose two methods to estimate the necessary sensor density which can guarantee a localization error bound over the sensing field. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error propagation in dense wireless networks with cooperation

    Publication Year: 2006, Page(s):126 - 133
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2421 KB) | HTML iconHTML

    We study error propagation in wireless cooperative broadcast protocols. In our model, nodes in the network are randomly deployed in a fixed region. The message from a certain source node is relayed by multiple groups of cooperating relays that are located in predetermined consecutive swaths of the network area. We refer to these groups of relays as "levels". Our analysis is based on the derivation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.