Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Information Technology Journal
  Year: 2008 | Volume: 7 | Issue: 7 | Page No.: 958-971
DOI: 10.3923/itj.2008.958.971
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Scalable and Effective Cluster Based Routing Algorithm Using Nodes’ Location for Mobile Ad Hoc Networks

Y. Wang, T. Liang, X. Yang and D. Zhang

Abstract:
In this study, we develop and analyze the Cluster Based Location-Aware Routing Protocol for Large Scale Heterogeneous Mobile Ad Hoc Networks (CBLARHM), a low-complexity routing algorithm for mobile ad hoc networks (MANET). CBLARHM runs on top of an adaptive cluster cover of the network, which can be created and maintained using, for instance, the weight-based distributed algorithm. The weighted clustering algorithm we proposed takes into consideration node degree difference, battery power, average link stability and average dependency probability of mobile nodes. The hierarchical structure stabilizes the end-to-end communication paths and improves the networks scalability such that the routing overhead does not become tremendous in large scale MANET. Furthermore, it is fascinating and important to investigate that how to control the total number of nodes involved in a routing establishment process so as to improve the network layer performance of MANET. CBLARHM is to use geographical location information provided by Global Position System (GPS) to assist routing. The location information of destination node is used to predict a smaller rectangle, isosceles triangle, or circle request zone, which is selected according to the relative location of the source and the destination, that covers the estimated region the destination may locates. Thus, instead of searching the route in the entire network blindly, CBLARHM confines the route searching space into a much smaller estimated range. Simulation results have shown that CBLARHM outperforms other protocols significantly in route setup time, routing overhead, mean delay and packet collision and simultaneously maintains low average end-to-end delay, high success delivery ratio, low control overhead, as well as low route discovery frequency.
PDF Fulltext XML References Citation Report Citation
 RELATED ARTICLES:
  •    A Comparative Analysis of Routing Techniques in Intermittently Connected MANETs
  •    Spray and Wait Routing With Agents in Intermittently Connected MANETs
  •    Message Broadcasting Protocols in VANET
  •    Elderly Personal Safety Monitoring in Smart Home Based on Host Space and Travelling Pattern Identification
How to cite this article:

Y. Wang, T. Liang, X. Yang and D. Zhang, 2008. Scalable and Effective Cluster Based Routing Algorithm Using Nodes’ Location for Mobile Ad Hoc Networks. Information Technology Journal, 7: 958-971.

DOI: 10.3923/itj.2008.958.971

URL: https://scialert.net/abstract/?doi=itj.2008.958.971

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 

Curve Bottom