| Summary: | 碩士 === 國立中正大學 === 資訊工程所 === 94 === As mobile ad hoc network (MANET) and peer-to-peer (P2P) network become more popular, it becomes more and more interesting to integrate these two networks, because they both share common characteristics, such as infrastructure-less, self-organization, highly dynamic network topology, etc. However, there are many of routing approaches have been proposed with the rapidly growing of P2P system. Distributed Hash Table (DHT) is one of efficient routing algorithms in the P2P system but it is ill-suited for direct deploying in MANET. DHT ignores the physical deployment of nodes in the network topology and causes expansive routing overhead.
Therefore, in this thesis, we present a locality-aware and constant-time lookup routing protocol – SLSR that concentrates on reducing routing overhead, providing fault-tolerance and load-balance strategy in the cluster-based MANET. Our approach utilizes the concept of super-peer P2P network and Random Landmarking (RLM) to construct locality-aware cluster in order to decreasing the overhead in the whole network to provide efficient routing approach.
We compare our approach performance with MADPastry agent by simulation. The MADPastry is similar as our approach both using RLM to construct locality-aware cluster and causes large overhead. The simulation results show that our approach has low communication overheads and hop counts for each routing.
|
|---|
