Scalable routing in mobile ad hoc networks
Peng Yang · 2005
With the technology advances in wireless network, a large number of mobile devices for communication are now publicly available. However, the traditional wireless networks are based on infrastructure modes with some administration in the system. Deployment of such networks takes time and cannot be set up in time of emergency. Therefore, mobile multi-hop radio networks, also called mobile ad hoc networks(MANETs), play a critical role in places where infrastructure is neither available nor economical to build. However MANETs are usually limited in terms of bandwidth, energy, processing capabilities, and security. These problems result in some interesting issues. Scalability issue is an attractive one among them. In this thesis, we focus on the scalability study on the routing in MANETS. We analyze the existing routing approaches in MANETs, we conclude that clustering and hierarchical routing are promising ways to improve the scalability of the routing based on the analysis. We propose an adaptive clustering scheme (RMACP: adaptive&cached cluster-based routing protocol) to reduce the maintenance overhead for clustering schemes. Simulation results show that without any routing performance degradation the RMACP can achieve much lower control overhead compared with other existing clustering techniques.