Award Date
2009
Degree Type
Thesis
Degree Name
Master of Science in Computer Science
Department
Computer Science
Advisor 1
Ajoy K. Datta, Committe Chair
First Committee Member
John T. Minor
Second Committee Member
Yoohwan Kim
Graduate Faculty Representative
Emma Regentova
Number of Pages
71
Abstract
This thesis presents both a review of current MANET routing protocols and a new MANET routing algorithm. The routing protocols reviewed include representative samples from the three primary forms of routing found in MANETS: proactive routing, reactive routing and hybrid routing. Secure algorithms are given special treatment in the review. In addition several protocol enhancements are discussed.
The proposed routing protocol is designed to support networks of a medium size, containing over 200 nodes but less than 3,000 nodes. The design is intentionally simple to allow ease of implementation in comparison with other MANET protocols that provide similar functionality.
Keywords
Clustering; Hybrid routing; MANET routing; Mobile ad hoc network (MANET); Networking; Proactive routing; Reactive routing
Disciplines
Computer Sciences | Digital Communications and Networking
File Format
Degree Grantor
University of Nevada, Las Vegas
Language
English
Repository Citation
Carnine, Adam, "Hierarchical routing in MANETs using simple clustering" (2009). UNLV Theses, Dissertations, Professional Papers, and Capstones. 105.
http://dx.doi.org/10.34917/1376026
Rights
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/