Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to...
Abstract—We develop and evaluate a new method for estimating and optimizing various performance metrics for multihop wireless networks, including MANETs. We introduce an approxim...
John S. Baras, Vahid Tabatabaee, George Papageorgi...
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Network proximity and latency estimation is an important component in discovering and locating services and applications. With the growing number of services and service providers...