Energy is a critical resource in wireless sensor networks. In this paper, we propose a new approach to maintain network wide energy equivalence and maximize network lifetime. Compared to existing protocols, our approach emphasizes on route maintenance instead of route finding. This means no critical nodes would become the bottleneck of network lifetime. A reroute request packet is sent out from...

Grids with blocked and unblocked cells are often used to represent continuous 2D and 3D environments in robotics and video games. The shortest paths formed by the edges of 8neighbor 2D grids can be up to ≈ 8% longer than the shortest paths in the continuous environment. Theta* typically finds much shorter paths than that by propagating information along graph edges (to achieve short runtimes) w...

Classification of objects is an important area in a variety of fields and applications. Many different methods are available to make a decision in those cases. The knearest neighbor rule (k-NN) is a well-known nonparametric decision procedure. Classification rules based on the k-NN have already been proposed and applied in diverse substantive areas. The editing k-NN proposed by Wilson would be ...

This paper presents a distributed algorithm for discovering multiple shortest paths in an ad hoc network from a source s to a destination d. For each neighbor x of s which lies on a loop-free sd -path, we find one shortest sd -path via node x. The algorithm requires only O(N) many messages.

this article addresses an efficient and novel method for singularity-free path planning and obstacle avoidance of parallel manipulator based on neural networks. a modified 4-5-6-7 interpolating polynomial is used to plan a trajectory for a spherical parallel manipulator. the polynomial function which is smooth and continuous in displacement, velocity, acceleration and jerk is used to find a pat...

One of the most important and challenging issues in real-time applications of resource-constrained wireless sensor networks (WSNs) is providing end-to-end delay requirement. To address such an issue a few QoS routing protocols have been proposed. THVR (Two-Hop Velocity based routing protocol) is newly proposed real-time protocol while it is based on the concept of using two-hop neighbor informa...

We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.