Mobile visitors who browse the web from wireless PDAs and cell phones are frequently troubled with links of web pages that will take long time in searching information due to the complex structure of deep links. To solve this problem, in this paper, w...
Mobile visitors who browse the web from wireless PDAs and cell phones are frequently troubled with links of web pages that will take long time in searching information due to the complex structure of deep links. To solve this problem, in this paper, we propose a minimal path algorithm that provides the shortest search time for investigating web sites.
Proposed algorithm offers a shortcut to mobile users for web navigation. Wireless web terminals will be numerically superior to desktop browsers in time. Therefore, web sites must be prepared to provide proper contents for mobile users' requests. Web navigation on mobile equipment is a usually expensive task and shortcut links are thus of much help to provide current contents.
In this paper, we found the following results:
First, we unfold the Minimal Path algorithm to find a shortcut link.
Second, we compared our algorithm with existing algorithms.
Third, we provide the experimental proof that the Minimal Path with useful shortcut link can be found by our algorithm.
Based on our research, some future work is entailed. First all, more serious performance evaluation in solicited with respect to large scale web sites.