— The real time flexible operation of a car-like mobile robot with nonholonomic constraints in dynamic environment is still a very challenging problem. The difficulty lies in t...
New mobile devices can be difficult to use because they give users access to powerful computing devices through small interfaces, which typically have limited input facilities. On...
In this work, we characterize the performance of pico cell networks in presence of moving users. We model various traffic types between base-stations and mobiles as different typ...
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...