Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

DSLM: a decentralized search for large and mobile networks

  • 120 Accesses

  • 2 Citations


As ubiquitous networked devices continue to play an increased role in the daily lives of most people, there is a growing desire to share ever more information and perspectives from across the world. In addition, with the recent technical advancements, the networks have turned to a large-scale wireless networks such as mobile ad hoc networks. However, the problem behind such wireless networks is the difficulty of data distribution and information retrieval in such decentralized and large mobile wireless networks, while still maintaining low overhead. Therefore, we present a system we call decentralized search for large and mobile wireless networks, or DSLM, which: (1) divides the entire network into smaller regions; (2) allows nodes to join, leave, distribute metadata, or make requests; (3) applies the LSH method to map the metadata or request to a geographical region; (4) uses a region-based geographic routing method to route messages between nodes; (5) allows nodes to maintain only a partial view of the network; and (6) applies a relocation method to address mobility issues. We finally demonstrate that our DSLM requires low overhead and could still achieve high retrieval rates and mobility resilience.

This is a preview of subscription content, log in to check access.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18


  1. 1.

    Abid SA, Othman M, Shah N (2014) 3d p2p overlay over manets. Comput Netw 64:89–111

  2. 2.

    Abid SA, Othman M, Shah N (2015) A survey on DHT-based routing for large-scale mobile ad hoc networks. ACM Comput Surv (CSUR) 47(2):20

  3. 3.

    Andoni A, Indyk P (2006) Near-optimal hashing algorithms for near neighbor problem in high dimensions. In: Proceedings of the Symposium on the Foundations of Computer Science, pp 459–468

  4. 4.

    Augustine J, Pandurangan G, Robinson P, Upfal E (2012) Towards robust and efficient computation in dynamic peer-to-peer networks. In: Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, pp 551–569

  5. 5.

    Bianchi S, Felber P, Gradinariu M (2007) Content-based publish/subscribe using distributed r-trees. In: Proceedings of Euro-Par, Rennes, France, August, pp 537–548

  6. 6.

    Binzenhofer A, Leibnitz K (2007) Estimating churn in structured P2P networks. In: Proceedings of the 20th International Teletraffic Conference on Managing Traffic Performance in Converged Networks, Ottawa, Canada, June, pp 630–641

  7. 7.

    Cao Q, Abdelzaher T (2006) Scalable logical coordinates framework for routing in wireless sensor networks. ACM Trans Sens Netw (TOSN) 2(4):557–593

  8. 8.

    Cheng R-H, Huang C (2012) Efficient prediction-based location updating and destination searching mechanisms for geographic routing in mobile ad hoc networks. J Inf Sci Eng 28(1):115–129

  9. 9.

    Chuang Y-T, Wu Q-W (2016) A trustworthy information publication and search system for large-scale & mobile wireless networks. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), p 57. The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp)

  10. 10.

    Chuang Y-T, Wu Q-W (2017) A Trustworthy P2P Retrieval for Dense Mobile Networks. In: Proceedings of the 2017 Annual Meeting of the Decision Sciences Institute, Washington, D.C., USA

  11. 11.

    Clarke I, Sandberg O, Wiley B, Hong T (2001) Freenet: a distributed anonymous information storage and retrieval system. In: Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, July, pp 46–66

  12. 12.

    Demirbas M, Lu X, Singla P (2009) An in-network querying framework for wireless sensor networks. IEEE Trans Parallel Distrib Syst 20(8):1202–1215

  13. 13.

    Feller W (1968) The hypergeometric series. Introd Probab Theory Appl 1:41–45

  14. 14.

    Feller W (1968) An introduction to probability theory and its applications, vol I. Wiley, New York

  15. 15.

    Ferreira RA, Ramanathan MK, Awan A, Grama A, Jagannathan S (2005) Search with probabilistic guarantees in unstructured peer-to-peer networks. In: Proceedings of 5th IEEE International Conference on Peer-to-Peer Computing, Konstanz, Germany, August, pp 165–172

  16. 16.

    Frey H, Stojmenovic I (2010) On delivery guarantees and worst-case forwarding bounds of elementary face routing components in ad hoc and sensor networks. IEEE Trans Comput 59(9):1224–1238

  17. 17.

    Garcia-Luna-Aceves JJ, Spohn M (1999) Source-tree routing in wireless networks. In: Seventh International Conference on Network Protocols, 1999. (ICNP’99) Proceedings. IEEE, pp 273–282

  18. 18.

    Gnutella. http://en.wikipedia.org/wiki/Gnutella

  19. 19.

    Godfrey P, Shenker S, Stoica I (2006) Minimizing churn in distributed systems, vol 36. ACM, New York

  20. 20.

    Gramoli V, Kermarrec A-M, Le Merrer E (2008) Distributed churn measurement in arbitrary networks. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing. ACM, pp 431–431

  21. 21.

    Gupta A, Sahin O, Agrawal D, El Abbadi A(2004) Meghdoot: content-based publish/subscribe over P2P networks. In: Proceedings of the 5th ACM/IFIP/USENIX International Conference on Middleware, Toronto, Canada, October, pp 254–273

  22. 22.

    Ilkhechi AR, Korpeoglu I, Güdükbay U, Ulusoy Ö (2017) Petal: a fully distributed location service for wireless ad hoc networks. J Netw Comput Appl 83:1–11

  23. 23.

    Isdal T, Piatek M, Krishnamurthy A, Anderson T(2010) Privacy preserving P2P data sharing with OneSwarm. In: Proceedings of the ACM SIGCOMM Conference, New Delhi, India, September, pp 111–122

  24. 24.

    Jacquet P, Muhlethaler P, Clausen T, Laouiti A, Qayyum A, Viennot L (2001) Optimized link state routing protocol for ad hoc networks. In: Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century. Proceedings. IEEE International. IEEE, pp 62–68

  25. 25.

    Junhai L, Danxia Y, Liu X, Mingyu F (2009) A survey of multicast routing protocols for mobile ad-hoc networks. IEEE Commun Surv Tutor 11(1):78–91

  26. 26.

    Kuhn F, Schmid S, Wattenhofer R (2010) Towards worst-case churn resistant peer-to-peer systems. Distrib Comput 22(4):249–267

  27. 27.

    Lee S-B, Wong SHY, Lee K-W, Lu S (2013) Content management in a mobile ad hoc network: beyond opportunistic strategy. Int J Commun Netw Distrib Syst 10(2):123–145

  28. 28.

    Leskovec J, Rajaraman A, Ullman JD (2014) Mining of massive datasets, ISO 690. Cambridge University Press, Cambridge

  29. 29.

    Li F, Wu J (2009) Mops: providing content-based service in disruption-tolerant networks. In: 29th IEEE International Conference on Distributed Computing Systems, 2009. ICDCS’09. IEEE, pp 526–533

  30. 30.

    Li J, Jannotti J, De Couto DSJ, Karger DR, Morris R (2000) A scalable location service for geographic ad hoc routing. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking. ACM, pp 120–130

  31. 31.

    Li Y, Yang Y, Lu X (2010) Rules of designing routing metrics for greedy, face, and combined greedy-face routing. IEEE Trans Mob Comput 9(4):582–595

  32. 32.

    Liu H, Liu X, Song W, Wen W (2011) An age-based membership protocol against strong churn in unstructured P2P networks. In: Proceedings of the 2011 International Conference on Network Computing and Information Security, Guilin, China, May, pp 195–200

  33. 33.

    Lu Y, Li X, Yu Y-T, Gerla M (2014) Information-centric delay-tolerant mobile ad-hoc networks. In: 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, pp 428–433

  34. 34.

    Melliar-Smith PM, Moser LE, Michel LI, Chuang YT (2012) iTrust: trustworthy information publication, search and retrieval. In: Proceedings of the 13th International Conference on Distributed Computing and Networking, Hong Kong, China, January, pp 351–366

  35. 35.

    Mischke J, Stiller B (2004) A methodology for the design of distributed search in P2P middleware. IEEE Netw 18(1):30–37

  36. 36.

    Munaretto A, Fonseca M (2007) Routing and quality of service support for mobile ad hoc networks. Comput Netw 51(11):3142–3156

  37. 37.

    Niculescu D, Nath B (2003) Ad hoc positioning system (APS) using AOA. In: INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies. IEEE, vol 3, pp 1734–1743

  38. 38.

    Park VD, Corson MS (1997) A highly adaptive distributed routing algorithm for mobile wireless networks. In: INFOCOM’97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, Proceedings IEEE. IEEE, vol 3, pp 1405–1413

  39. 39.

    Perkins C, Belding-Royer E, Das S (2003) Ad hoc on-demand distance vector (AODV) routing. Technical report

  40. 40.

    Pradittasnee L, Camtepe S, Tian Y-C (2017) Efficient route update and maintenance for reliable routing in large-scale sensor networks. IEEE Trans Ind Inform 13(1):144–156

  41. 41.

    Pruteanu A, Iyer V, Dulman S (2011) Churndetect: a gossip-based churn estimator for large-scale dynamic networks. In: Euro-Par 2011 Parallel Processing. Springer, pp 289–301

  42. 42.

    Pu L, Chen X, Xu J, Fu X (2016) Content retrieval at the edge: a social-aware and named data cooperative framework. IEEE Trans Emerg Top Comput. doi:10.1109/TETC.2016.2581704

  43. 43.

    Rangarajan H, Garcia-Luna-Aceves JJ (2007) Efficient use of route requests for loop-free on-demand routing in ad hoc networks. Comput Netw 51(6):1515–1529

  44. 44.

    Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network, vol 31. ACM, New York

  45. 45.

    Ratnasamy S, Karp B, Shenker S, Estrin D, Govindan R, Yin L, Yu F (2003) Data-centric storage in sensornets with GHT, a geographic hash table. Mob Netw Appl 8(4):427–442

  46. 46.

    Risson J, Moors T (2006) Survey of research towards robust peer-to-peer networks: search methods. Comput Netw Int J Comput Telecommun Netw 50(17):3485–3521

  47. 47.

    Ritchie L, Yang H-S, Richa AW, Reisslein M (2006) Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance. IEEE Trans Mob Comput 5(6):653–667

  48. 48.

    Rowstron A, Druschel P (2001) Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms and Open Distributed Processing. Springer, pp 329–350

  49. 49.

    Samar P, Pearlman MR, Haas ZJ (2004) Independent zone routing: an adaptive hybrid routing framework for ad hoc wireless networks. IEEE/ACM Trans Netw (TON) 12(4):595–608

  50. 50.

    Scheideler C, Schmid S (2009) A distributed and oblivious heap. In: Albers S, Marchetti-Spaccamela A, Nikoletseas S, Thomas W (eds) Automata, languages and programming. Springer, Berlin, pp 571–582

  51. 51.

    Schiper A, Toueg S (2006) From set membership to group membership: a separation of concerns. IEEE Trans Dependable Secure Comput 3(1):2–12

  52. 52.

    Shah N, Qian D (2011) An efficient unstructured p2p overlay over manet using underlying proactive routing. In: 2011 Seventh International Conference on Mobile Ad-Hoc and Sensor Networks (MSN). IEEE, pp 248–255

  53. 53.

    Sharma P, Souza D, Fiore E, Gottschalk J, Marquis D (2012) A case for manet-aware content centric networking of smartphones. In: 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM). IEEE, pp 1–6

  54. 54.

    Shen H, Li Z, Chen K (2014) A scalable and mobility-resilient data search system for large-scale mobile wireless networks. IEEE Trans Parallel Distrib Syst 25(5):1124–1134

  55. 55.

    Shen H, Zhao L, Li Z (2011) A distributed spatial-temporal similarity data storage scheme in wireless sensor networks. IEEE Trans Mob Comput 10(7):982–996

  56. 56.

    Sivakumar R, Sinha P, Bharghavan V (1999) CEDAR: a core-extraction distributed ad hoc routing algorithm. IEEE J Sel Areas Commun 17(8):1454–1465

  57. 57.

    Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, San Diego, CA, August, pp 149–160

  58. 58.

    Terpstra WW, Kangasharju J, Leng C, Buchmann AP (2007) Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search. In: Proceedings of the ACM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, Kyoto, Japan, August, pp 49–60

  59. 59.

    Tran DA, Pham C (2010) Enabling content-based publish/subscribe services in cooperative P2P networks. Comput Netw Int J Comput Telecommun Netw 52(11):1739–1749

  60. 60.

    Voulgaris S, Gavidia D, Van Steen M (2005) CYCLON: inexpensive membership management for unstructured P2P overlays. J Netw Syst Manag 13(2):197–217

  61. 61.

    Wei W, Song H, Li W, Shen P, Vasilakos A (2017) Gradient-driven parking navigation using a continuous information potential field based on wireless sensor network. Inf Sci 408:100–114

  62. 62.

    Wong B, Guha S (2008) Quasar: a probabilistic publish-subscribe system for social networks. In: Proceedings of the 7th International Workshop on Peer-to-Peer Systems, Tampa Bay, FL, February

  63. 63.

    Xia Z, Wang X, Zhang L, Qin Z, Sun X, Ren K (2016) A privacy-preserving and copy-deterrence content-based image retrieval scheme in cloud computing. IEEE Trans Inf Forens Secur 11(11):2594–2608

  64. 64.

    Xie Y, Wu L, Kumar N, Shen J (2017) Analysis and improvement of a privacy-aware handover authentication scheme for wireless network. Wirel Pers Commun 93(2):523–541

  65. 65.

    Xu J, Tang X, Lee W-C (2008) A new storage scheme for approximate location queries in object-tracking sensor networks. IEEE Trans Parallel Distrib Syst 19(2):262–275

  66. 66.

    Zage D, Livadas C, Schooler EM (2009) A network-aware distributed membership protocol for collaborative defense. In: Proceedings of the International Conference on Computational Science and Engineering, Vancouver, Canada, August, pp 1123–1130

  67. 67.

    Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz JD (2004) Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Areas Commun 22(1):41–53

  68. 68.

    Zhao Y, Chen Y, Li B, Zhang Q (2007) Hop ID: A virtual coordinate based routing for sparse mobile ad hoc networks. IEEE Trans Mob Comput 6(9):1075–1089

  69. 69.

    Zhou J, Liu L, Liao G, Lu J (2013) Predictive and fault-tolerant location service in mobile ad hoc networks. Wirel Pers Commun 71(4):3115–3130

  70. 70.

    Zwillinger D (2011) CRC standard mathematical tables and formulae. CRC Press, Boca Raton

Download references


This research is supported by MOST 104-2410-H-194-090-MY2 and MOST 106-2410-H-194-027-MY2 of Ministry of Science and Technology, Taiwan.

Author information

Correspondence to Yung-Ting Chuang.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Chuang, Y., Yu, C. & Wu, Q. DSLM: a decentralized search for large and mobile networks. J Supercomput 74, 738–767 (2018). https://doi.org/10.1007/s11227-017-2158-8

Download citation


  • Peer-to-peer
  • Distributed search and retrieval
  • Mobile ad hoc networks
  • Probabilistic analysis
  • Network churn
  • Wireless sensor networks