A performance study of formation and ruoting algorithms for mobile Ad-Hoc network

• Main Author: 陳彥廷
• Other Authors: 莊裕澤
• Format: Others
• Language: zh-TW
• Published: 2002
• Online Access: http://ndltd.ncl.edu.tw/handle/05150181532311081100

碩士 === 國立臺灣大學 === 資訊管理研究所 === 90 === The development of wireless has put us in a new era of communication. Personalized devices with wireless communication power such as cellular phones, notebooks and personal digital assistants can form an inter-connected network called Mobile Ad hoc Network (MANET). Applications of MANET include military communications, disaster recovery, exhibition, conference meeting … etc. In a MANET, each node has mobile and communication capacity, a fixed transmission range, and can move toward any direction. There is no central control mechanism; nodes communicate with each other without access point or base station. Each mobile node is independent and can be seen as a router that forwards data packets for other nodes. Due to fixed communication range of each node, mobile nodes communicate with one another using multi-hop wireless links. Frequent topology changes caused by node mobility make routing in MANET a challenging problem. We can divide routing algorithms into flat and hierarchical architectures. In the flat architecture, each node plays the same role. In the hierarchical architecture, all mobile nodes in the network follow a specific mechanism to form one or several identical logical areas, such as zone, cluster… etc. Different formation policies result in various formation and routing performance. In this paper, we study and simulate several hierarchical routing algorithms with respect to different node mobility patterns and topologies, and evaluate several algorithms with some performance metrics to obtain a comprehensive comparison. Based on the observations, we make recommendations about each algorithm’s advantages, disadvantages and suitable application environments .