Computing

pp 1–31 | Cite as

Trust strategy implementation in OppNets

  • Asma’a Ahmad
  • Robin Doss
  • Majeed Alajeely
  • Sarab F. Al Rubeaai
Article
  • 53 Downloads

Abstract

With the natural characteristics of Opportunistic networks (OppNets) where delivery is delayed with frequent disconnections between mobile nodes in dynamically changing routes to destinations, malicious nodes can perform selective packet dropping attacks easily without been identified easily. This is why securing the data flow without any loss becomes challenging in OppNets. In this paper, we present a solid trust based node and path detection technique against selective packet dropping attacks. Using the trust attribute with the Merkle hashing technique, a node’s identity can be validated, and malicious nodes can be detected. We integrate our proposed technique with Epidemic routing and use simulation to show how effective the technique works against selective packet dropping attacks. We use simulation to show how the node detection accuracy increases with time, as intermediate nodes have more time to establish trust with destination nodes. We also use simulation to show that delivery rates increase with increased storage, and show how our trust model improves and secures routing compared to non-trust models.

Keywords

Opportunistic networks OppNets Trust Selective packet dropping attack Merkle tree Malicious node detection 

Mathematics Subject Classification

60A10 

References

  1. 1.
    Tang L, Chai Y, Li Y, Weng B (2012) Buffer management policies in opportunistic networks. J Comput Inf Syst 8(12):5149–5159Google Scholar
  2. 2.
    Chaintreau A, Hui P, Crowcroft J, Diot C, Gass R, Scott J (2005) Pocket switched networks: real-world mobility and its consequences for opportunistic forwarding. Technical Report, UCAM-CL-TR-617, University of Cambridge, Feb 2005Google Scholar
  3. 3.
    Juang P, Oki H, Wang Y, Martonosi M, Peh L, Rubenstein D (2002) Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet. Proc Tenth Int Conf Archit Support Progr Lang Oper Syst 37(10):96–107Google Scholar
  4. 4.
    Rigano C, Scott K, Bush J, Edell R, Parikh S, Wade R, Adamson B (2008) Mitigating naval network instabilities with disruption tolerant networking. In: IEEE conference on military communications, Nov 2008, pp 1–7Google Scholar
  5. 5.
    Burleigh S, Hooke A, Torgerson L, Fall K, Cerf V, Durst B, Scott K, Weiss H (2003) Delay-tolerant networking: an approach to interplanetary internet. IEEE Commun Mag 41(6):128–136CrossRefGoogle Scholar
  6. 6.
    Ahmad A, Alajeely M, Doss R (2014) Defense against packet dropping attacks in opportunistic networks. In: Advances in computing, communications and informatics (ICACCI, 2014 IEEE international conference), Sept 2014, pp 1608–1613Google Scholar
  7. 7.
    Lee S, Gerla M (2001) Split multipath routing with maximally disjoint paths in ad hoc networks. IEEE Int Conf Commun 10:3201–3205Google Scholar
  8. 8.
    Baadache A, Belmehdi A (2012) Fighting against packet dropping misbehaviour in multi-hop wireless ad hoc networks. J Netw Comput Appl 35(3):1130–1139CrossRefGoogle Scholar
  9. 9.
    Zhang X, Jain A, Perrig A (2008) Packet-dropping adversary identification for data plane security. In: Proceedings of the 2008 ACM CoNEXT Conference, Dec 2008Google Scholar
  10. 10.
    Chuah M, Yang P, Han J (2007) A Ferry-based intrusion detection scheme for sparsely connected ad hoc networks. In: Proceedings of the 2007 fourth annual international conference on mobile and ubiquitous aystems: networking services, Aug 2007, pp 1–8Google Scholar
  11. 11.
    Shang-Fu G, Jian-Lei Z (2012) A survey of reputation and trust mechanism in peer-to-peer network. In: Proceedings of the 2012 international conference on industrial control and electronics engineering, Aug 2012, pp 116–119Google Scholar
  12. 12.
    Pirzada A, Datta A, McDonald C (2004) Trusted routing in ad-hoc networks using pheromone trails. IEEE Congr Evol Comput 2:1938–1943Google Scholar
  13. 13.
    Yajun G, Yulin W (2007) Establishing trust relationship in mobile ad-hoc network. In: International conference on wireless communications, networking and mobile computing, Sept 2007, pp 1562–1564Google Scholar
  14. 14.
    Yu Y, Li K, Zhou W, Li P (2012) Trust mechanisms in wireless sensor networks: attack analysis and countermeasures. J Netw Comput Appl 35(3):867–880CrossRefGoogle Scholar
  15. 15.
    Chen I, Bao F, Chang M, Cho J (2014) Dynamic trust management for delay tolerant networks and its application to secure routing. IEEE Trans Parallel Distrib Syst 25(5):1200–1210CrossRefGoogle Scholar
  16. 16.
    Gonçalves M, Moreira E, Martimiano L (2010) Trust management in opportunistic networks. In: Proceedings of the 2010 ninth international conference on networks, April 2010, pp 209–214Google Scholar
  17. 17.
    Merkle R (1980) Protocols for public key cryptosystems. IEEE Symp secur priv 1109:122–134Google Scholar
  18. 18.
    Li Y, Gouda M (2008) Sources and monitors: atrust model for peer-to-peer networks. In: Proceedings of seventeenth international conference on computer communications and networks, Aug 2008, pp 1–6Google Scholar
  19. 19.
    Cho J, Chen I (2016) PROVEST: provenance-based trust model for delay tolerant networks. IEEE Trans Dependable Secur Comput 99:1–1CrossRefGoogle Scholar
  20. 20.
    Nguyên C, Camp O (2008) Using context information to improve computation of trust in ad hoc networks. In: Proceedings of the 2008 IEEE international conference on wireless and mobile computing, networking and communications, Oct 2008, pp 619–624Google Scholar
  21. 21.
    Bijon K, Haque M, Hasan R (2014) A trust based Information sharing model (TRUISM) in MANET in the presence of uncertainty. In: Twelfth annual international conference on privacy, security and trust (PST), July 2014, pp 347–354Google Scholar
  22. 22.
    Yao L, Man Y, Huang Z, Deng J, Wang X (2016) Secure routing based on social similarity in opportunistic networks. IEEE Trans Wirel Commun 15(1):594–605CrossRefGoogle Scholar
  23. 23.
    Zia T, Islam M (2010) Communal reputation and individual trust (CRIT) in wireless sensor networks. In: Proceedings of the 2010 international conference on availability, reliability and security, Feb 2010, pp 347–352Google Scholar
  24. 24.
    Marti S, Giuli T, Lai K, Baker M (2000) Mitigating routing misbehaviour in mobile ad hoc networks. In: Proceedings of the sixth annual international conference on mobile computing and networking, pp 255–265Google Scholar
  25. 25.
    Jaimes L, Ullah K, Moreira E (2016) ARS: anonymous reputation system for vehicular ad hoc networks. In: Eighth IEEE Latin-American conference on communications (LATINCOM), Nov 2016, pp 1–6Google Scholar
  26. 26.
    Dini G, Duca A (2012) Towards a reputation-based routing protocol to contrast blackholes in a delay tolerant network. Ad Hoc Netw 10(7):1167–1178CrossRefGoogle Scholar
  27. 27.
    DeCandia G, Hastorun D, Jampani M, Kakulapati G, Lakshman A, Pilchin A, Sivasubramania S, Vosshall P, Vogels W (2007) Dynamo: amazon’s highly available key-value store. In: Proceedings of twenty first ACM SIGOPS symposium on operating systems principles, Oct 2007, pp 205–220Google Scholar
  28. 28.
  29. 29.
    Vahdat A, Becker D (2000) Epidemic routing for partially-connected ad hoc networks. Technical Report, CS-200006, Duke UniversityGoogle Scholar
  30. 30.
    Lindgren A, Doria A, Schelén O (2003) Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mob Comput Commun Rev 7(3):19–20CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Austria 2017

Authors and Affiliations

  • Asma’a Ahmad
    • 1
  • Robin Doss
    • 1
  • Majeed Alajeely
    • 1
  • Sarab F. Al Rubeaai
    • 2
  1. 1.Center for Research and School of Information TechnologyDeakin UniversityGeelongAustralia
  2. 2.Department of Electrical and Computer EngineeringUniversity of WindsorWindsorCanada

Personalised recommendations