Skip to main content

Honest Forwarding Node Selection with Less Overhead and Stable Path Formation in MANET

  • Conference paper
  • First Online:
  • 869 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 750))

Abstract

Mobile Ad hoc Network (MANET) has paid considerable attention to wireless communication. MANET is an autonomous collection of self-deployed nodes without any pre-existing infrastructures and nodes are movable that also act as routers. The main characteristics of MANETs are lack of centralized control, lack of association among nodes, rapid mobility of hosts, frequent dynamically varying network topology, shared broadcast radio channel, insecure operating environment, physical vulnerability and limited availability of resources, such as battery power, and bandwidth. In multicast routing, forwarding nodes are chosen by the designed protocol to be present in the path between sender and receiver. Here, sender and receiver can also be a forwarder node. Flooding and ratio of forwarding nodes change must be limited to reduce overhead. To increase security, the estimation of honesty of nodes is significant. The previous work ODMRP-EFNRLP tries to minimize overhead through minimizing redundant data delivery, prediction of link failure and energy-aware node selection. This paper searches On-Demand Multicast Routing Protocol design and the possible fuzzy optimization. In this paper, attacker detection is tested using multi-agent classification to update node’s honesty for decision-making. Its results are evaluated. During the evaluation test, the results validate the progress.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Cesnavicius, E., Jahn, C.: Broadcasting & Multicasting in IP Networks, 26 July, 2004 (http://www2.cs.uni-paderborn.de/cs/ag-madh/WWW/Teaching/2004SS/AlgInternet/Submissions/13-broadcasting-and-multicasting-in-ip-networks.pdf)

  2. Lazos, L., Poovendran, R.: Power proximity based key management for secure multicast in ad hoc networks. Wirel. Netw. 13(1), 127–148 (2007)

    Article  Google Scholar 

  3. Zhu, T., Xiao, S., Ping, Y., Towsley, D., Gong, W.: A secure energy routing mechanism for sharing renewable energy in smart microgrid. In: IEEE Conference on Smart Grid Communication (SmartGridComm), Brussels, Belgium, 17–20 Oct 2011

    Google Scholar 

  4. Chen, I.-R., Guo, J., Bao, F., Cho, J.-H.: Trust management in mobile ad hoc networks for bias minimization and application performance maximization. Ad Hoc Netw. 19, pp. 59–74 (2014)

    Google Scholar 

  5. Kaur, A., Kang, S.S.: Comparative analysis of secure and energy efficient routing protocols in wireless sensor network. Int. J. Eng. Comput. Sci. 3(9), 8389–8393 (2014)

    Google Scholar 

  6. Guo, S., Yang, O.: Minimum energy multicast routing for wireless ad-hoc networks with adaptive antennas. In: Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP’04), Berlin, Germany, pp. 151–160, 05–08 Oct 2004

    Google Scholar 

  7. Adhvaryu, K.U., Kamboj, P.: Multicast routing protocols with low overhead for MANET. Int. J. Eng. Dev. Res. (IJEDR), 1(1), pp. 1–4 (2013)

    Google Scholar 

  8. Han, K., Liu, Y., Luo, J.: Duty-cycle-aware minimum-energy multicasting in wireless sensor networks. IEEE/ACM Trans. Netw. 21(3), 910–923 (2013)

    Article  Google Scholar 

  9. Andreev, K., Maggs, B.M., Meyerson, A., Sitaraman, R.K.: Designing overlay multicast networks for streaming. In: Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)’03, San Diego, California, USA, 7–9 June 2003

    Google Scholar 

  10. Fernandes, L.L.: Secure Routing in Wireless Sensor Networks. Report. University of Trento (2007)

    Google Scholar 

  11. Simon, Santhosh, Paulose Jacob, K.: Energy optimized secure routing protocol for wireless sensor networks. Int. J. Eng. Innov. Technol. (IJEIT) 3(4), 72–80 (2013)

    Google Scholar 

  12. Xia, H., Yu, J., Pan, Z.-K., Cheng, X.-G., Sha, E.H.M.: Applying trust enhancements to reactive routing protocols in mobile ad hoc networks. Wirel. Netw. 22(7), 2239–2257 (2016)

    Article  Google Scholar 

  13. Cho, J.-H., Chen, I.-R., Chan, K.S.: Trust threshold based public key management in mobile ad hoc networks. Ad hoc Netw. 44(Issue C), 58–75 (2016)

    Google Scholar 

  14. Borkar, G.M., Mahajan, A.R.: A secure and trust based on-demand multipath routing scheme for self-organized mobile ad-hoc networks. Wirel. Netw. 23(8), 2455–2472 (2017)

    Google Scholar 

  15. Olagbegi, B.S., Meghanathan, N.: A review of the energy efficient and secure multicast routing protocols for mobile Ad hoc networks. Int. J. Appl. Graph Theory Wirel. Ad Hoc Netw. Sens. Netw. (GRAPH-HOC) 2(2) (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Gayathri Devi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gayathri Devi, S., Marimuthu, A. (2019). Honest Forwarding Node Selection with Less Overhead and Stable Path Formation in MANET. In: Peter, J., Alavi, A., Javadi, B. (eds) Advances in Big Data and Cloud Computing. Advances in Intelligent Systems and Computing, vol 750. Springer, Singapore. https://doi.org/10.1007/978-981-13-1882-5_41

Download citation

Publish with us

Policies and ethics