Little Tom thumb went straight home

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 1847-1856

  Westphal, Cédric ^a  

^a NOKIA RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; GATEWAYS (COMPUTER NETWORKS); MESSAGE PASSING; RESOURCE ALLOCATION; SENSOR DATA FUSION; SENSOR NETWORKS;

BREAD CRUMBS (BC) PROTOCOLS; MOBILE USERS;

ROUTING ALGORITHMS;

EID: 34548314499     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.215     Document Type: Conference Paper

References (25)

1. ZigBee Alliance, www.zigbee.org
2. BlueTooth Wireless Technology, http://www.bluetooth.com/bluetooth/
3. Tropos Networks, Ubiquitous, metro-scale Wi-Fi mesh network systems, http://www.tropos.com/
4. Bel Air Networks, Scalable Wide-Area Wi-Fi for data, voice and video, http://www.belairnetworks.com/
5. Strix Systems, Metropolitan Mesh Networks for communities across the globe http://www.strixsystems.com/
6. Skypilot Networks, Synchronous Mesh Infrastructure http://www.skypilot.com/
7. P. Venkitasubramaniam, Q. Zhao and L. Tong, Sensor Networks with Multiple Mobile AccessPoints, in Proc. of the 38th Annual Conference on Information Sciences and Systems (CISS'04), Princeton, NJ, March 2004.
8. P. Venkitasubramaniam, S. Adireddy and L. Tong, Sensor Network with Mobile Access: Optimal Random Access and Coding in IEEE Journal on Selected Areas in Communications, vol.22, No. 6, August 2004.
9. S. Basagni, A. Carosi, E. Melachrinoudis, C. Petrioli, M. Z. Wang, A new MILP formulation and distributed protocols for wireless sensor networks lifetime maximization, in Proc. of IEEE ICC 2006.
10. J. Luo, J.-P. Hubaux Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks, in Proc. of IEEE INFOCOM 2005.
11. J. Luo, J. Panchard, M. Piorkowski, M. Grossglauser, J.-P. Hubaux, MobiRoute: Routing towards a Mobile Sink for Improving Lifetime in Sensor Networks in the 2nd IEEE/ACM DCOSS, 2006.
12. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Analysis and Optimization of Randomized Gossip Algorithms. In Proc. of the 43rd Conference on Decision and Control (CDC 2004), 2004, Paradise Island, Bahamas.
13. C. Perrault, Les Contes de Perrault, (ou Conte de ma Mère l'Oye), 1697.
14. J. Grimm, W. Grimm, Fairy Tales. (1812) (re-edited in 1982: Julian Messner. ISBN 0-671-45648-2 AACR2.)
15. K. Whitehouse, C. Sharp, E. Brewer, D. Culler, Hood: a Neighborhood Abstraction for Sensor Networks, in Proc. of MobySys 2004, Boston, USA.
16. M. Grossglauser, M. Vetterli, Locating nodes with EASE: Last Encounter Routing for Ad Hoc Networks through Mobility Diffusion, in Proc. of Infocom 2003, San Francisco, USA.
17. H. Dubois-Ferrière, M. Grossblauser, M. Vetterli, Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages in Proc. MobiHoc 2003, Annapolis, USA.
18. G. Lawler, Loop-Erased Random Walk in Perplexing problems in Probability, pp. 197-217. Birkhauser Boston, Boston, MA, 1999.
19. R. Pemantle, Choosing a spanning tree for the integer lattice uniformly, Annals of Prob. 19, 1559-1574, 1991.
20. A. Dembo, Y. Peres, J. Rosen, O. Zeitouni, Cover Time for Random Walk and Brownian Motion in Two Dimensions Preprint.
21. N. De Bruijn, D. Knuth, and S. Rice, The average height of planted plane trees, In Graph Theory and Computing (1972), R.C. Read, Ed., Academic Press, 15-22.
22. R. Kenyon, The Asymptotic Determinant of the Discrete Laplacian, Acta Math 185 (2000) no. 2, 239-286.
23. P. Gupta, P.R. Kumar, Criticial Power for Asymptotic Connectivity in Wireless Networks, In Stochastic Analysis, Control, Optimization and Applications, (1998) pp. 547-66.
24. M. Penrose, The Longest Edge of the Random Minimal Spanning Tree, in Annals of Applied Probability 7 (1997) pp. 340-61.
25. C. Avin, G. Ercal, On the Cover Time of Random Geometric Graphs. Submitted to J. Theoretical Computer Science, Nov 2005.