A time-aware resource search strategy with the ant colony optimization in MANETs

  • Xianfu MengEmail author
  • Yu Deng


With the increasing application of mobile devices, such as smart phones, the mobile ad hoc networks (i.e. MANETs) have been a hot research topic, in which how to effectively and efficiently search resources in MANETs attracts much attention. Due to peers’ short wireless transmission range and strong mobility, the existing approaches suffer from the problem of lower search efficiency. This paper proposes a resource search strategy with the ant colony optimization, tieSearch, where we use the time-aware neighbor peer’s availability and the time-aware neighbor peer’s resource preferences as the pheromones to guide the ants to the holders of the requested resources under the finding that most peers’ movements change regularly on a daily basis in the MANET environments. We detail the calculations of the abovementioned two types of pheromones, including their initial value settings, their increment updates and their attenuations. Also, we discuss the handling approach to alleviate the impact of peers’ random churn on the resource search efficiency. The simulation results show that the tieSearch strategy outperforms other strategies in terms of the successful search rate, the traffic overhead and the search time.


Resource search Peer’s availability Peer’s resource preferences Time-aware Ant colony MANET 



  1. 1.
    Ashwin M, Kamalraj S, Azath M (2016) Weighted Clustering Trust Model for Mobile Ad Hoc Networks. Wirel Pers Commun 94(4):1–10Google Scholar
  2. 2.
    Chen IR, Guo J (2015) Hierarchical trust management of community of interest groups in mobile ad hoc networks. Ad Hoc Netw 33:154–167CrossRefGoogle Scholar
  3. 3.
    Xu L, Wang J, Liu Y et al (2018) Outage Performance for IDF Relaying Mobile Cooperative Networks. Mobile Networks & Applications 23(6):1496–1501CrossRefGoogle Scholar
  4. 4.
    Tarique M, Tepe KE, Adibi S et al (2009) Survey of multipath routing protocols for mobile ad hoc networks. J Netw Comput Appl 32(6):1125–1143CrossRefGoogle Scholar
  5. 5.
    Waluyo AB, Taniar D, Rahayu W et al (2017) Trustworthy data delivery in mobile P2P network. J Comp Syst Sci 86:33–48MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Agustinus BW, David T, Wenny R et al (2013) Mobile peer-to-peer data dissemination in wireless ad-hoc networks. Inf Sci 230:3–20MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Sasaki Y, Hara T, Nishio S (2014) Top-k query processing for replicated data in mobile peer to peer networks. J Syst Softw 92(6):45–58CrossRefGoogle Scholar
  8. 8.
    Lacuesta R, Penalver L, Fernandez-Sanz L et al (2009) Software Requirements for Ubiquitous Ad Hoc Mobile Networks: An Example of a Bluetooth Application. International Conference on Software Engineering Advances. IEEE, 179–184Google Scholar
  9. 9.
    Arunachalam A, Sornil O (2015) Issues of Implementing Random Walk and Gossip Based Resource Discovery Protocols in P2P MANETs & Suggestions for Improvement. Proc Comput Sci 57:509–518CrossRefGoogle Scholar
  10. 10.
    Sarma AD, Molla AR, Pandurangan G (2015) Efficient random walk sampling in distributed networks. J Parallel Distrib Comput 77:84–94CrossRefGoogle Scholar
  11. 11.
    Pu IM, Stamate D, Shen Y (2014) Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks. J Discrete Algorithms 24:59–67MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Xu D, Nahrstedt K, Wichadakul D (2001) QoS-Aware Discovery of Wide-Area Distributed Services. IEEE/ACM International Symposium on CLUSTER Computing and the Grid, 2001. Proceedings. IEEE, 92–99Google Scholar
  13. 13.
    Liang JC, Chen JC, Zhang T (2011) An adaptive low-overhead resource discovery protocol for mobile ad-hoc networks. Wirel Netw 17(2):437–452CrossRefGoogle Scholar
  14. 14.
    Mei H, Zhang Y, Meng X (2014) A path tracking search algorithm based on the credibility of node service ability. Wireless Communications and NETWORKING Conference. IEEE, 3385–3389Google Scholar
  15. 15.
    Hao L, Xuelong Z (2017) Efficient Resource Search Mechanism in Selfish Mobile Peer-to-Peer Network. J syst simul 29(5):1093–1102Google Scholar
  16. 16.
    Mondal A, Madria SK, Kitsuregawa M (2006) CLEAR: an efficient context and location-based dynamic replication scheme for mobile-p2p networks. International Conference on Database and Expert Systems Applications. Springer-Verlag, 399–408Google Scholar
  17. 17.
    Kantere V, Tsoumakos D, Sellis T et al (2009) GrouPeer: Dynamic clustering of P2P databases. Inf Syst 34(1):62–86CrossRefGoogle Scholar
  18. 18.
    Seddiki M, Benchaïba M (2016) 2P-Lookup: Popularity and Proximity based P2P Lookup mechanism over MANETs. J Netw Comput Appl 71:181–193CrossRefGoogle Scholar
  19. 19.
    Zhang H, Jin H, Nie JW et al (2006) Dual-Chord:a More Effective Distribute Hash Table. J Chinese Comput Syst 27(8):1450–1454Google Scholar
  20. 20.
    Henderson T, Kotz D, Abyzov I (2008) The changing usage of a mature campus-wide wireless network. Comput Netw 52(14):2690–2712CrossRefzbMATHGoogle Scholar
  21. 21.
    Orlinski M, Filer N (2013) The rise and fall of spatio-temporal clusters in mobile ad hoc networks. Ad Hoc Netw 11:1641–1654CrossRefGoogle Scholar
  22. 22.
    Ma W, Fang Y, Lin P (2007) Mobility management strategy based on user mobility patterns in wireless networks. IEEE Trans Veh Technol 56(1):322–330CrossRefGoogle Scholar
  23. 23.
    Nayeem MT, Tanvee MM, Hoque R et al (2011) A New Clustering Scheme for Peer-to-Peer File Searching in MANET. International Journal of Computer Science IssuesGoogle Scholar
  24. 24.
    Atsan E, Özkasap Ö (2013) SCALAR: Scalable data lookup and replication protocol for mobile ad hoc networks. Comput Netw 57:3654–3672CrossRefGoogle Scholar
  25. 25.
    Pushpalatha M, Ramarao T, Venkataraman R (2014) Applicability of sub graph centrality to improve data accessibility among peers in MANETs. Peer-to-peer networking and applications 7:129–146CrossRefGoogle Scholar
  26. 26.
    Vijayalakshmi P, Francis S, Dinakaran J (2016) A robust energy efficient ant colony optimization routing algorithm for multi-hop ad hoc networks in MANETs. Wirel Netw 22(6):2081–2100CrossRefGoogle Scholar
  27. 27.
    Singh G, Kumar N, Verma A (2014) OANTALG: An Orientation Based Ant Colony Algorithm for Mobile Ad Hoc Networks. Wirel Pers Commun 77(3):1859–1884CrossRefGoogle Scholar
  28. 28.
    Rehman RA, Hieu TD, Bae HM et al (2016) Robust and Efficient Multipath Interest Forwarding for NDN-based MANETs. 2016 9th Ifip Wireless and Mobile Networking Conference, Colmar, France, Jul 11–13, 187–192Google Scholar
  29. 29.
    Hsiao H-C, Su H-W (2012) On optimizing overlay topologies for search in unstructured peer-to-peer networks. IEEE Trans Parallel Distrib Syst 23(5):924–935CrossRefGoogle Scholar
  30. 30.
    Meng X, Wang Y, Gong Y (2015) Perspective of space and time based replica population organizing strategy in unstructured peer-to-peer networks. J Netw Comput Appl 49:1–14CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.School of Computer Science and TechnologyDalian University of TechnologyDalianChina

Personalised recommendations