• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 258
Next 10 →

Synopsis diffusion for robust aggregation in sensor networks

by Suman Nath, Haifeng Yu, Phillip B. Gibbons, Srinivasan Seshan - IN SENSYS , 2004
"... ..."
Abstract - Cited by 276 (6 self) - Add to MetaCart
Abstract not found

Synopsis Diffusion for Robust Aggregation in Sensor Networks

by unknown authors , 2004
"... Early approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures that are common in senso ..."
Abstract - Add to MetaCart
Early approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures that are common

Synopsis Diffusion for Robust Aggregation in Sensor Networks

by unknown authors
"... Early approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures that are common in senso ..."
Abstract - Add to MetaCart
Early approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures that are common

Synopsis Diffusion for Robust Aggregation in Sensor Networks

by unknown authors
"... Early approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures that are common in senso ..."
Abstract - Add to MetaCart
Early approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures that are common

Directed Diffusion for Wireless Sensor Networking

by Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin, John Heidemann, Fabio Silva - IEEE/ACM Transactions on Networking , 2003
"... Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diffusion paradigm for such ..."
Abstract - Cited by 675 (9 self) - Add to MetaCart
aggregation). We explore and evaluate the use of directed diffusion for a simple remote-surveillance sensor network analytically and experimentally. Our evaluation indicates that directed diffusion can achieve significant energy savings and can outperform idealized traditional schemes (e.g., omniscient

Directed diffusion: a scalable and robust communication paradigm for sensor networks.

by Chalermek Intanagonwiwat , Ramesh Govindan , Deborah Estrin - In Mobicom ’00: Proceedings of the 6th annual international conference on mobile computing and networking , 2000
"... ..."
Abstract - Cited by 2320 (75 self) - Add to MetaCart
Abstract not found

Consensus and cooperation in networked multi-agent systems

by Reza Olfati-Saber , J Alex Fax , Richard M Murray , Reza Olfati-Saber , J Alex Fax , Richard M Murray - Proceedings of the IEEE , 2007
"... Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees. An ove ..."
Abstract - Cited by 807 (4 self) - Add to MetaCart
Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees

Security In Wireless Sensor Networks

by Adrian Perrig, John Stankovic, David Wagner - COMMUNICATIONS OF THE ACM , 2004
"... Wireless sensor network applications include ocean and wildlife monitoring, manufacturing machinery performance monitoring, building safety and earthquake monitoring, and many military applications. An even wider spectrum of future applications is likely to follow, including the monitoring of highw ..."
Abstract - Cited by 360 (5 self) - Add to MetaCart
security issues in these networks, discuss the state of the art in sensor network security, and suggest future directions for research. We cover several important security challenges, including key establishment, secrecy, authentication, privacy, robustness to denial-of-service attacks, secure routing

Impact of network density on Data Aggregation in wireless sensor networks

by Chalermek Intanagonwiwat, Deborah Estrin , Ramesh Govindan , John Heidemann , 2001
"... In-network data aggregation is essential for wireless sensor networks where resources (e.g., bandwidth, energy) are limited. In a previously proposed data dissemination scheme, data is opportunistically aggregated at the intermediate nodes on a low-latency tree which may not necessarily be energy ef ..."
Abstract - Cited by 321 (4 self) - Add to MetaCart
In-network data aggregation is essential for wireless sensor networks where resources (e.g., bandwidth, energy) are limited. In a previously proposed data dissemination scheme, data is opportunistically aggregated at the intermediate nodes on a low-latency tree which may not necessarily be energy

Synopsis Diffusion of . . .

by Suman Nath, Phillip B. Gibbons, SRINIVASAN SESHAN, Zachary Anderson , 2008
"... Previous approaches for computing duplicate-sensitive aggregates in wireless sensor networks have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures, which are common in sensor ..."
Abstract - Add to MetaCart
Previous approaches for computing duplicate-sensitive aggregates in wireless sensor networks have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures, which are common
Next 10 →
Results 1 - 10 of 258
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University