Welcome to the InfoSci Platform
Cluster-Based Online Routing Protocols for Ad Hoc Network

Cluster-Based Online Routing Protocols for Ad Hoc Network

Alaa E. Abdallah, Mohammad Bsoul, Emad E. Abdallah, Ibrahim Al–Oqily, George Kao
Copyright: © 2014 |Volume: 9 |Issue: 4 |Pages: 13
ISSN: 1554-1045|EISSN: 1554-1053|EISBN13: 9781466655324|DOI: 10.4018/ijitwe.2014100105
Cite Article Cite Article

MLA

Abdallah, Alaa E., et al. "Cluster-Based Online Routing Protocols for Ad Hoc Network." IJITWE vol.9, no.4 2014: pp.54-66. http://doi.org/10.4018/ijitwe.2014100105

APA

Abdallah, A. E., Bsoul, M., Abdallah, E. E., Al–Oqily, I., & Kao, G. (2014). Cluster-Based Online Routing Protocols for Ad Hoc Network. International Journal of Information Technology and Web Engineering (IJITWE), 9(4), 54-66. http://doi.org/10.4018/ijitwe.2014100105

Chicago

Abdallah, Alaa E., et al. "Cluster-Based Online Routing Protocols for Ad Hoc Network," International Journal of Information Technology and Web Engineering (IJITWE) 9, no.4: 54-66. http://doi.org/10.4018/ijitwe.2014100105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In geographical routing algorithms, mobile nodes rely on geographical position to make routing judgments. Researchers frequently discuss such routing algorithms in (2D) space. However, in reality, mobile nodes spread in (3D) space. In this paper the authors present four new 3D geographical-based routing algorithms Cylinder, Greedy-Cylinder, Cluster-Cylinder, and Greedy-cluster-Cylinder. In Cylinder routing, the nodes are locally projected on the inner surface of a cylinder, perimeter routing is executed after that. Greedy-Cylinder starts with Greedy routing algorithm until a local minimum is reached. The algorithm then switches to Cylinder routing. Cluster-Cylinder elects a dominating set for all nodes and then uses this set for projection and routing. The fourth algorithm Greedy-cluster-Cylinder is a combination between Greedy-Cylinder and Cluster-Cylinder. The authors evaluate their new algorithms and compare them with many classical known algorithms. The simulation outcomes show the substantial enhancement in delivery rate over other algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.