Efficient peer-to-peer lookup in multi-hop wireless networks

KSII Transactions on Internet and Information Systems

Volumn 3, Issue 1, 2009, Pages 5-25

  Shin, Minho ^a   Arbaugh, William A ^b  

^a DARTMOUTH COLLEGE   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Mathematical analysis; Multi hop wireless networks; Peer to peer search; Simulations

Indexed keywords

EID: 66549091710     PISSN: None     EISSN: 19767277     Source Type: Journal    
DOI: 10.3837/tiis.2009.01.001     Document Type: Article

References (43)

1. S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, S. Shenker, "GHT: A Geographic Hash Table for Data-Centric Storage," In Proceedings of the First ACM International Workshop on Wireless Sensor Networks and Applications, Atlanta, GA, 2002.
2. Filipe Araujo and Luus Rodrigues and Jorg Kaiser and Changling Liu and Carlos Mitidieri, "CHR: A Distributed Hash Table for Wireless Ad Hoc Networks," In Proceedings of the Fourth International Workshop on Distributed Event-Based Systems (DEBS) (ICDCSW'05), Washington, DC, USA, 2005.
3. Himabindu Pucha and Saumitra M. Das and Y. Charlie Hu, "Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks," In Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications, 2004.
4. Zahn, Thomas and Schiller, Jochen, "MADPastry: A DHT Substrate for Practicably Sized MANETs," In Proc. of 5th Workshop on Applications and Services in Wireless Networks (ASWN2005), 2005.
5. H. Sozer, M. Tekkalmaz, and I. Korpeoglu, "A peer-to-peer file sharing system for wireless ad-hoc networks," In The Third Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net), 2004.
6. P. Maymounkov and D. Mazieres, "Kademlia: A peer-to-peer information system based on the xor metric," In Proceedings of IPTPS02, Cambridge, USA, Mar. 2002.
7. R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," In SIGCOMM, San Diego, CA, Sept. 2001.
8. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, "A scalable content-addressable network. In SIGCOMM, vol. 31, pp. 161-172, Oct. 2001.
9. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems," In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329-350, Nov. 2001.
10. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz, "Tapestry: A resilient global-scale overlay for service deployment," IEEE Journal on Selected Areas in Communications, vol. 22, no. 1, pp. 41-53, Jan. 2004.
11. R. Bruno, M. Conti, and E. Gregori, "Mesh networks: Commodity multihop ad hoc networks," IEEE Wireless Communications, vol. 43, Mar. 2005.
12. N. Chang and M. Liu, "Revisiting the ttl-based controlled flooding search: optimality and randomization," In Mobi-Com, pp. 85-99, New York, NY, USA, 2004.
13. Z. Cheng and W. B. Heinzelman, "Flooding strategy for target discovery in wireless networks," Wireless Networks, 2005.
14. A. Gamal, J. Mammen, B. Prabhakar, and D. Shah, "Throughput-delay trade-off in wireless networks," In Proceedings of IEEE INFOCOM, 2004.
15. J. Jun and M. Sichitiu, "The nominal capacity of wireless mesh networks," IEEE Wireless Communications, Oct. 2003.
16. J. Li, C. Blake, D. S. D. Couto, H. I. Lee, and R. Morris, "Capacity of ad hoc wireless networks," In MobiCom, pp. 61-69, New York, NY, USA, 2001.
17. M. Castro, P. Druschel, Y. Hu, and A. Rowstron, "Exploiting network proximity in distributed hash tables," FuDiCo, 2002.
18. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Wide-area cooperative storage with cfs," In SOSP, pp. 202-215, New York, NY, USA, 2001.
19. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, "The impact of dht routing geometry on resilience and proximity," In SIGCOMM, pp. 381-394, New York, NY, USA, 2003.
20. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao, "Distributed object location in a dynamic network," In SPAA, pp. 41-52, New York, NY, USA, 2002.
21. C. G. Plaxton, R. Rajaraman, and A. W. Richa, "Accessing nearby copies of replicated objects in a distributed environment," In SPAA, pp. 311-320, New York, NY, USA, 1997.
22. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Topologically-aware overlay construction and server selection," In INFOCOM, 2002.
23. I. Clarke, S. G. Miller, T.W. Hong, O. Sandberg, and B.Wiley, "Protecting free expression online with freenet," IEEE Internet Computing, vol. 6, no. 1, pp. 40-49, 2002.
24. R. Morselli, B. Bhattacharjee, A. Srinivasan, and M. A. Marsh, "Efficient lookup on unstructured topologies," In PODC, pp. 77-86, New York, NY, USA, 2005.
25. P. Ganesan, Q. Sun, and H. Garcia-Molina, "Yappers: A peer-to-peer lookup service over arbitrary topology," In INFOCOM, San Francisco, California, USA, 2003.
26. G. H. L. Fletcher, H. A. Sheth, and K. Brner, "Unstructured peer-to-peer networks: Topological properties and search performance," Lecture Notes in Computer Science, vol. 3601, pp. 14-27, 2005.
27. C. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and replication in unstructured peer-to-peer networks," In Proceedings of the 16th annual ACM International Conference on supercomputing, 2002.
28. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, no. 6684, pp. 440-442, June 1998.
29. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman, "Search in power-law networks," Physical Review, E, vol. 64, no. 4, 2001.
30. M. Penrose, "Random Geometric Graphs," Oxford Studies in Probability, Oxford University Press, USA, July 2003.
31. C. Avin and G. Ercal, "On the cover time and mixing time of random geometric graphs," Theoretical Computer Science, vol. 380 no. 1-2, pp. 2-22, 2007.
32. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Mixing times for random walks on geometric random graphs," SIAM ANALCO, Vancouver, 2005.
33. A. Klemm, C. Lindemann, and O. P. Waldhorst, "A special-purpose peer-to-peer file sharing system for mobile ad hoc networks," in Vehicular Technology Conference (VTC), 2003.
34. A. Duran and C.-C. Shen, "Mobile ad hoc p2p file sharing," In Wireless Communications and Networking Conference 2004, IEEE WCNC, vol. 1, pp. 114-119, 2004.
35. Z. J. Haas, J. Y. Halpern, and L. Li, "Gossip-based ad hoc routing," IEEE/ACM Transactions on Networking, vol. 14, no. 3, pp. 479-491, 2006.
36. C. Lindemann and O. P. Waldhorst, "A distributed search service for peer-to-peer file sharing in mobile applications," In Proceedings of the Second International Conference on Peer-to-Peer Computing, pp. 73, Washington, DC, USA, 2002.
37. S. Aly and A. Elnahas, "Sustained service lookup in areas of sudden dense population," Wireless Communication and Mobile Computing, vol. 8, no. 1, pp. 61-74, Sep. 2006.
38. ns2. http://www.isi.edu/nsnam/ns.
39. Gnutella. http://www.gnutella.com.
40. B. Yang and H. Garcia-Molina, "Efficient search in peer-to-peer networks," In PODC, pp. 77-86, New York, NY, USA, 2005.
41. N. Li, J. Hou, and L. Sha, "Design and analysis of an MST based topology control algorithm," In IEEE INFOCOM, 2003.
42. V. Rodoplu and T. H. Meng, "Minimum energy mobile wireless networks," IEEE JSAC, vol. 17, no. 8, pp. 1333-1344, Aug. 1999.
43. R. Wattenhofer, L. Li, P. Bahl, AND Y.-M. Wang,