Skip to main content
Log in

Self-adaptive query-broadcast in wireless ad-hoc networks using fuzzy best worst method

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Various broadcasting schemes have been proposed for a unified routing approach in Wireless Adhoc Networks. In their efforts, the researchers mostly aim to minimize the routing-overheads including overfilling of query, routing delay and energy-drain. The routing overheads are minimized using either repeated broadcast or canceling the query-broadcast. On one hand broadcast cancellation methods work based on query-chasing, which creates an extra routing-overhead. On the other hand routing cache based query-broadcast techniques are not adaptive with mobility of target nodes giving rise to unreachability problem. Both types of approaches pose the increased energy-drain and ultimately slow down the route-discovery . These limitations in particular, have motivated us to propose a dynamic request-zone approach for query-broadcasting based on routing-cache. In order to counter the destination unreachability problem, a combined weight metric is used, which is defined as a multi-criteria decision making problem. Later defined problem is solved to compute the weights using extended fuzzy best-worst method. Furthermore the performance of proposed approach is evaluated in terms of query-diffusion, route-latency, and energy-saving.

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

Access this article

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

Similar content being viewed by others

Notes

  1. A search region consisting of participating nodes is called request-zone.

  2. Please see full abbreviations

  3. Ring represents a nodes lies on an imaginary circle centered at source-node

  4. Please find the full abbreviation of techniques.

Abbreviations

FRESH:

Fresher encounter search

DREAM:

Distance routing effect algorithm for mobility

LAR:

Location aided routing

HoWL:

Hop-wise limited broadcast

MPRs:

Multipoint

WRS:

Weighted rough set based broadcast

LCA:

Linked cluster algorithm

WCA:

Weighted clustering algorithm

DMAC:

Distributed and mobility-adaptive clustering

DWCA:

Distributed weighted clustering algorithm

CMBER+:

Cluster based modified blocking expanding ring search

LEACH:

Low energy adaptive clustering hierarchy

HEED:

Hybrid energy-efficient distributed clustering

EEHC:

Energy efficient hierarchical clustering

DWEHC:

Distributed weight-based energy-efficient hierarchical clustering

MOCA:

Multi-hop overlapping clustering algorithm

VCBRP:

VANET clustering based routing protocol

ECRP:

Energy-aware cluster-based routing protocol

HBPR:

History-based prediction routing

