Skip to main content

Guessing Intrinsic Forwarding Trustworthiness of Wireless Ad Hoc Network Nodes

  • Conference paper
  • First Online:
Ad Hoc Networks (ADHOCNETS 2019)

Abstract

A novel node misbehavior detection system called GIFTED is proposed for a multihop wireless ad hoc network (WAHN) whose nodes may selfishly refuse to forward transit packets. The system guesses the nodes’ intrinsic forwarding trustworthiness (IFT) by analyzing end-to-end path performance rather than utilizing unreliable and incentive incompatible low-layer mechanisms. It can work with occasional IFT jumps, directional antennae, multichannel transmission, end-to-end encrypted packets, any single-path source routing protocol, and any number of selfish nodes; this makes it a valuable alternative to existing misbehavior detection schemes. GIFTED relies on approximate decomposition of a path equation system arising from successive performance reports from source nodes. The ability to near-perfectly guess IFT in the presence of various perturbations is demonstrated through Monte Carlo and time-true simulations, and compared with an existing weighted path trust scheme.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Notes

  1. 1.

    To keep the presentation simple, we disregard other observable end-to-end characteristics, such as packet delay, sequencing or jitter.

  2. 2.

    While such a centralized approach permits to abstract from the details of report collection and reputation data dissemination, nothing prevents deployment of a distributed version of the proposed scheme, e.g., with multiple RSs (possibly located at all source nodes), as no inter-RS synchronization would be needed.

  3. 3.

    Path selective IFT implies malice towards specific source nodes or a clever strategy of confusing RS, whose benefits are not always clear [17]. Modifications of GIFTED to deal with it are possible.

