Nothing Special   »   [go: up one dir, main page]
Skip to main content

Advertisement

Springer Nature Link
Log in

TEA-CBRP: Distributed cluster head election in MANET by using AHP

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Mobile Ad hoc Network consists of a set of mobile nodes that are communicating in a wireless channel. In this network, the number of nodes and their mobility have an impact on the routing performance. In order to improve the routing performance of large scale Mobile Ad Hoc Networks, clustering is one of the solution. When clustering is implemented, an unconditional cooperation among the intra cluster and inter cluster nodes is necessary. In the event where a malicious or selfish node is elected as a cluster head, the routing performance gets significantly affected. In this paper, the key decision factors such as the trust value, remaining energy, and the time of availability of the mobile node is explored to elect a cluster head. Further, these three decision factors are incorporated into the Analytical Hierarchy Process technique in order to elect the most cooperative node as the cluster head. An enhancement to the existing Cluster based Routing Protocol, is proposed in this paper and then enhanced work, is termed as Trust Energy Availability based Cluster Based Routing Protocol. A network based on the proposed protocol is simulated. The important routing performance parameters such as packet delivery ratio, end to end latency, routing packet overhead, and the number of times cluster head changes are discussed for the simulated network and the results are compared with AODV and CBRP routing protocols. The simulation results have shown that the proposed cluster based routing protocol improves the network performance by eliminating malicious and selfish nodes from being elected as cluster head.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  1. http://www.ietf.org/html.charters/manet-charter.html. Accessed (2009)

  2. Chlamtac I, Conti M, Liu JJ-N (2003) Mobile ad hoc networking: imperatives and challenges. Ad Hoc Networks 13–64

  3. Burbank JL, Chimento PF, Haberman BK, Kasch WT (2006) Key challenges of military tactical networking and the elusive promise of MANET technology. IEEE Communication Mag 44(11):39–45

    Article  Google Scholar 

  4. Duran A, Shen C (2004) Mobile Ad Hoc P2P file sharing. In: Procedings of IEEE wireless committee and networking conference (WCNC). Atlanta

  5. Hong X, Xu K, Gerla M (2002) Scalable routing protocols for mobile ad hoc networks. IEEE Network 16(4):11–21

    Article  Google Scholar 

  6. Yu JY, Chong PHJ (2005) A survey of clustering schemes for mobile ad hoc networks. IEEE Communc Surv Tutorials 7(1):32–48

    Article  Google Scholar 

  7. Baker D, Ephremides A (1981) The architectural organization of a mobile radio network via a distributed algorithm. IEEE Trans Commun 29(11):1694–1701

    Article  Google Scholar 

  8. Li W, Joshi A, Finin T (2010) Coping with node misbehaviours in ad hoc networks: a multi-dimensional trust management. In: Proceedings of mobile data management, Kansas

  9. Hollick M, Schmitt J, Seipl C, Steinmetz R (2004) On the effect of node misbehavior in ad hoc networks. In: Procedings of IEEE international conference on communications, Paris

  10. Djahel S, Na-abdesselam F, Zhang Z (2011) Mitigating packet dropping problem in mobile Ad Hoc networks: proposals and challenges. IEEE Commun Surv tutorials 13(4)

  11. Agrawal P, Ghosh RK, Das SK (2008) Cooperative black and gray hole attacks in mobile ad hoc networks. In: Proceedings of 2nd international conference on ubiquitous information management and communication (ICUIMC), Korea

  12. Zhou L, Hass Z (1999) Securing Ad Hoc networks. IEEE Netw 13(6):24–30

    Article  Google Scholar 

  13. Jiang M, Li J, Tay Y (1998) Clustccol (CBRP). IETF Internet-Draft

  14. Saaty TL, Katz JM (1990) How to make a decision: the analytic hierarchy process. Eur J Oper Res 48:9–26

    Article  MATH  Google Scholar 

  15. Vaidya OS, Kumar S (2006) Analytical hierarchy process (AHP) an overview of applications. Eur J Oper Res 169(1):1–29

    Article  MATH  MathSciNet  Google Scholar 

  16. Saaty TL (2000) Fundamentals of decision making and priority theory with the analytic hierarchy process. RWS Publications. USA

  17. Zeng Y, Chen Z, Qiao C, Xu L (2011) A cluster header election scheme based on auction mechanism for intrusion detection in MANET. In: Procedings of international conference on network computing and information security (NCIS), China, pp 14–15

  18. Li C, Wang Y, Huang F, Yang D (2009) A novel enhanced weighted clustering algorithm for mobile networks. In: Proceedings of international conference on wireless communications, networking and mobile computing, China, pp 24–26

  19. Wu K, Hong ZZ, Hanzo L (2010) A Cluster-head selection and update algorithm for Ad Hoc networks. In: Procedings of GLOBECOM, USA, pp 6–10

  20. El-Bazza Z, Kadoch M, Agba BL, Gagnon F, Bennani M (2006) An efficient management algorithm for clustering in mobile ad hoc network. In: Procedings of PM2HW2N ’06, Spain, pp 2–6

  21. Torkestani JA, Meybodi MR (2011) A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks. J Clust Comput 14(4):311–324

    Article  Google Scholar 

  22. Rahman KA, Tepe KE (2011) Mobility assisted routing in mobile adhoc networks. In: Proceedings of 4th IFIP internation conference on new technologies mobility and security (NTMS) , pp 7–10

  23. http://www.isi.edu/nsnam/ns/. Accessed (2009)

  24. Perkins C (2003) Adhoc on demand distance vector (AODV) protocol. RFC 3561

Download references

Author information

Authors and Affiliations

  1. Deparment of Computer Science and Engineering, National Institute of Technolgy, Tiruchirappalli, Tamil Nadu, 620015, India

    U. Venkanna & R. Leela Velusamy

Authors
  1. U. Venkanna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Leela Velusamy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to U. Venkanna.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Venkanna, U., Leela Velusamy, R. TEA-CBRP: Distributed cluster head election in MANET by using AHP. Peer-to-Peer Netw. Appl. 9, 159–170 (2016). https://doi.org/10.1007/s12083-014-0320-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-014-0320-0

Keywords

Search

Navigation