| Summary: | 碩士 === 國立交通大學 === 資訊工程系所 === 94 === Due to the growing popularity of wireless communication systems, we are sur- rounded by increasingly mobile service devices that are connected to their own wireless network systems. Such mobile devices as vehicles, cell phones, PDAs, and mobile sensors are widely available to provide mobile services for users. Note that one of the important issues is to search appropriate mobile services. In order to support scalability well, and make the service discovery efficiently, it is necessary to locate and query a large amount of spatial temporal service information. In this paper, we devise an efficient service discovery mechanism in which the workloads are balanced and spatial-temporal information is util-
ized for grouping. The proposed mechanism (referred to as MobiServNet) explores a hashing technique and application-layer location routing scheme to efficiently discover the services required. Furthermore, service advertisements and queries routing methods are proposed to obtain appropriate approximated services. Performance of the proposed mechanism is comparatively analyzed. It is shown by our simulation results that by exploiting the technique of overlay networks and spatial-temporal information of mobile servers, our proposed mechanism can lead to significant performance improvement.
|
|---|