References

  1. Buttyan, L., Hubaux, J.-P.: Stimulating cooperation in self-organizing mobile ad hoc networks. ACM J. Mob. Netw. (MONET). Special Issue on Mobile Ad Hoc Networks (2002)

    Google Scholar 

  2. Li, Z., Shen, H.: Game-theoretic analysis of cooperation incentive strategies in mobile ad hoc networks. IEEE Trans. Mob. Comput. 11(8), 1287–1303 (2012)

    Article  Google Scholar 

  3. Movahedi, Z., Hosseini, Z., Bayan, F., Pujolle, G.: Trust-distortion resistant trust management frameworks on mobile ad hoc networks: a survey. IEEE Commun. Surv. Tutor. 18(2), 1287–1309 (2016)

    Article  Google Scholar 

  4. Buchegger, S., Le Boudec, J.-Y.: Performance analysis of the CONFIDANT protocol. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, Lausanne, Switzerland, pp. 226–236 (2002)

    Google Scholar 

  5. Jaramillo, J.J., Srikant, R.: A game theory based reputation mechanism to incentivize cooperation in wireless ad hoc networks. Ad Hoc Netw. 8, 416–429 (2010)

    Article  Google Scholar 

  6. Michiardi, P., Molva, R.: CORE: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In: Proceedings of the 6th IFIP Communications and Multimedia Security Conference, Portoroz, Slovenia, pp. 107–121 (2002)

    Google Scholar 

  7. Gupta, S., Kumar, C.: An intelligent efficient secure routing protocol for MANET. Int. J. Futur. Gener. Commun. Netw. 6(1), 111–131 (2013)

    Google Scholar 

  8. Rodriguez-Mayol, A., Gozalvez, J.: Reputation based selfishness prevention techniques for mobile ad-hoc networks. Telecommun. Syst. 57, 181–195 (2014)

    Article  Google Scholar 

  9. Gopalakrishnan, K., Uthariaraj, V.R.: Acknowledgment based reputation mechanism to mitigate the node misbehavior in mobile ad hoc networks. J. Comput. Sci. 7(8), 1157–1166 (2011)

    Article  Google Scholar 

  10. Zhang, Y., Lazos, L., Kozma, W.J.: AMD: audit-based misbehavior detection in wireless ad hoc networks. IEEE Trans. Mob. Comput. 15(8), 1893–1907 (2016)

    Article  Google Scholar 

  11. Graffi, K., Mogre, P.S., Hollick, M., Steinmetz, R.: Detection of colluding misbehaving nodes in mobile ad hoc and wireless mesh networks. In: Proceedings of the IEEE GLOBECOM 2007, Washington DC (2007)

    Google Scholar 

  12. Paracha, M.A., Ahmad, S., Akram, A., Anwar, M.W.: Cooperative reputation index based selfish node detection and prevention system for mobile ad hoc networks. Res. J. Appl. Sci., Eng. Technol. 4(3), 201–205 (2012)

    Google Scholar 

  13. Chiejina, E., Hannan Xiao, H., Christianson, B.: A dynamic reputation management system for mobile ad hoc networks. In: Proceedings of the 6th Computer Science and Electronic Engineering Conference, Colchester, UK, pp. 133–138 (2014)

    Google Scholar 

  14. Johnson, D., Maltz, D., Broch, J.: DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks. Addison-Wesley, Boston MA (2001)

    Google Scholar 

  15. Nowicki, K., Uhl, T.: QoS/QoE in the Heterogeneous Internet of Things (IoT). In: Batalla, J.M., Mastorakis, G., Mavromoustakis, C.X., Pallis, E. (eds.) Beyond the Internet of Things. IT, pp. 165–196. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-50758-3_7

    Chapter  Google Scholar 

  16. Liu, K.J.R., Wang, B.: Cognitive Radio Networking and Security A Game-Theoretic View. Cambridge University Press, Cambridge (2011). ch. 11

    MATH  Google Scholar 

  17. Konorski, J., Rydzewski, K: A centralized reputation system for MANETs based on observed path performance. In: Proceedings of the 8th IFIP Wireless and Mobile Networking Conference, Munich, Germany, pp. 56–63 (2015)

    Google Scholar 

  18. Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. Prentice-Hall, Englewood Cliffs (1974)

    MATH  Google Scholar 

  19. Kim, N.J.: Linear programming with random requirements. Utah State University reports, paper 272 (1968)

    Google Scholar 

  20. Tan, S., Li, X., Dong, Q.: A trust management system for securing data plane of ad-hoc networks. IEEE Trans. Veh. Technol. 65(9), 7579–7592 (2016)

    Article  Google Scholar 

  21. Xue, Y., Nahrstedt, K.: Providing fault-tolerant ad-hoc routing service in adversarial environments. Wirel. Pers. Commun. 29(3/4), 367–388 (2004)

    Article  Google Scholar 

  22. OpenSim Ltd. Homepage. https://omnetpp.org/. Accessed 19 July 2019

  23. Refaei, M.T., DaSilva, L.A., Eltoweissy, M., Nadeem, T.: Adaptation of reputation management systems to dynamic network conditions in ad hoc networks. IEEE Trans. Comput. 59(5), 707–719 (2010)

    Article  MathSciNet  Google Scholar 

  24. Shu, T., Krunz, M.: Privacy-preserving and truthful detection of packet dropping attacks in wireless ad hoc networks. IEEE Trans. Mob. Comput. 14(4), 813–828 (2015)

    Article  Google Scholar 

Download references

Acknowledgment

Work funded by the National Science Center, Poland, under Grant UMO-2016/21/B/ST6/03146.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jerzy Konorski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Konorski, J., Rydzewski, K. (2019). Guessing Intrinsic Forwarding Trustworthiness of Wireless Ad Hoc Network Nodes. In: Zheng, J., Li, C., Chong, P., Meng, W., Yan, F. (eds) Ad Hoc Networks. ADHOCNETS 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 306. Springer, Cham. https://doi.org/10.1007/978-3-030-37262-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-37262-0_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-37261-3

  • Online ISBN: 978-3-030-37262-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics