On maximizing the lifetime of distributed information in ad-hoc networks with individual constraints

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2005, Pages 26-33

  Westphal, Cédric ^a  

^a NOKIA RESEARCH CENTER   (United States)

Author keywords

Ad hoc networks; Contact process; Peer to peer systems; Sensor networks

Indexed keywords

COMPUTER NETWORKS; DATA ACQUISITION; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; TOPOLOGY;

AD-HOC NETWORKS; CONTACT PROCESS; PEER-TO-PEER SYSTEM; SENSOR NETWORKS;

SENSORS;

EID: 29844438806     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1062689.1062694     Document Type: Conference Paper

References (11)

1. Chen B., Jamieson K., Balakrishnan H., Morris R. Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks, ACM Wireless Networks Journal, Volume 38, Number 5, September, 2002. Pages 481 - 494.
2. Gilbert E. Random Plane Networks J. Soc. Industrial Applied Mathematics, Vol. 9, No. 4, 1961, pp.533-43.
3. Handjani S. Survival of Threshold Contact Processes Journal of Theoretical Probability 10 (3): 737-746, July 1997.
4. Harris T.E. Contact Interactions on a Lattice in Annals of Probability, 1974, Vol.2, No. 6, 969-988.
5. Koodli R., Perkins C. Service Discovery in On-Demand Ad Hoc Networks IETF Manet Working Group, Internet Draft draft-koodli-manet-servicediscovery-00.txt, 9/2002.
6. Liggett T. Stochastic Interacting Systems Springer, 1999.
7. Pemantle R. The Contact Process on Trees Ann. Probab., 20, 2089 - 2116 (1992)
8. Perkins C., Royer E. Ad hoc On-Demand Distance Vector Routing. Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90-100.
9. Plaxton C., Rajaraman R., Richa A. Accessing Nearby Copies of Replicated Objects in a Distributed Environment ACM Symposium on Parallel Algorithmsand Architectures, 1997.
10. Stoica I., Morris R., Karger D., Kaashoek F., Balakrishnan H. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications in Proceedings of ACM SIGCOMM, 2001.
11. Wagner A., Anantharam V. Designing a Contact Process: The Piecewise-Homogeneous Process on a Finite Set with Applications. Stochastic Processes and their Applications (to appear, available from http://www.eecs. berkeley.edu/ananth/).