Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

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

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

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.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Ashwin M, Kamalraj S, Azath M (2016) Weighted Clustering Trust Model for Mobile Ad Hoc Networks. Wirel Pers Commun 94(4):1–10

    Google Scholar 

  2. Chen IR, Guo J (2015) Hierarchical trust management of community of interest groups in mobile ad hoc networks. Ad Hoc Netw 33:154–167

    Article  Google Scholar 

  3. Xu L, Wang J, Liu Y et al (2018) Outage Performance for IDF Relaying Mobile Cooperative Networks. Mobile Networks & Applications 23(6):1496–1501

    Article  Google Scholar 

  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–1143

    Article  Google Scholar 

  5. Waluyo AB, Taniar D, Rahayu W et al (2017) Trustworthy data delivery in mobile P2P network. J Comp Syst Sci 86:33–48

    Article  MathSciNet  MATH  Google Scholar 

  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–20

    Article  MathSciNet  MATH  Google Scholar 

  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–58

    Article  Google Scholar 

  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–184

  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–518

    Article  Google Scholar 

  10. Sarma AD, Molla AR, Pandurangan G (2015) Efficient random walk sampling in distributed networks. J Parallel Distrib Comput 77:84–94

    Article  Google Scholar 

  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–67

    Article  MathSciNet  MATH  Google Scholar 

  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–99

  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–452

    Article  Google Scholar 

  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–3389

  15. Hao L, Xuelong Z (2017) Efficient Resource Search Mechanism in Selfish Mobile Peer-to-Peer Network. J syst simul 29(5):1093–1102

    Google Scholar 

  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–408

  17. Kantere V, Tsoumakos D, Sellis T et al (2009) GrouPeer: Dynamic clustering of P2P databases. Inf Syst 34(1):62–86

    Article  Google Scholar 

  18. Seddiki M, Benchaïba M (2016) 2P-Lookup: Popularity and Proximity based P2P Lookup mechanism over MANETs. J Netw Comput Appl 71:181–193

    Article  Google Scholar 

  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–1454

    Google Scholar 

  20. Henderson T, Kotz D, Abyzov I (2008) The changing usage of a mature campus-wide wireless network. Comput Netw 52(14):2690–2712

    Article  MATH  Google Scholar 

  21. Orlinski M, Filer N (2013) The rise and fall of spatio-temporal clusters in mobile ad hoc networks. Ad Hoc Netw 11:1641–1654

    Article  Google Scholar 

  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–330

    Article  Google Scholar 

  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 Issues

  24. Atsan E, Özkasap Ö (2013) SCALAR: Scalable data lookup and replication protocol for mobile ad hoc networks. Comput Netw 57:3654–3672

    Article  Google Scholar 

  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–146

    Article  Google Scholar 

  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–2100

    Article  Google Scholar 

  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–1884

    Article  Google Scholar 

  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–192

  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–935

    Article  Google Scholar 

  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–14

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Dalian University of Technology, No. 2, Linggong Road, Dalian, 116024, China

    Xianfu Meng & Yu Deng

Authors
  1. Xianfu Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xianfu Meng.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Meng, X., Deng, Y. A time-aware resource search strategy with the ant colony optimization in MANETs. Peer-to-Peer Netw. Appl. 12, 1013–1027 (2019). https://doi.org/10.1007/s12083-019-00750-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-019-00750-2

Keywords

Search

Navigation