|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 27 van 36 gevonden artikelen
| Titel: |
Scalable and Effective Cluster Based Routing Algorithm Using Nodes` Location for Mobile Ad Hoc Networks |
| Auteur: |
Y. Wang T. Liang X. Yang D. Zhang |
| Verschenen in: |
Information technology journal |
| Paginering: | Jaargang 7 (2008) nr. 7 pagina's 958-971 |
| Jaar: |
2008 |
| Inhoud: |
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. |
| Uitgever: |
Asian Network for Scientific Information (provided by DOAJ) |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 27 van 36 gevonden artikelen
| << vorige | volgende >> |