Wireless Communication

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Reduced Routing Overhead in Mobile Adhoc Networks Using HCH Algorithm


Affiliations
1 Department of Computer Science, Periyar University, Salem, Tamilnadu - 636011, India
2 Department of Computer Science, Govt Arts College, Dharmapuri, Tamilnadu, India
     

   Subscribe/Renew Journal


In this paper proposed new routing algorithm name Hidden Cluster Head (HCH) selection for improve route stability in Mobile Adhoc Networks (MANET). These proposed algorithm executes high potential score cluster head node. First HCH select Primary Cluster Head (PCH) node is based on the combination of node mobility, node bandwidth, node energy, and node link quality. Second select secondary cluster head (HCH), next high potential score node compare to all other its neighbor when PCH go for threshold to handover the routing process. First threshold is warning for search the hidden cluster head selection at the time of less than 20% transmission power. Second threshold primary cluster head is handover the routing process to hidden cluster head at the time of less than 15% transmission power. The same procedure will execute hop1, hop2 and so on until reach the destination. This proposed HCH algorithm provides better performance compare to existing cluster algorithms (Single Cluster Head (SCH), Double Cluster Head (DCH), Load Balancing Clustering (LBC), and Weighted Cluster Algorithm (WCA) and also reduced routing Overhead with mobility, transmission range, number of node is increased.


Keywords

Cluster Head, Hidden Cluster Head (HCH), Routing Overhead, MANET, Routing Protocols.
User
Subscription Login to verify subscription
Notifications
Font Size

  • R.P. Yadav, “Cluster head Selection in Clustering”, Troy, NY 12180 U.S., 2008.

  • Haiyan and Haiying, “A Modified Cluster Head”, Proc. of ICNSC, pp: 6-8, 2008.

  • Ahmed loutfi, et al, “An energy aware algorithm for OLSR Clustering”, Anneals of Telecommunication (Springer), Vol: 69, PP: 201-207, 2014.

  • Mr. S. Rajasekar and Dr. A. Subramani, “Node Weight Based Cluster Formation to Improve Route Stability in MANET”, Int. J. Adv. Research in Computer Science, Vol: 7, No.: 5, pp: 83-86, 2016.

  • Christian Bettstetter, “The cluster density of a distributed clustering algorithm in adhoc networks”, Proc. of IEEE-ICC, Vol: 7, PP: 4336 – 4340, 2004.

  • Prabu, K. and Subramani, A. “energy efficient routing in MANET through edge node selection using ESPR algorithm”, Int. J. Mobile Network Design and Innovation, Vol: 5, No: 3, pp: 166–175, 2014.

  • Conceic, L. et al,“A novel stable and low-maintenance clustering scheme,” Proc. of 25th ACM Symposium on Applied Computing, pp. 699–705, Sierre, Switzerland, 2010.

  • Mr. S. Rajasekar and Dr. A. Subramani, “Performance Analysis of Cluster Based Routing Protocol for MANET Using RNS Algorithm”, Int. J. Adv. Research in Com. Sci. and Soft. Engg.,Vol: 6, Iss: 12, pp: 234-239, 2016.

  • Mohamed Aissa, et al. “New strategies and extensions in weighted clustering algorithms for mobile adhoc networks”, Procedia Computer Science (Elsevier), Vol: 19, pp: 297–304, 2013.

  • Prabu, K. and Subramani, A. “Performance comparison of routing protocol in MANET’, Int. J. of Adv. Research in Com. Sci. and Soft Engg., Vol: 2, No: 9, pp: 388–392, 2012.

  • Sunil Pathak, and Sonal Jain, “A novel weight based clustering algorithm for routing in MANET”, Wireless Networks (Springer), Vol: 10, pp: 1-10, 2015.

  • Abhishek Majumder, “DEMAC: A Cluster-Based Topology Control for Ad Hoc Networks”, International Journal of Computer Science Issues, Vol: 7, Iss: 5, 2010.

  • W. Jin,et al, “A load-balancing and energy-aware clustering algorithm in wireless adhoc networks”, Embedded and Ubiquitous Computing EUC 2005 Workshops; Lecture Notes in Computer Science, Vol: 3823, pp: 1108-1117, 2005.

  • Xi'an Jiaotong, et al. “WACHM: Weight based adaptive clustering for large scale heterogeneous MANET”, Communications and Information Technologies; ISCIT '07; 2007.

  • J. Y. Yu, and P. H. Joo Chong, “An efficient clustering scheme for large and dense mobile ad hoc networks (MANETs)”, Computer Comm., Vol: 30, pp.5-16, 2006.

  • M. Chatterjee, and S. K. Das, “WCA: A weighted clustering algorithm for mobile ad hoc networks”, Journal of Cluster Computing, No. 5, pp. 193-204, 2002.

  • Hussein, et al, “An Efficient Weighted Distributed Clustering Algorithm for Mobile Ad Hoc Networks”, In proc. of IEEE, Computer Engineering and Systems (ICCES), pp. 221-228, 2010.

  • S. Karunakaran, et. al., “A Cluster-Based Service Discovery Protocol for Mobile Ad-hoc Networks,” American Journal of Scientific Research, Issue 11, pp. 179 -190, 2011.

  • G. Chen, et al, "Connectivity based k-hop clustering in wireless networks”, In proc. of the 35th Annual Hawaii International Conference on System Sciences, vol. 7, pp. 188- 193, 2002.

  • D. Amis and R. Prakash, "Load-Balancing Clusters in Wireless Ad-Hoc Networks", In proc. of 3rdIEEE-ASSET'00, pp. 25-32, 2000.


Abstract Views: 232

PDF Views: 4




  • Reduced Routing Overhead in Mobile Adhoc Networks Using HCH Algorithm

Abstract Views: 232  |  PDF Views: 4

Authors

S. Rajasekar
Department of Computer Science, Periyar University, Salem, Tamilnadu - 636011, India
A. Subramani
Department of Computer Science, Govt Arts College, Dharmapuri, Tamilnadu, India

Abstract


In this paper proposed new routing algorithm name Hidden Cluster Head (HCH) selection for improve route stability in Mobile Adhoc Networks (MANET). These proposed algorithm executes high potential score cluster head node. First HCH select Primary Cluster Head (PCH) node is based on the combination of node mobility, node bandwidth, node energy, and node link quality. Second select secondary cluster head (HCH), next high potential score node compare to all other its neighbor when PCH go for threshold to handover the routing process. First threshold is warning for search the hidden cluster head selection at the time of less than 20% transmission power. Second threshold primary cluster head is handover the routing process to hidden cluster head at the time of less than 15% transmission power. The same procedure will execute hop1, hop2 and so on until reach the destination. This proposed HCH algorithm provides better performance compare to existing cluster algorithms (Single Cluster Head (SCH), Double Cluster Head (DCH), Load Balancing Clustering (LBC), and Weighted Cluster Algorithm (WCA) and also reduced routing Overhead with mobility, transmission range, number of node is increased.


Keywords


Cluster Head, Hidden Cluster Head (HCH), Routing Overhead, MANET, Routing Protocols.

References