This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance P

Probability theory deals with the study of random phenomena, which under repeated experiments yield different outcomes that have certain underlying patterns about them. The notion of an experiment assumes a set of repeatable conditions that allow any

Abstract—In this paper we propose the channel assignment scheme for multi-channel wireless mesh network (WMN), where each mesh router is equipped with multiple radio interfaces. In real WMN the number of radio interfaces is much higher than t

Randomized Dimensionality Reduction for k-means Clustering This paper makes further progress towards a better understanding of dimensionality reduction for kmeans clustering. Namely, we present the first provably accurate feature selection met