具自我保護與行程規劃能力之MIDP行動代理人

機構典藏 > College of Business and Management > Graduate Institute & Department of Information Management > Thesis > Item 987654321/34051

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/34051

Title:	具自我保護與行程規劃能力之MIDP行動代理人
Other Titles:	On the self-protection and itinerary scheduling for MIDP mobile agents
Authors:	王俊人;Wang, Chun-jen
Contributors:	淡江大學資訊管理學系碩士班張昭憲;Chang, Jau-shien
Keywords:	行動代理人;安全性;行程規劃;MIDP;手持裝置;Mobile Agents;Security;Itinerary Scheduling;MIDP;Handheld Devices
Date:	2006
Issue Date:	2010-01-11 04:50:11 (UTC+8)
Abstract:	行動代理人(Mobile Agents)是軟體代理人(Software Agents)的一支，可接受使用者委託，自行在網路上遷移並完成受託任務。行動代理人繼承了軟體代理人的優點，能為使用者處理規律、繁瑣的工作。更特別的是:它能有效降低網路傳輸量、節省傳輸時間，因此很適合以手持裝置(手機、PDA等)為主的應用環境。行動代理人雖有上述優點，但在實用化過程中，仍有不少關鍵問題有待解決。首先，由於行動代理人需在網路節點間旅行，其程式碼與攜帶資料遭受攻擊的機會大增，因此安全問題明顯比傳統的主從架構更不易處理[6][15]。此外，有鑑於手持裝置的網路存取費用居高不下，毫無規劃的網路漫遊，將使行動代理人的擁有者付出昂貴的代價。因此，如何根據環境變化進行良好的行程規劃，亦是行動代理人實用化的必經之路[10]。本研究以手機為發展平台，發展有效的行動代理人加密技術與適當的路徑規劃方法。在加密方面，有別於前人研究，我們考量行動裝置的運算能力有限，對於僅用於確認安全性的外加資料，均先予以摘要化，以加速加解密過程。此外，為避免代理人金鑰在旅途中被偽造，本研究將CA(Certificate Authority)簽署的憑證附加於代理人攜帶的資料中，以確認其來源之可靠性。對於路徑規劃問題，我們提出一套快速的greedy演算法，先根據手機間的通訊成本進行自動分組，再重複運用此演算法在各群組間進行路徑規劃。實驗結果顯示，本研究提出加密方法確實能兼顧安全性與效率。此外，我們所提出路徑規劃方法產生的路徑成本與[10]幾乎相同，卻能節省大量運算時間。上述結果明白顯示本研究提出方法之有效性。 Mobile agent is an important branch of the software agent family. It can travel autonomously on the network, and complete the task assigned by the user. The mobile agent inherits the advantage of the software agents so it can handle regular and tedious work for the user. In particular, it can reduce the amount of data transmitted on the network, save transmitting time effectively, and therefore is very suitable for the environment which handheld devices (cell phone, PDA, etc.) are mainly applied. Although mobile agents have foregoing advantages, in the practical process, many key problems remain to be solved. First, mobile agents have to travel among the nodes of the network, opportunities of attacking their code and data are increasing, so the security problems are obviously more difficult than traditional client-server structure [6][15]. In addition, because of the network accessing expenses of the handheld devices remaining high, roaming without planning on the network will force the owner of the mobile agents to pay the expensive cost. Hence, how to schedule itinerary well according to the changing environment is also indispensable for developing industrial strength mobile agents [10]. In this research, cell phones are used as the target devices to develop effective mobile agents encryption and proper itinerary scheduling method. In encrypting, differing from the previous studies, we consider the restricted computational capability of mobile devices, digest the additional data which is only used to confirm the security first in order to speed up the process of encrypting and decrypting. Furthermore, in order to prevent the agent’s key being forged during the journey, the certification signed by CA (Certificate Authority) is attached to data carried by the agent to confirm the dependability of its source. To the itinerary scheduling problem, we propose a fast greedy algorithm, which groups automatically according to the communication cost among the cell phones first, then a selection procedure are applied repeatedly to schedule the itinerary among the groups. The experimental result shows that the proposed encrypting method can certainly consider both security and efficiency. In addition, the route produced by our scheduling method is nearly similar to the method proposed in [10], but the former can save a large amount of operation time.
Appears in Collections:	[Graduate Institute & Department of Information Management] Thesis

Files in This Item:

File	Size	Format
	0Kb	Unknown	291	View/Open

Loading...