http://iet.metastore.ingenta.com
1887

Enhanced node cooperation technique for outwitting selfish nodes in an ad hoc network

Enhanced node cooperation technique for outwitting selfish nodes in an ad hoc network

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Networks — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In an ad hoc network, selfish nodes do not cooperate in packet forwarding of other nodes to maximise their own welfare. Such nodes will have a negative effect on the performance of the network. In this study, an enhanced node cooperation technique (ENCT) is proposed which is a hybrid technique of reputation-based mechanism and incentive-based mechanism. It evaluates relaying nodes’ behaviour, calculates its reputation and outwitting selfish nodes by utilising receipts submitted by each relaying node in the path to a centralised authority rather than using promiscuous mode. A mathematical analysis is provided which demonstrates that the expected gain of reputation for a particular node is maximum if it adopts cooperative behaviour. To motivate nodes for cooperation, variable incentives are provided proportionate to their reputation and current behaviour. Simulation results demonstrate modification of reputation and incentive with varying number of selfish nodes, traffic connections, and topology with static and dynamic behaviour of selfish nodes. The result shows that the ENCT is robust, fair and efficient technique.

References

    1. 1)
    2. 2)
      • 2. Zhou, J., Lu, J., Li, J.: ‘Ant-based balancing energy routing protocol for mobile ad hoc networks’, J. Internet Technol., 2013, 14, (5), pp. 835842.
    3. 3)
    4. 4)
      • 4. Hollick, M., Schmitt, J., Seipl, C., Steinmetz, R.: ‘On the effect of node misbehavior in ad hoc networks’, IEEE Commun., 2004, 6, pp. 37593763.
    5. 5)
    6. 6)
      • 6. Mok, A., Mistry, B., Chung, E., Li, B.: ‘FAIR: Fee arbitrated incentive architecture in wireless ad hoc networks’. IEEE Real-Time and Embedded Technology and Applications Symp., 2004, pp. 3748.
    7. 7)
      • 7. Buttyan, L., Hubaux, J.P.: ‘Enforcing service availability in mobile ad hoc network’. MobiHOC, August 2000, pp. 8796.
    8. 8)
    9. 9)
    10. 10)
    11. 11)
      • 11. Zhong, S., Chen, J., Yang, Y.R.: ‘SPRITE: A simple, cheat-proof, credit based system for mobile ad hoc networks’. INFOCOM, 2003.
    12. 12)
      • 12. Wang, F., Mo, Y., Huang, B.: ‘COSR: A reputation based secure route protocol in MANET’, Wirel. Commun. Netw., 2010, 10, pp. 890893.
    13. 13)
      • 13. Michiardi, P., Molva, R.: ‘CORE: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks’. Sixth IFIP Conf. on Security Communications and Multimedia (CMS'02), Slovenia, 2002, pp. 107121.
    14. 14)
      • 14. Marti, S., Giuli, T.J., Lai, K., Baker, M.: ‘Mitigating routing misbehaviour in mobile ad hoc networks’. Sixth Int. Conf. on Mobile Computing and Networking (MobiCom), Boston, 2000, pp. 255265.
    15. 15)
      • 15. He, Q., Wu, D., Khosla, P.: ‘SORI: A secure and objective reputation-based incentive scheme for ad hoc networks’, WCNC, 2004, 2, pp. 825830.
    16. 16)
      • 16. Shen, H., Li, Z.: ‘ARM: An Account based hierarchical reputation management system for wireless ad hoc network’. ICDCS'08, 2008, pp. 370375.
    17. 17)
    18. 18)
      • 18. Mahmoud, M.E., Shen, X.: ‘FESCIM: Fair, efficient, and secure cooperation incentive mechanism for multi-hop cellular networks’, Mob. Comput., 2012, 11, (5), pp. 753766.
    19. 19)
    20. 20)
      • 20. Buchegger, S., Le Boudec, J-Y.: ‘Performance analysis of the CONFIDANT protocol: cooperation of nodes, fairness in dynamic ad hoc networks’. IEEE/ACM Symp. on Mobile Ad Hoc Networking and Computing (MobiHOC), 2002, pp. 226236.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-net.2013.0103
Loading

Related content

content/journals/10.1049/iet-net.2013.0103
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address