Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Efficient Algorithms For Clustering Polygonal Obstacles, Sabbir Kumar Manandhar
Efficient Algorithms For Clustering Polygonal Obstacles, Sabbir Kumar Manandhar
UNLV Theses, Dissertations, Professional Papers, and Capstones
Clustering a set of points in Euclidean space is a well-known problem having applications in pattern recognition, document image analysis, big-data analytics, and robotics. While there are a lot of research publications for clustering point objects, only a few articles have been reported for clustering a given distribution of obstacles. In this thesis we examine the development of efficient algorithms for clustering a given set of convex obstacles in the 2D plane. One of the methods presented in this work uses a Voronoi diagram to extract obstacle clusters. We also consider the implementation issues of point/obstacle clustering algorithms.
Hierarchical Routing In Manets Using Simple Clustering, Adam Carnine
Hierarchical Routing In Manets Using Simple Clustering, Adam Carnine
UNLV Theses, Dissertations, Professional Papers, and Capstones
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.