Cost in Sensor Networks with Random Topologies C. Westphal  Home/Search
Context
Related
| nokia.net/cedric/P...secon06maxlife.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: nokia.net/cedric/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Sensor networks (and to some extent ad hoc networks) are networks of nodes with resource constraints, such as a limited battery life, a limited bandwidth or a limited processing capacity. These constraints create a well documented trade-off: each node needs to participate in the network to perform its role or duty, while this participation will deplete the node's resources. Here we consider a particular aspect of this trade-off: the storage of information in the network. Due to the resource... (Update)
Active bibliography (related documents): More All
1.8: On Maximizing the Lifetime of Distributed - Information In Ad (Correct)
1.3: On Maximizing The Lifetime Of Distributed Information In - Ad-Hoc Networks With (Correct)
0.5: Prime Percolation - Vardi (1998) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ sensor-information,
author = "Cost In Sensor",
title = "On the Information Lifetime and the Localization",
url = "citeseer.ist.psu.edu/759240.html" }
Citations (may not include all citations):1225 Chord: A Scalable Peer-to-Peer Lookup Service for Internet A.. - Stoica, Morris et al. - 2001
559 Ad hoc On-Demand Distance Vector Routing - Perkins, Royer - 1999
282 Accessing Nearby Copies of Replicated Objects in a Distribut.. - Plaxton, Rajaraman et al. - 1997
262 Epidemic algorithms for replicated database maintenance (context) - Demers, Greene et al. - 1987
213 Interacting Particle Systems (context) - Liggett - 1985
151 Span: An Energy-Efficient Coordination Algorithm for Topolog.. - Chen, Jamieson et al. - 2002
21 Connectivity Properties of a Packet Radio Network Model (context) - Philips, Panwar et al. - 1989
3 Contact Interactions on a Lattice in Annals of Probability (context) - Harris - 1974
3 Industrial Applied Mathematics (context) - Plane, Soc - 1961
3 Service Discovery in On-Demand Ad Hoc Networks IETF Manet Wo.. (context) - Koodli, Perkins - 2002
3 Survival of Threshold Contact Processes Journal of Theoretic.. (context) - Handjani - 1997
2 Voter and Exclusion Processes Springer-Verlag (context) - Interacting, Contact - 1999
2 of Cambridge tracts in Mathematics (context) - Meester, Roy - 1996
2 On Maximizing The Lifetime of Distributed Information in Ad-.. (context) - Westphal - 2005
1 Percolation Springer-Verlag (context) - Grimmet - 1991
1 the Throughput Capacity of Random Wireless Networks Preprint (context) - Franceschetti, Dousse et al.
1 The Contact Process on a Finite Set III (context) - Durrett, Schonman et al. - 1989
1 The Contact Process on a Finite Set II Ann (context) - Durrett, Schonman - 1988
1 The Contact Process on a Finite Set Ann (context) - Durrett, Liu - 1988
1 Latency of Wireless Sensor Networks with Uncoordinated Power.. - Dousse, Mannersalo et al. - 2004
http://www.kazaa.com/
http://www.eecs.berkeley.edu/
Documents on the same site (http://people.nokia.net/cedric/index.html): More
Improvements on IP Header Compression - Westphal (2003) (Correct)
Some Heuristics About Piggybacked Binding Updates - Westphal, Perkins (Correct)
A User-based Frequency-dependent IP Header Compression Architecture - Westphal (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC