介紹了自組網(wǎng)和路由協(xié)議，對(duì)AODV路由協(xié)議中的斷鏈問(wèn)題進(jìn)行了分析和仿真，提出了對(duì)其進(jìn)行優(yōu)化的方案并給出具體實(shí)現(xiàn)。優(yōu)化方案使用了本地的反向路由重建方法，通過(guò)廣播一個(gè)鏈路修復(fù)消息同時(shí)完成了路由查找和路由建立的任務(wù)。與傳統(tǒng)的路由重建方式相比，可以節(jié)省在重建路由時(shí)引入的時(shí)延，并在一定程度上減少了路由重建的額外開(kāi)銷(xiāo)，以更好地適應(yīng)自組網(wǎng)的應(yīng)用環(huán)境。
關(guān) 鍵 詞 自組網(wǎng); 路由協(xié)議; 本地修復(fù); 仿真

Abstract Because of the flexibility and convenience it can provide us, the mobile ad-hoc network becomes a very hot research topic presently. There are many related articles presented on various journals in this area, especially concentrated on the ad-hoc routing protocols. But, the solutions provided still have more or less defects. Firstly this article introduces the special characters of ad-hoc network and the existing routing protocols. Then analysis and simulation of the link break of ad-hoc on-demand distance vector in ad hoc networks are presented and a new mechanism to improve the performance of link repair is provided. The simulation results indicate that the improved method results in less delay and routing overhead while reconstructing route compared to the traditional method to some extent.
Key words ad-hoc network; routing protocol; local repair; simulation