References

  1. Ahmad, N., & Hussain, S.Z. (2013). Performance analysis of adaptive routing protocol based on different mobility model with varying network size.

  2. Ahmad, N., & Sethi, S. (2019). An overview of query-broadcasting techniques in ad hoc networks. In: Mobile Computing. IntechOpen

  3. Zhang, D., Zhang, T., & Liu, X. (2019). Novel self-adaptive routing service algorithm for application in vanet. Applied Intelligence, 49(5), 1866–1879.

    Article  Google Scholar 

  4. Park, I., Kim, J., & Pu, I., et al. (2006) . Blocking expanding ring search algorithm for efficient energy consumption in mobile ad hoc networks. In WONS 2006: third annual conference on wireless on-demand network systems and services (pp. 191–195).

  5. Ahmad, N., & Hussain, S. Z. (2015). Broadcast expenses controlling techniques in mobile ad-hoc networks: A survey. Journal of King Saud University-Computer and Information Sciences, 30, 67.

    Google Scholar 

  6. Alaoui, E. A. A., Zekkori, H., & Agoujil, S. (2019). Hybrid delay tolerant network routing protocol for heterogeneous networks. Journal of Network and Computer Applications, 148, 102456.

    Article  Google Scholar 

  7. Ahmad, N., & Hussain, S. Z. (2018). Analytical comparisons of query-broadcast repealing schemes in manets. Telecommunication Systems (TELS), 70(1), 67–79.

    Article  Google Scholar 

  8. Ahmad, N., Sethi, S., & Ahmed, M. (2020). Cache-aware query-broadcast to improve qos of routing protocols in manets. Wireless Personal Communications, 2020, 1–18.

    Google Scholar 

  9. Castañeda, R., Das, S. R., & Marina, M. K. (2002). Query localization techniques for on-demand routing protocols in ad hoc networks. Wireless Network, 8(2/3), 137–151.

    Article  Google Scholar 

  10. Ali, A., & Rashid, T. (2019). Hesitant fuzzy best-worst multi-criteria decision-making method and its applications. International Journal of Intelligent Systems, 34(8), 1953–1967.

    Article  Google Scholar 

  11. Guo, S., & Zhao, H. (2017). Fuzzy best-worst multi-criteria decision-making method and its applications. Knowledge-Based Systems, 121, 23–31.

    Article  Google Scholar 

  12. Karimi, H., Sadeghi-Dastaki, M., & Javan, M. (2020). A fully fuzzy best-worst multi attribute decision making method with triangular fuzzy number: A case study of maintenance assessment in the hospitals. Applied Soft Computing, 86, 105882.

    Article  Google Scholar 

  13. Khanmohammadi, E., Zandieh, M., & Tayebi, T. (2019). Drawing a strategy canvas using the fuzzy best-worst method. Global Journal of Flexible Systems Management, 20(1), 57–75.

    Article  Google Scholar 

  14. Moslem, S., Gul, M., Farooq, D., Celik, E., Ghorbanzadeh, O., & Blaschke, T. (2020). An integrated approach of best-worst method (bwm) and triangular fuzzy sets for evaluating driver behavior factors related to road safety. Mathematics, 8(3), 414.

    Article  Google Scholar 

  15. Tonguz, O.K., Wisitpongphan, N., Parikh, J.S., Bai, F., Mudalige, P., & Sadekar, V.K. (2006). On the broadcast storm problem in ad hoc wireless networks. In 3rd International conference on broadband communications, networks and systems, 2006. BROADNETS 2006 (pp. 1–11). IEEE.

  16. Chang, N., & Liu, M. (2004) . Revisiting the ttl-based controlled flooding search: Optimality and randomization. In Proceedings of the 10th annual international conference on Mobile computing and networking (pp. 85–99). ACM.

  17. Al-Rodhaan, M. A., Mackenzie, L., & Ould-Khaoua, M. (2008). Improvement to blocking expanding ring search for manets. Dept of Computing Science, University of Glasgow, Glasgow, UK, 2008, 1–13.

    Google Scholar 

  18. Zeeshan, S., H., Naeem, A. (2014) . Cluster based controlling of route exploring packets in ad-hoc networks. In Proceedings of the 2nd international conference on advanced computing, networking, and informatics, ICACNI’14 (vol. 28, pp. 103–112). Smart Innovation, Systems and Technologies,Springer Verlag.

  19. Baker, D. J. A. E. (1981). The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications, 29(11), 1694–1701.

    Article  Google Scholar 

  20. Chatterjee, M., Das, S., & Turgut, D. (2002). Wca: A weighted clustering algorithm for mobile ad hoc networks. Cluster Computing, 5(2), 193–204.

    Article  Google Scholar 

  21. Basagni, S. (1999). Distributed clustering for ad hoc networks. In Proceedings fourth international symposium on parallel architectures, algorithms, and networks (I-SPAN’99) (pp. 310–315). IEEE

  22. Choi, W., & Woo, M. (2006) . A distributed weighted clustering algorithm for mobile ad hoc networks. In Proceeding of advanced international conference on telecommunications/international conference on internet and web applications and services, AICT-ICIW’06 (pp. 73–73). IEEE.

  23. Hussain, S.Z., & Ahmad, N. (2017). Minimizing broadcast expenses in clustered ad-hoc networks. Journal of King Saud University-Computer and Information Sciences. http://www.sciencedirect.com/science/article/pii/S1319157816300258.

  24. Heinzelman, W. B., & Chandrakasan, A. P. (2002). Application specific protocol architecture for wireless microsensor networks. IEEE Transactions on Communications, 1(4), 660–670.

    Google Scholar 

  25. McDonald, A. B., & Znati, T. F. (1999). A mobility-based framework for adaptive clustering in wireless ad hoc networks. IEEE Journal on Selected Areas in communications, 17(8), 1466–1487.

    Article  Google Scholar 

  26. Younis, O., & Fahmy, S. (2004). Heed: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Transactions on Mobile Computing, 3(4), 366–379.

    Article  Google Scholar 

  27. Bandyopadhyay, S., E.C. (2003) . An energy efficient hierarchical clustering algorithm for wireless sensor networks. In Proceedings of 22nd annual joint conference of the IEEE computer and communications societies (INFOCOM 2003). IEEE, San Francisco, California (April ).

  28. Ding, P., Holliday, J., & Celik, A. (2005) . Distributed energy-efficient hierarchical clustering for wireless sensor networks. In International conference on distributed computing in sensor systems (pp. 322–339). Springer

  29. Youssef, A., Younis, M. M.Y.A.A. (2006) . Distributed formation of overlapping multi-hop clusters in wireless sensor networks. In Proceedings of the 49th annual IEEE global communication conference (Globecom’06) San Francisco, CA. IEEE.

  30. Nasr, M., Mohsen, M., Abdelgader, A. M. S., Wang, Z. G., & Shen, L. F. (2016). Vanet clustering based routing protocol suitable for deserts. Sensors, 16(4), 478.

    Article  Google Scholar 

  31. Nagpal, R. (1998). An algorithm for group formation in an amorphous. In Computer, international conference on parallel and distributed computing and systems (PDCS). Citeseer.

  32. Moussa, N., Hamidi-Alaoui, Z., & El Alaoui, A.E.B. (2020). Ecrp: an energy-aware cluster-based routing protocol for wireless sensor networks. Wireless Networks, pp. 1–14

  33. Amis, A.D., & Prakash, R., T.V.D.H. (2000). Max-min dcluster formation in wireless ad hoc networks. In Proceedings of IEEE INFOCOM. IEEE (March).

  34. Sharma, D. K., Dhurandher, S. K., Agarwal, D., & Arora, K. (2019). krop: k-means clustering based routing protocol for opportunistic networks. Journal of Ambient Intelligence and Humanized Computing, 10(4), 1289–1306.

    Article  Google Scholar 

  35. Gargano, L., & Hammar, M. (2004). Limiting flooding expenses in on-demand source-initiated protocols for mobile wireless networks. In Proceedings of the 18th international parallel and distributed processing symposium, 2004 (p. 220). IEEE.

  36. Lima, R., Baquero, C., & Miranda, H. (2013). Broadcast cancellation in search mechanisms. In Proceedings of the 28th annual ACM symposium on applied computing (pp. 548–553). SAC ’13, ACM, New York, NY, USA.

  37. Pu, I.M., & Shen, Y. (2009) . Enhanced blocking expanding ring search in mobile ad hoc networks. In 2009 3rd international conference on new technologies, mobility and security (NTMS) (pp. 1–5). IEEE

  38. Pu, I. M., Stamate, D., & Shen, Y. (2014). Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks. Journal of Discrete Algorithms, 24, 59–67.

    Article  MathSciNet  Google Scholar 

  39. Ahmad, N., & Hussain, S. Z. (2017). Power saving technique for controlled broadcast of query packet in manets. International Journal of Mobile Network Design and Innovation, 7(3), 281–293.

    Google Scholar 

  40. Waqas, A. (2020) . Interference aware route discovery in wireless mobile ad hoc networks. In Wireless Personal Communications (pp. 1–10).

  41. Guirguis, A., Karmoose, M., Habak, K., El-Nainay, M., & Youssef, M. (2018). Cooperation-based multi-hop routing protocol for cognitive radio networks. Journal of Network and Computer Applications, 110, 27–42.

    Article  Google Scholar 

  42. Zhang, D.g., Tang, Y.m., Cui, Y.y., Gao, J.x., Liu, X.h., & Zhang, T. (2018) . Novel reliable routing method for engineering of internet of vehicles based on graph theory. Engineering Computations

  43. Dubois-Ferriere, H., Grossglauser, M., & Vetterli, M. (2003). Age matters: Efficient route discovery in mobile ad hoc networks using encounter ages. In Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing (pp. 257–266). ACM.

  44. Basagni, S., Chlamtac, I., Syrotiuk, V.R., & Woodward, B.A. (1998). A distance routing effect algorithm for mobility (dream). In Proceedings of the 4th annual ACM/IEEE international conference on mobile computing and networking (pp. 76–84). MobiCom ’98, ACM.

  45. Ko, Y. B., & Vaidya, N. H. (2000). Location-aided routing (lar) in mobile ad hoc networks. Wireless Networks, 6(4), 307–321.

    Article  Google Scholar 

  46. Minematsu, M., Saito, M., Hiroto, A., & Tokuda, H. (2005). Efficient route discovery scheme in ad hoc networks using routing history. IEICE Transactions on Communications, 88(3), 1017–1025.

    Article  Google Scholar 

  47. Preetha, K., Unnikrishnan, A., & Jacob, K. P. (1820) . A probabilistic approach to reduce the route establishment overhead in aodv algorithm for manet. CoRR, 1204, 207–214.

    Google Scholar 

  48. Qayyum, A., Viennot, L., & Laouiti, A. (2002) . Multipoint relaying for flooding broadcast messages in mobile wireless networks. In Proceedings of the 35th annual hawaii international conference on system sciences, HICSS’02 (pp. 3866–3875). IEEE.

  49. Aitha, N., & Srinadas, R. (2009) . A strategy to reduce the control packet load of aodv using weighted rough set model for manet. In: The International Arab Journal of Information Technology (2009)

  50. Zhang, D.g., Gao, J.x., Liu, X.h., Zhang, T., & Zhao, D.x., (2019). Novel approach of distributed & adaptive trust metrics for manet. Wireless Networks, 25(6), 3587–3603.

  51. Rezaei, J. (2015). Best-worst multi-criteria decision-making method. Omega, 53, 49–57.

    Article  Google Scholar 

  52. Saaty, T. L. (2005). Analytic hierarchy process. Encyclopedia of Biostatistics, vol. 1.

  53. Asadabadi, M. R., Chang, E., Zwikael, O., Saberi, M., & Sharpe, K. (2020). Hidden fuzzy information: Requirement specification and measurement of project provider performance using the best worst method. Fuzzy Sets and Systems, 383, 127–145.

    Article  MathSciNet  Google Scholar 

  54. Gupta, H., & Barua, M. K. (2016). Identifying enablers of technological innovation for indian msmes using best-worst multi criteria decision making method. Technological Forecasting and Social Change, 107, 69–79.

    Article  Google Scholar 

  55. Mi, X., Tang, M., Liao, H., Shen, W., & Lev, B. (2019). The state-of-the-art survey on integrations and applications of the best worst method in decision making: Why, what, what for and what’s next? Omega, 87, 205–225.

    Article  Google Scholar 

  56. Zadeh, L. A. (1965). Fuzzy sets. Information and control, 8(3), 338–353.

    Article  MathSciNet  Google Scholar 

  57. Bellman, R. E., & Zadeh, L. A. (1970). Decision-making in a fuzzy environment. Management Science, 17(4), 141.

    Article  MathSciNet  Google Scholar 

  58. Allahviranloo, T., Lotfi, F. H., Kiasary, M. K., Kiani, N., & Alizadeh, L. (2008). Solving fully fuzzy linear programming problem by the ranking function. Applied mathematical sciences, 2(1), 19–32.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Naeem Ahmad.

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

Ahmad, N., Hasan, M.G. Self-adaptive query-broadcast in wireless ad-hoc networks using fuzzy best worst method. Wireless Netw 27, 765–780 (2021). https://doi.org/10.1007/s11276-020-02477-y

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-020-02477-y

Keywords

Navigation