A reliable routing algorithm for mobile ad hoc networks

• Main Authors: Scott, 趙偉臣
• Other Authors: Terrance
• Format: Others
• Language: en_US
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/73584801180446654837

碩士 === 國立交通大學 === 電信工程系所 === 93 === An ad hoc network is a network composed by a group of mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure such as base stations and access points. These mobile hosts complete their transmission by transferring the data by intermediate nodes and send the data by multi-hop. Because ad hoc networks do not limit to the infrastructure, they have high mobility and they can be built easily. Because these hosts move, the topology of the network will always change. We have to use an algorithm to detect the topology fast. When some links are broken, we can find another path to keep transmitting the data as fast as possible. In wireless networks, security is a very important issue. Data transmission is vulnerable in the wireless surrounding, so we have to consider the security. There are many proposed routing methods and many ways to enhance the security. Because our goal is how to find another route to keep transmission when some links are broken and enhance the security easily, our proposed algorithm which combines the redundancy base multi-path routing protocol and the Diffie-Hellman key exchange algorithm can achieve our goal.