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

Rekha Kaushik; Jyoti Singhai

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

View Fulltext

Author(s): Rekha Kaushik ¹ and Jyoti Singhai ²
- Affiliations: 1: Computer Science and Engineering Department, Maulana Azad National Institute of Technology, Bhopal, India;
  2: Electronics and Communication Engineering Department, Maulana Azad National Institute of Technology, Bhopal, India
Source: Volume 4, Issue 2, March 2015, p. 148 – 157
DOI: 10.1049/iet-net.2013.0103 , Print ISSN 2047-4954, Online ISSN 2047-4962

Received 23/07/2013, Accepted 17/07/2014, Revised 02/03/2014, Published 10/09/2014

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)
  - E.M. Royer , C.-K. Toh . A review of current routing protocols for adhoc mobile wireless networks. IEEE Pers. Commun. , 2 , 46 - 55
2. 2)
  - 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. 107–121.
3. 3)
  - 4. Hollick, M., Schmitt, J., Seipl, C., Steinmetz, R.: ‘On the effect of node misbehavior in ad hoc networks’, IEEE Commun., 2004, 6, pp. 3759–3763.
4. 4)
  - 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. 753–766.
5. 5)
  - 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. 835–842.
6. 6)
  - 8. Gizelis, C.A., Vergados, D.D.: ‘A survey of pricing scheme in wireless networks’, IEEE Trans. Commun. Surv. Tutor., 2011, 13, (1), pp. 126–145 (doi: 10.1109/SURV.2011.060710.00028).
7. 7)
  - 11. Zhong, S., Chen, J., Yang, Y.R.: ‘SPRITE: A simple, cheat-proof, credit based system for mobile ad hoc networks’. INFOCOM, 2003.
8. 8)
  - 9. Mahmoud, M.E., (Sherman) Shen, X.: ‘PIS: A practical incentive system for multihop wireless networks’, Veh. Technol., 2010, 59, (8), pp. 4012–4025 (doi: 10.1109/TVT.2010.2062549).
9. 9)
  - 5. Komninos, N., Vergados, D., Douligeris, C.: ‘Detecting unauthorized and compromised nodes in mobile ad hoc networks’, Ad hoc Netw., 2007, 5, (3), pp. 289–298 (doi: 10.1016/j.adhoc.2005.11.005).
10. 10)
  - 15. He, Q., Wu, D., Khosla, P.: ‘SORI: A secure and objective reputation-based incentive scheme for ad hoc networks’, WCNC, 2004, 2, pp. 825–830.
11. 11)
  - 17. Charilas, D.E., Georgilakis, K.D., Panagopoulos, A.D.: ‘ICARUS: hybrid incentive mechanism for cooperation stimulation in ad hoc networks’, Ad Hoc Netw., 2012, 10, (6), pp. 976–989 (doi: 10.1016/j.adhoc.2011.12.010).
12. 12)
  - 12. Wang, F., Mo, Y., Huang, B.: ‘COSR: A reputation based secure route protocol in MANET’, Wirel. Commun. Netw., 2010, 10, pp. 890–893.
13. 13)
  - 3. Lee, W.II, Pyun, J.Y., Lee, Y.S., Lee, S.W.: ‘Relative velocity based vehicle-to-vehicle routing protocol over ad hoc networks’, Int. J. Ad hoc Ubiquit. Comput., 2013, 12, (1), pp. 14–22 (doi: 10.1504/IJAHUC.2013.051375).
14. 14)
  - 19. Varshney, U.: ‘Improving wireless health monitoring using incentive based router cooperation’, IEEE Comput., 2008, 41, (5), pp. 56–62 (doi: 10.1109/MC.2008.157).
15. 15)
  - 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. 37–48.
16. 16)
  - 16. Shen, H., Li, Z.: ‘ARM: An Account based hierarchical reputation management system for wireless ad hoc network’. ICDCS'08, 2008, pp. 370–375.
17. 17)
  - 10. Lee, S.-B., Park, J.-S., Gerla M., , Lu, S.: ‘Secure incentive for commercial ad dissemination in vehicular networks’, Veh. Technol., 2012, 61, (6), pp. 2715–2728 (doi: 10.1109/TVT.2012.2197031).
18. 18)
  - 7. Buttyan, L., Hubaux, J.P.: ‘Enforcing service availability in mobile ad hoc network’. MobiHOC, August 2000, pp. 87–96.
19. 19)
  - 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. 255–265.
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. 226–236.

Login

Not registered yet?

Share

Tools

Login to add to favourites

Key

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

References

Related content