In order to solve how to enhance the discovery efficiency and coverage, based on DHT (Distributed Hash Table) and Small World Theory, we put forward a new algorithm of service discovery for mobile application. In traditional DHT discovery algorithm, each node maintains the finger-table that store node information of adjacent node. By using Small-World Theory, we put forward adding a remote node...

In a future intelligent factory, a robotic manipulator must work efficiently and safely in a Human-Robot collaborative and dynamic unstructured environment. Autonomous path planning is the most important issue which must be resolved first in the process of improving robotic manipulator intelligence. Among the path-planning methods, the Rapidly Exploring Random Tree (RRT) algorithm based on rand...

this paper develops an automatic parking algorithm based on a fuzzy logic controller with the vehicle pose for the input and the steering angle for the output. in this way some feasible reference trajectory path have been introduced according to geometric and kinematic constraints and nonholonomic constraints to simulate motion path of car. also a novel method is used for parking space detectio...

The goal of the work described in this paper is to build a path planner able to drive a robot in a dynamic environment where the obstacles are moving. In order to do so, we propose a method, called "ARIADNE'S CLEW algorithm", to build a global path planner based on the combination of two local planning algorithms : an EXPLORE algorithm and a SEARCH algorithm. The purpose of the EXPLORE algorith...

The technique of dynamic time warping for time registration of a reference and test utterance has found widespread use in the areas of speaker verification and discrete word recognition. As originally proposed, the algorithm placed strong constraints on the possible set of dynamic paths—namely it was assumed that the initial and final frames of both the test and reference utterances were in exa...

A Mobile Ad hoc Network (MANET) is an autonomous system of mobile stations connected by wireless link to form a network. It does not rely on predefined infrastructure to keep the network connected therefore it is also known as infrastructure less network. A designed protocol must provide scalable routing with better security. In this paper, we proposes the location based protocols of Dynamic Re...

Existing discovery algorithms for peer to peer networks are based on broadcast of query messages over the relationship connectivity among entities in the network.A query message contains search key words, and it is broadcast with a TTL (time to live) value to limit the scope of search and to reduce high overhead associated with broadcast. Although the use of TTL reduces the amount of overhead, ...

In dynamic routing construction of ICN, traditional CCN routing mechanism can improve the diversity and reliability of data forwarding. But it also brings problems in retrieval redundancy, taking some load to the network. SoCCeR strategy uses ant colony algorithm to finish single-path routing of CCN in distribution, while it has defects in ant agency control and convergence feature. Therefore, ...

Dynamic service discovery and late binding to the most appropriate network service will be the key characteristics of future adhoc networks. In adhoc networks, the nodes are mobile and the multihop environment does not rely on an existing communication infrastructure. Mobile nodes dynamically establish routes among themselves to form a network “on the fly”. “Appropriateness” of a service is a s...