Distributed Dynamic Storage in Wireless Networks

References

• Alzoubi , K. , Li , X.-Y. , Wang , Y. , Wan , P. -J. and Frieder , O. 2003 . Geometric spanners for wireless Ad hoc networks . JEEE Transactions on Parallel and Distributed Systems , 14 5 May
   Google Scholar
• de Berg , M. , van Kreveld , M. , van Oostrum , R. and Overmars , M. 1997 . Simple traversal of a subdivision without extra storage . Int. J. of Geographic Information Systems , 11 : 359 – 373 . [CROSSREF]
   Web of Science ®Google Scholar
• Bern , M. , Eppstein , D. and Yao , F. The expected extremes in a delaunay triangulation . Proc. of the 18th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science . Vol. 510 , pp. 674 – 685 .
   Google Scholar
• Bose , P. and Devroye , L. 1998 . Intersections with random geometric objects . Computational Geometry: Theory and Applications , 10 ( 3 ) : 139 – 154 .
   Google Scholar
• Bose , P. , Morin , P. , Stojmenovic , I. and Urrutia , J. Routing with guaranteed delivery in ad hoc wireless networks . Proc. of Discrete Algorithms and Methods for Mobility (DIALM’99) . pp. 48 – 55 .
   Google Scholar
• Chandy , K. M. and Lamport , L. 1985 . Distributed snapshots: Determining global states of distributed systems . ACM Transactions on Computer Systems , 3 ( 1 ) : 63 – 75 . [CROSSREF]
   Web of Science ®Google Scholar
• Dowdy , L. W. and Foster , D. V. 1982 . Comparative models of the file assignment problem . ACM Computing Surveys , 14 ( 2 ) June : 287 – 313 . [CROSSREF]
   Web of Science ®Google Scholar
• Garg , V. K. 2002 . Elements of Distributed Computing , Wiley : IEEE Computer Society Press .
   Google Scholar
• Jia. , L. , Rajaraman , R. and Scheideler , C. 2003 . On local algorithms for topology control and routing in ad hoc networks . Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures . June 2003 . pp. 220 – 229 .
   Google Scholar
• Jiang , A. and Bruck , J. Diversity coloring for distributed storage in mobile networks . 2001 . Technical Report, California Institute of Technology
   Google Scholar
• Ko , B.-J. and Rubenstein , D. 2002 . Greedy approach to replicated content placement using graph coloring . SPIE ITCom Conference on Scalability and Traffic Control in IP Networks II . July 2002 , Boston, MA. pp. 289 – 298 .
   Google Scholar
• Kranakis , E. , Singh , H. and Urrutia , J. 1999 . Compass routing on geometric networks . Proceedings of 11th Canadian Conference on Computational Geometry . August 1999 , Vancouver. pp. 51 – 54 .
   Google Scholar
• Li , X.-Y. , Wan , P.-J. , Wang , Y. and Frieder , O. Sparse power efficient topology for wireless networks . J. Parallel and Distributed Computing , to appear
   Google Scholar
• 14. X. -Y. Li, G. Calinescu, P.-J. Wan, and Y. Wang, “Localized delaunay triangulation with application in ad hoc wireless networks,” IEEE Trans. on Par. Dist. Systems, (Modified version of the INFOCOM’2002 paper). 2003. To appear
   Google Scholar
• Li , X.-Y. , Wang , Y. and Frieder , O. Localized routing for wireless ad hoc networks . Proceedings of IEEE ICC .
   Google Scholar
• Marceln-Jimnoz , R. and Rajsbaum , S. 2003 . Cyclic strategies for balanced and fault-tolerant distributed storage . Proceedings LADC 2003: Lecture Notes in Computer Science #2847 . Springer 2003 . pp. 214 – 233 .
   Google Scholar
• Penrose , M. D. 1999 . On k-connectivity for a geometric random graph . Random Structures and Algorithms , 15 : 145 – 164 . [CROSSREF]
   Google Scholar
• Penrose , M. D. 1997 . The longest edge of the random minimal spanning tree . The Annals of Applied Probability , 7 ( 2 ) : 340 – 361 . [CROSSREF]
   Google Scholar
• Perkins , C. E. , ed. 2001 . Ad Hoc Networking , Addison Wesley .
   Google Scholar
• Preparata , F. and Shamos , M. 1985 . Computational geometry, an introduction , Springer-Verlag .
   Google Scholar
• Rabin , M. O. 1989 . Efficient dispersal of information for security, load balancing and fault tolerance . Journal of the ACM , 36 ( 2 ) : 335 – 348 . [CROSSREF]
   Google Scholar
• Rajaraman , R. 2002 . Topology control and routing in ad hoc networks: A Survey . SIGACT News , 33 June : 60 – 73 . [CROSSREF]
   Google Scholar
• Rajsbaum , S. and Urrutia , J. 1999 . Some problems in distributed computational geometry . 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO) . July 1999 , Lacanau, France. Proc. in Informatics 5 , Edited by: Gavoille , C. , Bermond , J-C. and Raspaud , A. pp. 233 – 248 . Carleton Scientific Press . To appear in Theoretical Computer Science
   Google Scholar
• Song , W. -Z. , Wang , Y. and Li , X. -Y. Localized algorithms for energy efficient topology in wireless ad hoc networks . 5th ACM Int. Symp. on Mobile ad hoc Networking and Comp . Tokyo, Japan. pp. 98 – 108 .
   Google Scholar
• Yianilos , P. N. and Sobti , S. 2001 . The Evolving Field of Distributed Storage . IEEE Internet Computing , September–October : 35 – 39 . [CROSSREF]
   Google Scholar