REQ-RES Matching Based Service Discovery in Pervasive Computing

Pervasive computing is one of the increasing researches nowadays. The main problem to be solved in pervasive computing is service discovery and service providing accurately within a stipulated time interval. This paper proposes a REQ-RES Matching based service discovery method for improve the efficiency of service discovery and service provision. Present and permanent information of services is stored in service table called (SER-TAB) which can be compared with the incoming requests for services in the environment. This comparison of incoming request and SER-TAB provides the present and permanent status of the services and it is easy allocate the services in time. This simulation is done in DOTNET software in a large local area network and the results are verified and performance evaluated.